java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-1cceb4a
[2018-01-29 23:48:02,212 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-29 23:48:02,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-29 23:48:02,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-29 23:48:02,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-29 23:48:02,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-29 23:48:02,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-29 23:48:02,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-29 23:48:02,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-29 23:48:02,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-29 23:48:02,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-29 23:48:02,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-29 23:48:02,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-29 23:48:02,239 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-29 23:48:02,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-29 23:48:02,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-29 23:48:02,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-29 23:48:02,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-29 23:48:02,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-29 23:48:02,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-29 23:48:02,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-29 23:48:02,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-29 23:48:02,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-29 23:48:02,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-29 23:48:02,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-29 23:48:02,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-29 23:48:02,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-29 23:48:02,256 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-29 23:48:02,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-29 23:48:02,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-29 23:48:02,257 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-29 23:48:02,257 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-29 23:48:02,267 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-29 23:48:02,267 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-29 23:48:02,268 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-29 23:48:02,268 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-29 23:48:02,268 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-29 23:48:02,268 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-29 23:48:02,269 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-29 23:48:02,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-29 23:48:02,270 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-29 23:48:02,270 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-29 23:48:02,270 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-29 23:48:02,270 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-29 23:48:02,270 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-29 23:48:02,271 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-29 23:48:02,271 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-29 23:48:02,271 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-29 23:48:02,271 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-29 23:48:02,271 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-29 23:48:02,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-29 23:48:02,272 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-29 23:48:02,272 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-29 23:48:02,272 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-29 23:48:02,272 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-29 23:48:02,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 23:48:02,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-29 23:48:02,273 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-29 23:48:02,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-29 23:48:02,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-29 23:48:02,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-29 23:48:02,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-29 23:48:02,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-29 23:48:02,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-29 23:48:02,275 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-29 23:48:02,275 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-29 23:48:02,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-29 23:48:02,324 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-29 23:48:02,328 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-29 23:48:02,329 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-29 23:48:02,330 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-29 23:48:02,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i
[2018-01-29 23:48:02,479 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-29 23:48:02,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-29 23:48:02,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-29 23:48:02,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-29 23:48:02,489 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-29 23:48:02,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:48:02" (1/1) ...
[2018-01-29 23:48:02,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be68e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02, skipping insertion in model container
[2018-01-29 23:48:02,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:48:02" (1/1) ...
[2018-01-29 23:48:02,511 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 23:48:02,551 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 23:48:02,667 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 23:48:02,684 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 23:48:02,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02 WrapperNode
[2018-01-29 23:48:02,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-29 23:48:02,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-29 23:48:02,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-29 23:48:02,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-29 23:48:02,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ...
[2018-01-29 23:48:02,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ...
[2018-01-29 23:48:02,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ...
[2018-01-29 23:48:02,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ...
[2018-01-29 23:48:02,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ...
[2018-01-29 23:48:02,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ...
[2018-01-29 23:48:02,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ...
[2018-01-29 23:48:02,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-29 23:48:02,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-29 23:48:02,737 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-29 23:48:02,738 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-29 23:48:02,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 23:48:02,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-29 23:48:02,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-29 23:48:02,795 INFO L136 BoogieDeclarations]: Found implementation of procedure append
[2018-01-29 23:48:02,795 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-29 23:48:02,795 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-01-29 23:48:02,795 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-01-29 23:48:02,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-29 23:48:02,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-29 23:48:02,796 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-29 23:48:02,796 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-01-29 23:48:02,796 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-01-29 23:48:02,796 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-29 23:48:02,796 INFO L128 BoogieDeclarations]: Found specification of procedure append
[2018-01-29 23:48:02,796 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-29 23:48:02,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-29 23:48:02,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-29 23:48:03,240 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-29 23:48:03,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:48:03 BoogieIcfgContainer
[2018-01-29 23:48:03,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-29 23:48:03,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-29 23:48:03,242 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-29 23:48:03,244 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-29 23:48:03,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:48:02" (1/3) ...
[2018-01-29 23:48:03,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174df735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:48:03, skipping insertion in model container
[2018-01-29 23:48:03,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (2/3) ...
[2018-01-29 23:48:03,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174df735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:48:03, skipping insertion in model container
[2018-01-29 23:48:03,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:48:03" (3/3) ...
[2018-01-29 23:48:03,248 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i
[2018-01-29 23:48:03,257 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-29 23:48:03,265 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations.
[2018-01-29 23:48:03,303 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-29 23:48:03,303 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-29 23:48:03,303 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-29 23:48:03,304 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-29 23:48:03,304 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-29 23:48:03,304 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-29 23:48:03,304 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-29 23:48:03,304 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-29 23:48:03,305 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-29 23:48:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states.
[2018-01-29 23:48:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-29 23:48:03,333 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:03,334 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:03,334 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash 900553852, now seen corresponding path program 1 times
[2018-01-29 23:48:03,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:03,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:03,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:03,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:03,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:03,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:03,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:03,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-29 23:48:03,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-29 23:48:03,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-29 23:48:03,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:48:03,501 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states.
[2018-01-29 23:48:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:03,796 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions.
[2018-01-29 23:48:03,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-29 23:48:03,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2018-01-29 23:48:03,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:03,807 INFO L225 Difference]: With dead ends: 197
[2018-01-29 23:48:03,808 INFO L226 Difference]: Without dead ends: 127
[2018-01-29 23:48:03,810 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:48:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2018-01-29 23:48:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122.
[2018-01-29 23:48:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states.
[2018-01-29 23:48:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions.
[2018-01-29 23:48:03,851 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 9
[2018-01-29 23:48:03,852 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:03,852 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions.
[2018-01-29 23:48:03,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-29 23:48:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions.
[2018-01-29 23:48:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-29 23:48:03,852 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:03,853 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:03,853 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:03,853 INFO L82 PathProgramCache]: Analyzing trace with hash 900553853, now seen corresponding path program 1 times
[2018-01-29 23:48:03,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:03,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:03,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:03,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:03,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:03,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:03,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:03,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-29 23:48:03,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-29 23:48:03,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-29 23:48:03,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:48:03,927 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 3 states.
[2018-01-29 23:48:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:04,050 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions.
[2018-01-29 23:48:04,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-29 23:48:04,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2018-01-29 23:48:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:04,052 INFO L225 Difference]: With dead ends: 124
[2018-01-29 23:48:04,052 INFO L226 Difference]: Without dead ends: 123
[2018-01-29 23:48:04,053 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:48:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2018-01-29 23:48:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121.
[2018-01-29 23:48:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2018-01-29 23:48:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions.
[2018-01-29 23:48:04,061 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 9
[2018-01-29 23:48:04,061 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:04,061 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions.
[2018-01-29 23:48:04,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-29 23:48:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions.
[2018-01-29 23:48:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-01-29 23:48:04,062 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:04,062 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:04,062 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:04,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1990506389, now seen corresponding path program 1 times
[2018-01-29 23:48:04,062 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:04,062 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:04,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:04,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:04,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:04,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:04,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:04,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:48:04,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:48:04,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:48:04,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:48:04,168 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 5 states.
[2018-01-29 23:48:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:04,439 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions.
[2018-01-29 23:48:04,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-29 23:48:04,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19
[2018-01-29 23:48:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:04,441 INFO L225 Difference]: With dead ends: 121
[2018-01-29 23:48:04,442 INFO L226 Difference]: Without dead ends: 117
[2018-01-29 23:48:04,442 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-01-29 23:48:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2018-01-29 23:48:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114.
[2018-01-29 23:48:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-01-29 23:48:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions.
[2018-01-29 23:48:04,451 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 19
[2018-01-29 23:48:04,451 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:04,451 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions.
[2018-01-29 23:48:04,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:48:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions.
[2018-01-29 23:48:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-01-29 23:48:04,452 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:04,452 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:04,453 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1990506390, now seen corresponding path program 1 times
[2018-01-29 23:48:04,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:04,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:04,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:04,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:04,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:04,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:04,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:04,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-29 23:48:04,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-29 23:48:04,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-29 23:48:04,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:48:04,586 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 7 states.
[2018-01-29 23:48:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:04,752 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions.
[2018-01-29 23:48:04,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 23:48:04,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19
[2018-01-29 23:48:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:04,753 INFO L225 Difference]: With dead ends: 114
[2018-01-29 23:48:04,753 INFO L226 Difference]: Without dead ends: 105
[2018-01-29 23:48:04,754 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2018-01-29 23:48:04,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2018-01-29 23:48:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105.
[2018-01-29 23:48:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states.
[2018-01-29 23:48:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions.
[2018-01-29 23:48:04,761 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 19
[2018-01-29 23:48:04,761 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:04,761 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions.
[2018-01-29 23:48:04,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-29 23:48:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions.
[2018-01-29 23:48:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-29 23:48:04,762 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:04,762 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:04,762 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:04,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1576156004, now seen corresponding path program 1 times
[2018-01-29 23:48:04,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:04,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:04,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:04,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:04,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:04,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:04,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:04,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:48:04,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:48:04,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:48:04,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:48:04,816 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 4 states.
[2018-01-29 23:48:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:04,911 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions.
[2018-01-29 23:48:04,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:48:04,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2018-01-29 23:48:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:04,913 INFO L225 Difference]: With dead ends: 105
[2018-01-29 23:48:04,913 INFO L226 Difference]: Without dead ends: 101
[2018-01-29 23:48:04,914 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:48:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2018-01-29 23:48:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101.
[2018-01-29 23:48:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states.
[2018-01-29 23:48:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions.
[2018-01-29 23:48:04,920 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 20
[2018-01-29 23:48:04,920 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:04,920 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions.
[2018-01-29 23:48:04,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:48:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions.
[2018-01-29 23:48:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-29 23:48:04,921 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:04,921 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:04,922 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1576156005, now seen corresponding path program 1 times
[2018-01-29 23:48:04,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:04,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:04,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:04,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:04,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:04,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:04,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:04,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:48:04,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:48:04,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:48:04,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:48:04,987 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 4 states.
[2018-01-29 23:48:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:05,038 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions.
[2018-01-29 23:48:05,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:48:05,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2018-01-29 23:48:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:05,040 INFO L225 Difference]: With dead ends: 101
[2018-01-29 23:48:05,040 INFO L226 Difference]: Without dead ends: 97
[2018-01-29 23:48:05,040 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:48:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2018-01-29 23:48:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2018-01-29 23:48:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2018-01-29 23:48:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions.
[2018-01-29 23:48:05,047 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 20
[2018-01-29 23:48:05,048 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:05,048 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions.
[2018-01-29 23:48:05,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:48:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions.
[2018-01-29 23:48:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-29 23:48:05,049 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:05,049 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:05,049 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:05,049 INFO L82 PathProgramCache]: Analyzing trace with hash -417630144, now seen corresponding path program 1 times
[2018-01-29 23:48:05,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:05,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:05,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:05,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:05,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:05,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:05,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:05,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 23:48:05,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-29 23:48:05,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-29 23:48:05,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-01-29 23:48:05,184 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 8 states.
[2018-01-29 23:48:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:05,411 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions.
[2018-01-29 23:48:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-01-29 23:48:05,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25
[2018-01-29 23:48:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:05,413 INFO L225 Difference]: With dead ends: 205
[2018-01-29 23:48:05,413 INFO L226 Difference]: Without dead ends: 118
[2018-01-29 23:48:05,414 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2018-01-29 23:48:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2018-01-29 23:48:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110.
[2018-01-29 23:48:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states.
[2018-01-29 23:48:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions.
[2018-01-29 23:48:05,422 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 25
[2018-01-29 23:48:05,423 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:05,423 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions.
[2018-01-29 23:48:05,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-29 23:48:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions.
[2018-01-29 23:48:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-01-29 23:48:05,425 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:05,425 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:05,426 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1648327951, now seen corresponding path program 1 times
[2018-01-29 23:48:05,426 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:05,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:05,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:05,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:05,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:05,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:05,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:05,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-29 23:48:05,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-29 23:48:05,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-29 23:48:05,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:48:05,550 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 7 states.
[2018-01-29 23:48:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:05,730 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions.
[2018-01-29 23:48:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-29 23:48:05,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42
[2018-01-29 23:48:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:05,732 INFO L225 Difference]: With dead ends: 125
[2018-01-29 23:48:05,732 INFO L226 Difference]: Without dead ends: 124
[2018-01-29 23:48:05,732 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2018-01-29 23:48:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2018-01-29 23:48:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109.
[2018-01-29 23:48:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2018-01-29 23:48:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions.
[2018-01-29 23:48:05,738 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 42
[2018-01-29 23:48:05,738 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:05,738 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions.
[2018-01-29 23:48:05,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-29 23:48:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions.
[2018-01-29 23:48:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-01-29 23:48:05,740 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:05,740 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:05,740 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1648327950, now seen corresponding path program 1 times
[2018-01-29 23:48:05,740 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:05,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:05,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:05,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:05,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:05,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:05,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:05,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 23:48:05,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-29 23:48:05,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-29 23:48:05,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-01-29 23:48:05,972 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 9 states.
[2018-01-29 23:48:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:06,159 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions.
[2018-01-29 23:48:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-01-29 23:48:06,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42
[2018-01-29 23:48:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:06,160 INFO L225 Difference]: With dead ends: 128
[2018-01-29 23:48:06,161 INFO L226 Difference]: Without dead ends: 127
[2018-01-29 23:48:06,161 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240
[2018-01-29 23:48:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2018-01-29 23:48:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108.
[2018-01-29 23:48:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states.
[2018-01-29 23:48:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions.
[2018-01-29 23:48:06,165 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 42
[2018-01-29 23:48:06,166 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:06,166 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions.
[2018-01-29 23:48:06,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-29 23:48:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions.
[2018-01-29 23:48:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-01-29 23:48:06,167 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:06,167 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:06,167 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash 833267610, now seen corresponding path program 1 times
[2018-01-29 23:48:06,167 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:06,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:06,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:06,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:06,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:06,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:06,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:06,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 23:48:06,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:48:06,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:48:06,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:48:06,237 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 5 states.
[2018-01-29 23:48:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:06,278 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions.
[2018-01-29 23:48:06,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 23:48:06,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44
[2018-01-29 23:48:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:06,280 INFO L225 Difference]: With dead ends: 144
[2018-01-29 23:48:06,280 INFO L226 Difference]: Without dead ends: 120
[2018-01-29 23:48:06,281 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:48:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2018-01-29 23:48:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115.
[2018-01-29 23:48:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states.
[2018-01-29 23:48:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions.
[2018-01-29 23:48:06,287 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 44
[2018-01-29 23:48:06,287 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:06,288 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions.
[2018-01-29 23:48:06,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:48:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions.
[2018-01-29 23:48:06,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-01-29 23:48:06,289 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:06,289 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:06,289 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1814123838, now seen corresponding path program 1 times
[2018-01-29 23:48:06,290 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:06,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:06,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:06,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:06,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:06,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:06,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:06,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:48:06,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:48:06,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:48:06,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:48:06,358 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 5 states.
[2018-01-29 23:48:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:06,470 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions.
[2018-01-29 23:48:06,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 23:48:06,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47
[2018-01-29 23:48:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:06,472 INFO L225 Difference]: With dead ends: 115
[2018-01-29 23:48:06,472 INFO L226 Difference]: Without dead ends: 114
[2018-01-29 23:48:06,472 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:48:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2018-01-29 23:48:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114.
[2018-01-29 23:48:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-01-29 23:48:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions.
[2018-01-29 23:48:06,477 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 47
[2018-01-29 23:48:06,477 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:06,478 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions.
[2018-01-29 23:48:06,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:48:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions.
[2018-01-29 23:48:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-01-29 23:48:06,479 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:06,479 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:06,479 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:06,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1814123839, now seen corresponding path program 1 times
[2018-01-29 23:48:06,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:06,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:06,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:06,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:06,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:06,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:06,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:06,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-01-29 23:48:06,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-01-29 23:48:06,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-01-29 23:48:06,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2018-01-29 23:48:06,758 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 11 states.
[2018-01-29 23:48:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:07,103 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions.
[2018-01-29 23:48:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-01-29 23:48:07,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47
[2018-01-29 23:48:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:07,105 INFO L225 Difference]: With dead ends: 133
[2018-01-29 23:48:07,105 INFO L226 Difference]: Without dead ends: 132
[2018-01-29 23:48:07,105 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306
[2018-01-29 23:48:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2018-01-29 23:48:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113.
[2018-01-29 23:48:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2018-01-29 23:48:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions.
[2018-01-29 23:48:07,114 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 47
[2018-01-29 23:48:07,114 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:07,115 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions.
[2018-01-29 23:48:07,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-01-29 23:48:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions.
[2018-01-29 23:48:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-01-29 23:48:07,116 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:07,116 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:07,116 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:07,117 INFO L82 PathProgramCache]: Analyzing trace with hash 403264150, now seen corresponding path program 1 times
[2018-01-29 23:48:07,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:07,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:07,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:07,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:07,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:07,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:07,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:07,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-29 23:48:07,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-29 23:48:07,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-29 23:48:07,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2018-01-29 23:48:07,714 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 15 states.
[2018-01-29 23:48:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:08,639 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions.
[2018-01-29 23:48:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-01-29 23:48:08,639 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48
[2018-01-29 23:48:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:08,641 INFO L225 Difference]: With dead ends: 174
[2018-01-29 23:48:08,641 INFO L226 Difference]: Without dead ends: 173
[2018-01-29 23:48:08,641 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122
[2018-01-29 23:48:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2018-01-29 23:48:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129.
[2018-01-29 23:48:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-01-29 23:48:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions.
[2018-01-29 23:48:08,650 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 48
[2018-01-29 23:48:08,650 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:08,650 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions.
[2018-01-29 23:48:08,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-29 23:48:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions.
[2018-01-29 23:48:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-01-29 23:48:08,652 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:08,652 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:08,652 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:08,652 INFO L82 PathProgramCache]: Analyzing trace with hash 403264151, now seen corresponding path program 1 times
[2018-01-29 23:48:08,652 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:08,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:08,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:08,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:08,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:08,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:09,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:09,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-29 23:48:09,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-29 23:48:09,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-29 23:48:09,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2018-01-29 23:48:09,012 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 15 states.
[2018-01-29 23:48:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:09,733 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions.
[2018-01-29 23:48:09,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-01-29 23:48:09,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48
[2018-01-29 23:48:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:09,734 INFO L225 Difference]: With dead ends: 163
[2018-01-29 23:48:09,734 INFO L226 Difference]: Without dead ends: 162
[2018-01-29 23:48:09,735 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992
[2018-01-29 23:48:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2018-01-29 23:48:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 129.
[2018-01-29 23:48:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-01-29 23:48:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions.
[2018-01-29 23:48:09,743 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 48
[2018-01-29 23:48:09,744 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:09,744 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions.
[2018-01-29 23:48:09,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-29 23:48:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions.
[2018-01-29 23:48:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-01-29 23:48:09,745 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:09,745 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:09,745 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash 618788610, now seen corresponding path program 1 times
[2018-01-29 23:48:09,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:09,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:09,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:09,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:09,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:09,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:10,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:10,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-29 23:48:10,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-29 23:48:10,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-29 23:48:10,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2018-01-29 23:48:10,127 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand 15 states.
[2018-01-29 23:48:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:11,017 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions.
[2018-01-29 23:48:11,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-01-29 23:48:11,018 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51
[2018-01-29 23:48:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:11,019 INFO L225 Difference]: With dead ends: 196
[2018-01-29 23:48:11,019 INFO L226 Difference]: Without dead ends: 195
[2018-01-29 23:48:11,020 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992
[2018-01-29 23:48:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states.
[2018-01-29 23:48:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 147.
[2018-01-29 23:48:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-01-29 23:48:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions.
[2018-01-29 23:48:11,029 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 51
[2018-01-29 23:48:11,030 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:11,030 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions.
[2018-01-29 23:48:11,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-29 23:48:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions.
[2018-01-29 23:48:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-01-29 23:48:11,031 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:11,031 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:11,031 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:11,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2002577754, now seen corresponding path program 1 times
[2018-01-29 23:48:11,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:11,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:11,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:11,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:11,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:11,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:11,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:11,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-29 23:48:11,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-29 23:48:11,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-29 23:48:11,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-01-29 23:48:11,138 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 8 states.
[2018-01-29 23:48:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:11,378 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions.
[2018-01-29 23:48:11,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-29 23:48:11,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52
[2018-01-29 23:48:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:11,380 INFO L225 Difference]: With dead ends: 166
[2018-01-29 23:48:11,380 INFO L226 Difference]: Without dead ends: 165
[2018-01-29 23:48:11,381 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2018-01-29 23:48:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states.
[2018-01-29 23:48:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 146.
[2018-01-29 23:48:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states.
[2018-01-29 23:48:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions.
[2018-01-29 23:48:11,393 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 52
[2018-01-29 23:48:11,393 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:11,393 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions.
[2018-01-29 23:48:11,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-29 23:48:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions.
[2018-01-29 23:48:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-01-29 23:48:11,394 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:11,394 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:11,394 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2002577755, now seen corresponding path program 1 times
[2018-01-29 23:48:11,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:11,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:11,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:11,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:11,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:11,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:12,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:12,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-29 23:48:12,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-29 23:48:12,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-29 23:48:12,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2018-01-29 23:48:12,018 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 15 states.
[2018-01-29 23:48:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:12,663 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions.
[2018-01-29 23:48:12,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-01-29 23:48:12,664 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52
[2018-01-29 23:48:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:12,665 INFO L225 Difference]: With dead ends: 177
[2018-01-29 23:48:12,665 INFO L226 Difference]: Without dead ends: 176
[2018-01-29 23:48:12,665 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756
[2018-01-29 23:48:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2018-01-29 23:48:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 147.
[2018-01-29 23:48:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-01-29 23:48:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions.
[2018-01-29 23:48:12,672 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 52
[2018-01-29 23:48:12,672 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:12,672 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions.
[2018-01-29 23:48:12,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-29 23:48:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions.
[2018-01-29 23:48:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-01-29 23:48:12,673 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:12,673 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:12,673 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1385098437, now seen corresponding path program 1 times
[2018-01-29 23:48:12,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:12,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:12,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:12,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:12,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:12,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:12,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:48:12,915 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:48:12,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:12,973 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:48:13,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:48:13,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:48:13,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:13,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:13,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:13,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9
[2018-01-29 23:48:13,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15
[2018-01-29 23:48:13,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:13,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:13,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18
[2018-01-29 23:48:13,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35
[2018-01-29 23:48:13,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2018-01-29 23:48:13,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:13,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:13,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:13,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-01-29 23:48:13,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28
[2018-01-29 23:48:13,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5
[2018-01-29 23:48:13,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:13,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:13,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:13,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11
[2018-01-29 23:48:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:13,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:48:13,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19
[2018-01-29 23:48:13,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-01-29 23:48:13,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-01-29 23:48:13,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380
[2018-01-29 23:48:13,738 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 20 states.
[2018-01-29 23:48:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:14,550 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions.
[2018-01-29 23:48:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-01-29 23:48:14,550 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54
[2018-01-29 23:48:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:14,551 INFO L225 Difference]: With dead ends: 172
[2018-01-29 23:48:14,552 INFO L226 Difference]: Without dead ends: 171
[2018-01-29 23:48:14,552 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930
[2018-01-29 23:48:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2018-01-29 23:48:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 156.
[2018-01-29 23:48:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states.
[2018-01-29 23:48:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions.
[2018-01-29 23:48:14,560 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 54
[2018-01-29 23:48:14,561 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:14,561 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions.
[2018-01-29 23:48:14,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-01-29 23:48:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions.
[2018-01-29 23:48:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-01-29 23:48:14,561 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:14,561 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:14,561 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1385098436, now seen corresponding path program 1 times
[2018-01-29 23:48:14,562 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:14,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:14,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:14,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:14,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:14,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:14,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:48:14,935 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:48:14,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:14,992 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:48:15,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:48:15,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:48:15,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:48:15,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:48:15,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26
[2018-01-29 23:48:15,223 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:15,224 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:15,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-01-29 23:48:15,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-01-29 23:48:15,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33
[2018-01-29 23:48:15,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33
[2018-01-29 23:48:15,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23
[2018-01-29 23:48:15,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41
[2018-01-29 23:48:15,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33
[2018-01-29 23:48:15,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,488 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:15,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52
[2018-01-29 23:48:15,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34
[2018-01-29 23:48:15,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10
[2018-01-29 23:48:15,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26
[2018-01-29 23:48:15,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3
[2018-01-29 23:48:15,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:15,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:15,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18
[2018-01-29 23:48:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:15,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:48:15,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21
[2018-01-29 23:48:15,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-01-29 23:48:15,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-01-29 23:48:15,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462
[2018-01-29 23:48:15,682 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 22 states.
[2018-01-29 23:48:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:16,433 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions.
[2018-01-29 23:48:16,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-01-29 23:48:16,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54
[2018-01-29 23:48:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:16,434 INFO L225 Difference]: With dead ends: 171
[2018-01-29 23:48:16,434 INFO L226 Difference]: Without dead ends: 170
[2018-01-29 23:48:16,435 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056
[2018-01-29 23:48:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2018-01-29 23:48:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 155.
[2018-01-29 23:48:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states.
[2018-01-29 23:48:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions.
[2018-01-29 23:48:16,440 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 54
[2018-01-29 23:48:16,440 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:16,440 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions.
[2018-01-29 23:48:16,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-01-29 23:48:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions.
[2018-01-29 23:48:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-01-29 23:48:16,441 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:16,441 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:16,441 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:16,441 INFO L82 PathProgramCache]: Analyzing trace with hash 331873979, now seen corresponding path program 1 times
[2018-01-29 23:48:16,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:16,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:16,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:16,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:16,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:16,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:16,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:16,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-01-29 23:48:16,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-29 23:48:16,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-29 23:48:16,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-01-29 23:48:16,572 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 10 states.
[2018-01-29 23:48:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:16,814 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions.
[2018-01-29 23:48:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-01-29 23:48:16,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54
[2018-01-29 23:48:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:16,815 INFO L225 Difference]: With dead ends: 170
[2018-01-29 23:48:16,816 INFO L226 Difference]: Without dead ends: 169
[2018-01-29 23:48:16,816 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2018-01-29 23:48:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2018-01-29 23:48:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161.
[2018-01-29 23:48:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states.
[2018-01-29 23:48:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions.
[2018-01-29 23:48:16,825 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 54
[2018-01-29 23:48:16,826 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:16,826 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions.
[2018-01-29 23:48:16,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-29 23:48:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions.
[2018-01-29 23:48:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-01-29 23:48:16,827 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:16,827 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:16,827 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash 895502578, now seen corresponding path program 1 times
[2018-01-29 23:48:16,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:16,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:16,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:16,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:16,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:16,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:16,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:16,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-29 23:48:16,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-29 23:48:16,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-29 23:48:16,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:48:16,919 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand 7 states.
[2018-01-29 23:48:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:16,971 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions.
[2018-01-29 23:48:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-29 23:48:16,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61
[2018-01-29 23:48:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:16,972 INFO L225 Difference]: With dead ends: 197
[2018-01-29 23:48:16,972 INFO L226 Difference]: Without dead ends: 173
[2018-01-29 23:48:16,973 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2018-01-29 23:48:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2018-01-29 23:48:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166.
[2018-01-29 23:48:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states.
[2018-01-29 23:48:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 174 transitions.
[2018-01-29 23:48:16,978 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 174 transitions. Word has length 61
[2018-01-29 23:48:16,978 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:16,978 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 174 transitions.
[2018-01-29 23:48:16,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-29 23:48:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 174 transitions.
[2018-01-29 23:48:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-01-29 23:48:16,979 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:16,979 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:16,979 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1583440559, now seen corresponding path program 1 times
[2018-01-29 23:48:16,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:16,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:16,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:16,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:16,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:17,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:18,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:48:18,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2018-01-29 23:48:18,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-01-29 23:48:18,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-01-29 23:48:18,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380
[2018-01-29 23:48:18,370 INFO L87 Difference]: Start difference. First operand 166 states and 174 transitions. Second operand 20 states.
[2018-01-29 23:48:18,977 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 88 DAG size of output 73
[2018-01-29 23:48:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:19,560 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions.
[2018-01-29 23:48:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-01-29 23:48:19,561 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63
[2018-01-29 23:48:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:19,562 INFO L225 Difference]: With dead ends: 176
[2018-01-29 23:48:19,562 INFO L226 Difference]: Without dead ends: 150
[2018-01-29 23:48:19,563 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056
[2018-01-29 23:48:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2018-01-29 23:48:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147.
[2018-01-29 23:48:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-01-29 23:48:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions.
[2018-01-29 23:48:19,569 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 63
[2018-01-29 23:48:19,569 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:19,569 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions.
[2018-01-29 23:48:19,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-01-29 23:48:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions.
[2018-01-29 23:48:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2018-01-29 23:48:19,570 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:19,570 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:19,571 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:19,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1178904772, now seen corresponding path program 1 times
[2018-01-29 23:48:19,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:19,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:19,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:19,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:19,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:19,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:19,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:48:19,837 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:48:19,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:19,888 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:48:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2018-01-29 23:48:20,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:48:20,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18
[2018-01-29 23:48:20,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-01-29 23:48:20,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-01-29 23:48:20,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306
[2018-01-29 23:48:20,046 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 18 states.
[2018-01-29 23:48:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:20,635 INFO L93 Difference]: Finished difference Result 240 states and 252 transitions.
[2018-01-29 23:48:20,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-01-29 23:48:20,636 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75
[2018-01-29 23:48:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:20,637 INFO L225 Difference]: With dead ends: 240
[2018-01-29 23:48:20,637 INFO L226 Difference]: Without dead ends: 121
[2018-01-29 23:48:20,638 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=1612, Unknown=0, NotChecked=0, Total=1892
[2018-01-29 23:48:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2018-01-29 23:48:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116.
[2018-01-29 23:48:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states.
[2018-01-29 23:48:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions.
[2018-01-29 23:48:20,647 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 75
[2018-01-29 23:48:20,647 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:20,647 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions.
[2018-01-29 23:48:20,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-01-29 23:48:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions.
[2018-01-29 23:48:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2018-01-29 23:48:20,648 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:20,649 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:20,649 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1951140529, now seen corresponding path program 1 times
[2018-01-29 23:48:20,649 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:20,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:20,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:20,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:20,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:20,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:21,729 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 50 DAG size of output 40
[2018-01-29 23:48:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:22,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:48:22,131 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:48:22,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:22,208 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:48:22,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:48:22,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 23:48:22,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:48:22,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:48:22,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29
[2018-01-29 23:48:22,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31
[2018-01-29 23:48:22,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18
[2018-01-29 23:48:22,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15
[2018-01-29 23:48:22,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:48:22,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:48:22,576 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,584 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42
[2018-01-29 23:48:22,623 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:22,623 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:22,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-01-29 23:48:22,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44
[2018-01-29 23:48:22,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:48:22,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:22,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26
[2018-01-29 23:48:23,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:48:23,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:48:23,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:23,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:154
[2018-01-29 23:48:23,302 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:23,303 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:23,304 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:23,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29
[2018-01-29 23:48:23,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 93
[2018-01-29 23:48:23,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38
[2018-01-29 23:48:23,336 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:23,336 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:48:23,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74
[2018-01-29 23:48:23,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,366 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:48:23,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 106
[2018-01-29 23:48:23,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55
[2018-01-29 23:48:23,374 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,389 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66
[2018-01-29 23:48:23,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56
[2018-01-29 23:48:23,417 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:23,440 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:23,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:23,453 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:197, output treesize:89
[2018-01-29 23:48:23,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 57
[2018-01-29 23:48:23,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42
[2018-01-29 23:48:23,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:23,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:73
[2018-01-29 23:48:23,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3
[2018-01-29 23:48:23,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55
[2018-01-29 23:48:23,901 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:48:23,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22
[2018-01-29 23:48:23,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,914 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:48:23,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-01-29 23:48:23,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,927 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:23,929 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:48:23,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17
[2018-01-29 23:48:23,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:23,946 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:89, output treesize:3
[2018-01-29 23:48:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:24,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:48:24,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 45
[2018-01-29 23:48:24,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-01-29 23:48:24,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-01-29 23:48:24,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1924, Unknown=0, NotChecked=0, Total=2070
[2018-01-29 23:48:24,018 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 46 states.
[2018-01-29 23:48:24,899 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 77 DAG size of output 73
[2018-01-29 23:48:26,228 WARN L146 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 124 DAG size of output 101
[2018-01-29 23:48:26,461 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 117 DAG size of output 96
[2018-01-29 23:48:26,666 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 104 DAG size of output 89
[2018-01-29 23:48:26,822 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 93 DAG size of output 77
[2018-01-29 23:48:27,986 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 115 DAG size of output 89
[2018-01-29 23:48:28,165 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 108 DAG size of output 84
[2018-01-29 23:48:28,332 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 95 DAG size of output 77
[2018-01-29 23:48:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:28,846 INFO L93 Difference]: Finished difference Result 185 states and 191 transitions.
[2018-01-29 23:48:28,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states.
[2018-01-29 23:48:28,846 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 78
[2018-01-29 23:48:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:28,847 INFO L225 Difference]: With dead ends: 185
[2018-01-29 23:48:28,847 INFO L226 Difference]: Without dead ends: 184
[2018-01-29 23:48:28,849 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2457 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=673, Invalid=7699, Unknown=0, NotChecked=0, Total=8372
[2018-01-29 23:48:28,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2018-01-29 23:48:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 115.
[2018-01-29 23:48:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states.
[2018-01-29 23:48:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions.
[2018-01-29 23:48:28,855 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 78
[2018-01-29 23:48:28,855 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:28,855 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions.
[2018-01-29 23:48:28,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-01-29 23:48:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions.
[2018-01-29 23:48:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2018-01-29 23:48:28,856 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:28,856 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:28,856 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1951140528, now seen corresponding path program 1 times
[2018-01-29 23:48:28,856 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:28,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:28,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:28,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:28,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:28,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:30,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:48:30,361 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:48:30,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:30,405 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:48:30,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:48:30,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 23:48:30,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:48:30,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20
[2018-01-29 23:48:30,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:48:30,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:48:30,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31
[2018-01-29 23:48:30,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-01-29 23:48:30,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2018-01-29 23:48:30,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:48:30,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:48:30,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44
[2018-01-29 23:48:30,733 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:30,734 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:30,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-01-29 23:48:30,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:30,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46
[2018-01-29 23:48:31,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:48:31,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:48:31,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:31,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:140
[2018-01-29 23:48:31,568 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:31,570 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:31,572 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:31,574 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:31,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 75
[2018-01-29 23:48:31,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 100
[2018-01-29 23:48:31,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42
[2018-01-29 23:48:31,614 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:31,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 57
[2018-01-29 23:48:31,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,636 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:31,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96
[2018-01-29 23:48:31,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45
[2018-01-29 23:48:31,641 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,660 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35
[2018-01-29 23:48:31,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31
[2018-01-29 23:48:31,682 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,685 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,702 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:185, output treesize:166
[2018-01-29 23:48:31,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 133
[2018-01-29 23:48:31,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 110
[2018-01-29 23:48:31,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:31,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:32,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:32,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:174, output treesize:131
[2018-01-29 23:48:32,075 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:32,077 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:32,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 80
[2018-01-29 23:48:32,083 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36
[2018-01-29 23:48:32,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:48:32,108 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:32,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 64
[2018-01-29 23:48:32,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts.
[2018-01-29 23:48:32,143 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:32,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40
[2018-01-29 23:48:32,156 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:32,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38
[2018-01-29 23:48:32,223 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:32,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42
[2018-01-29 23:48:32,225 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:32,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36
[2018-01-29 23:48:32,227 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:32,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32
[2018-01-29 23:48:32,230 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:32,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23
[2018-01-29 23:48:32,235 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:32,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts.
[2018-01-29 23:48:32,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts.
[2018-01-29 23:48:32,339 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:137, output treesize:177
[2018-01-29 23:48:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:32,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:48:32,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48
[2018-01-29 23:48:32,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states
[2018-01-29 23:48:32,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2018-01-29 23:48:32,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2207, Unknown=1, NotChecked=0, Total=2352
[2018-01-29 23:48:32,512 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 49 states.
[2018-01-29 23:48:38,859 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 75 DAG size of output 56
[2018-01-29 23:48:41,058 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 84 DAG size of output 58
[2018-01-29 23:48:41,305 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 106 DAG size of output 64
[2018-01-29 23:48:41,568 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 123 DAG size of output 69
[2018-01-29 23:48:41,960 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 132 DAG size of output 71
[2018-01-29 23:48:42,377 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 153 DAG size of output 99
[2018-01-29 23:48:42,667 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 145 DAG size of output 94
[2018-01-29 23:48:42,926 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 129 DAG size of output 87
[2018-01-29 23:48:43,154 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 121 DAG size of output 77
[2018-01-29 23:48:47,655 WARN L146 SmtUtils]: Spent 4372ms on a formula simplification. DAG size of input: 109 DAG size of output 65
[2018-01-29 23:48:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:48:48,385 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions.
[2018-01-29 23:48:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-01-29 23:48:48,385 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 78
[2018-01-29 23:48:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:48:48,387 INFO L225 Difference]: With dead ends: 118
[2018-01-29 23:48:48,387 INFO L226 Difference]: Without dead ends: 117
[2018-01-29 23:48:48,389 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=466, Invalid=5232, Unknown=2, NotChecked=0, Total=5700
[2018-01-29 23:48:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2018-01-29 23:48:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114.
[2018-01-29 23:48:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-01-29 23:48:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions.
[2018-01-29 23:48:48,396 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 78
[2018-01-29 23:48:48,396 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:48:48,396 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions.
[2018-01-29 23:48:48,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states.
[2018-01-29 23:48:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions.
[2018-01-29 23:48:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2018-01-29 23:48:48,396 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:48:48,396 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:48:48,396 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:48:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1659907497, now seen corresponding path program 1 times
[2018-01-29 23:48:48,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:48:48,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:48:48,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:48,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:48,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:48:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:48,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:48:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:49,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:48:49,621 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:48:49,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:48:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:48:49,664 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:48:49,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:48:49,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 23:48:49,792 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:49,793 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:49,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 23:48:49,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19
[2018-01-29 23:48:49,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:48:49,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:48:49,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30
[2018-01-29 23:48:49,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:48:49,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:48:49,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32
[2018-01-29 23:48:49,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26
[2018-01-29 23:48:49,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-01-29 23:48:49,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16
[2018-01-29 23:48:49,963 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:49,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:48:49,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:48:49,986 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72
[2018-01-29 23:48:50,032 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-01-29 23:48:50,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,042 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:50,043 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:50,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-01-29 23:48:50,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45
[2018-01-29 23:48:50,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:48:50,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:48:50,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:48:50,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:134
[2018-01-29 23:48:50,659 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:50,660 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:50,661 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:50,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21
[2018-01-29 23:48:50,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54
[2018-01-29 23:48:50,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2018-01-29 23:48:50,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 78
[2018-01-29 23:48:50,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38
[2018-01-29 23:48:50,710 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:50,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53
[2018-01-29 23:48:50,711 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,717 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,729 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:50,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76
[2018-01-29 23:48:50,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32
[2018-01-29 23:48:50,735 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,742 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,748 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,759 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:178, output treesize:110
[2018-01-29 23:48:50,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 95
[2018-01-29 23:48:50,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 76
[2018-01-29 23:48:50,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:50,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:88
[2018-01-29 23:48:51,064 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:51,068 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:51,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 57
[2018-01-29 23:48:51,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8
[2018-01-29 23:48:51,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:51,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-01-29 23:48:51,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:51,085 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:51,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15
[2018-01-29 23:48:51,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:51,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:51,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:51,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:10
[2018-01-29 23:48:51,133 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:48:51,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21
[2018-01-29 23:48:51,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:48:51,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:48:51,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34
[2018-01-29 23:48:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:48:51,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:48:51,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 48
[2018-01-29 23:48:51,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states
[2018-01-29 23:48:51,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2018-01-29 23:48:51,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2209, Unknown=1, NotChecked=0, Total=2352
[2018-01-29 23:48:51,263 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 49 states.
[2018-01-29 23:48:52,373 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 86 DAG size of output 75
[2018-01-29 23:48:55,855 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 107 DAG size of output 62
[2018-01-29 23:48:56,078 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 121 DAG size of output 67
[2018-01-29 23:48:56,298 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 129 DAG size of output 69
[2018-01-29 23:48:56,753 WARN L146 SmtUtils]: Spent 328ms on a formula simplification. DAG size of input: 135 DAG size of output 88
[2018-01-29 23:48:57,069 WARN L146 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 128 DAG size of output 83
[2018-01-29 23:48:57,331 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 115 DAG size of output 75
[2018-01-29 23:48:57,550 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 108 DAG size of output 65
[2018-01-29 23:48:58,269 WARN L146 SmtUtils]: Spent 630ms on a formula simplification. DAG size of input: 91 DAG size of output 77
[2018-01-29 23:48:59,375 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 123 DAG size of output 54
[2018-01-29 23:48:59,732 WARN L146 SmtUtils]: Spent 302ms on a formula simplification. DAG size of input: 129 DAG size of output 83
[2018-01-29 23:49:00,022 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 122 DAG size of output 78
[2018-01-29 23:49:00,312 WARN L146 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 109 DAG size of output 70
[2018-01-29 23:49:00,569 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 102 DAG size of output 62
[2018-01-29 23:49:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:00,925 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions.
[2018-01-29 23:49:00,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-01-29 23:49:00,926 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 81
[2018-01-29 23:49:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:00,927 INFO L225 Difference]: With dead ends: 182
[2018-01-29 23:49:00,927 INFO L226 Difference]: Without dead ends: 181
[2018-01-29 23:49:00,928 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=658, Invalid=6996, Unknown=2, NotChecked=0, Total=7656
[2018-01-29 23:49:00,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2018-01-29 23:49:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135.
[2018-01-29 23:49:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states.
[2018-01-29 23:49:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions.
[2018-01-29 23:49:00,937 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 81
[2018-01-29 23:49:00,937 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:00,937 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions.
[2018-01-29 23:49:00,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states.
[2018-01-29 23:49:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions.
[2018-01-29 23:49:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2018-01-29 23:49:00,937 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:00,938 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:00,938 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash -82475116, now seen corresponding path program 1 times
[2018-01-29 23:49:00,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:00,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:00,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:00,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:00,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:00,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:02,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:49:02,186 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:49:02,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:02,241 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:49:02,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:49:02,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 23:49:02,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:49:02,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20
[2018-01-29 23:49:02,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:49:02,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:49:02,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31
[2018-01-29 23:49:02,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-01-29 23:49:02,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27
[2018-01-29 23:49:02,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:02,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17
[2018-01-29 23:49:02,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:49:02,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:49:02,522 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,530 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39
[2018-01-29 23:49:02,568 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:02,569 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:02,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-01-29 23:49:02,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41
[2018-01-29 23:49:02,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:49:02,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:02,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26
[2018-01-29 23:49:03,312 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 72 DAG size of output 56
[2018-01-29 23:49:03,317 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:03,319 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:03,322 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:03,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21
[2018-01-29 23:49:03,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2018-01-29 23:49:03,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42
[2018-01-29 23:49:03,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,377 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85
[2018-01-29 23:49:03,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76
[2018-01-29 23:49:03,382 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70
[2018-01-29 23:49:03,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30
[2018-01-29 23:49:03,450 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49: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 30 treesize of output 37
[2018-01-29 23:49:03,452 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,457 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,474 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:03,475 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:03,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73
[2018-01-29 23:49:03,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32
[2018-01-29 23:49:03,479 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,489 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,497 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,501 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:03,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94
[2018-01-29 23:49:03,511 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:03,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 67
[2018-01-29 23:49:03,513 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 50
[2018-01-29 23:49:03,530 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:03,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34
[2018-01-29 23:49:03,532 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:03,543 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:03,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35
[2018-01-29 23:49:03,546 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,555 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,565 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:03,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29
[2018-01-29 23:49:03,568 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:03,568 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:03,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35
[2018-01-29 23:49:03,571 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,576 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,581 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:03,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:03,601 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:154, output treesize:127
[2018-01-29 23:49:04,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58
[2018-01-29 23:49:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-01-29 23:49:04,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:04,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:04,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 120
[2018-01-29 23:49:04,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-01-29 23:49:04,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:04,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:04,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:04,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:165
[2018-01-29 23:49:04,249 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:04,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62
[2018-01-29 23:49:04,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:04,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 113
[2018-01-29 23:49:04,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:04,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:04,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:199, output treesize:169
[2018-01-29 23:49:04,492 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:04,495 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:04,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 157
[2018-01-29 23:49:04,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:04,517 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:04,518 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:04,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 99
[2018-01-29 23:49:04,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:04,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts.
[2018-01-29 23:49:04,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:543, output treesize:469
[2018-01-29 23:49:04,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46
[2018-01-29 23:49:04,901 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:04,909 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:04,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28
[2018-01-29 23:49:04,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:04,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:04,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43
[2018-01-29 23:49:04,988 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:04,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21
[2018-01-29 23:49:04,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:04,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:05,050 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:05,055 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:05,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 85
[2018-01-29 23:49:05,063 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30
[2018-01-29 23:49:05,064 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:05,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2018-01-29 23:49:05,085 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:05,108 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:05,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24
[2018-01-29 23:49:05,109 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:05,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:05,165 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:05,166 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:05,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 83
[2018-01-29 23:49:05,174 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 36
[2018-01-29 23:49:05,175 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:05,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24
[2018-01-29 23:49:05,199 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:05,215 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:05,215 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:05,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26
[2018-01-29 23:49:05,218 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:05,229 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:05,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts.
[2018-01-29 23:49:05,269 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:365, output treesize:69
[2018-01-29 23:49:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:05,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:49:05,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 50
[2018-01-29 23:49:05,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states
[2018-01-29 23:49:05,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2018-01-29 23:49:05,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2390, Unknown=16, NotChecked=0, Total=2550
[2018-01-29 23:49:05,442 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 51 states.
[2018-01-29 23:49:07,860 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 129 DAG size of output 95
[2018-01-29 23:49:08,062 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 122 DAG size of output 90
[2018-01-29 23:49:08,233 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 109 DAG size of output 82
[2018-01-29 23:49:08,584 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 94 DAG size of output 79
[2018-01-29 23:49:09,312 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 82 DAG size of output 69
[2018-01-29 23:49:09,550 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 102 DAG size of output 82
[2018-01-29 23:49:09,912 WARN L146 SmtUtils]: Spent 283ms on a formula simplification. DAG size of input: 162 DAG size of output 122
[2018-01-29 23:49:10,121 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 150 DAG size of output 117
[2018-01-29 23:49:10,304 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 133 DAG size of output 113
[2018-01-29 23:49:10,522 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 150 DAG size of output 130
[2018-01-29 23:49:11,121 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 114 DAG size of output 80
[2018-01-29 23:49:11,291 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 107 DAG size of output 75
[2018-01-29 23:49:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:11,969 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions.
[2018-01-29 23:49:11,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2018-01-29 23:49:11,969 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 82
[2018-01-29 23:49:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:11,970 INFO L225 Difference]: With dead ends: 181
[2018-01-29 23:49:11,970 INFO L226 Difference]: Without dead ends: 180
[2018-01-29 23:49:11,972 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=614, Invalid=7701, Unknown=57, NotChecked=0, Total=8372
[2018-01-29 23:49:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2018-01-29 23:49:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 136.
[2018-01-29 23:49:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states.
[2018-01-29 23:49:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 139 transitions.
[2018-01-29 23:49:11,980 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 139 transitions. Word has length 82
[2018-01-29 23:49:11,980 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:11,981 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 139 transitions.
[2018-01-29 23:49:11,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states.
[2018-01-29 23:49:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions.
[2018-01-29 23:49:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2018-01-29 23:49:11,981 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:11,981 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:11,981 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1949175116, now seen corresponding path program 1 times
[2018-01-29 23:49:11,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:11,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:11,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:11,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:11,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:11,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:12,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:49:12,275 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:49:12,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:12,321 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:49:12,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:49:12,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:49:12,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:12,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:12,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:12,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18
[2018-01-29 23:49:12,381 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:12,381 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:12,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-01-29 23:49:12,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:12,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:12,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20
[2018-01-29 23:49:12,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18
[2018-01-29 23:49:12,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9
[2018-01-29 23:49:12,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:12,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:12,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:12,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14
[2018-01-29 23:49:12,413 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:12,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21
[2018-01-29 23:49:12,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:12,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:12,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15
[2018-01-29 23:49:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:12,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:49:12,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 15
[2018-01-29 23:49:12,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-01-29 23:49:12,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-01-29 23:49:12,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240
[2018-01-29 23:49:12,463 INFO L87 Difference]: Start difference. First operand 136 states and 139 transitions. Second operand 16 states.
[2018-01-29 23:49:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:12,690 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions.
[2018-01-29 23:49:12,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-29 23:49:12,690 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84
[2018-01-29 23:49:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:12,691 INFO L225 Difference]: With dead ends: 151
[2018-01-29 23:49:12,691 INFO L226 Difference]: Without dead ends: 150
[2018-01-29 23:49:12,691 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650
[2018-01-29 23:49:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2018-01-29 23:49:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135.
[2018-01-29 23:49:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states.
[2018-01-29 23:49:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions.
[2018-01-29 23:49:12,699 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 84
[2018-01-29 23:49:12,699 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:12,699 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions.
[2018-01-29 23:49:12,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-01-29 23:49:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions.
[2018-01-29 23:49:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2018-01-29 23:49:12,700 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:12,700 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:12,700 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 416520921, now seen corresponding path program 1 times
[2018-01-29 23:49:12,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:12,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:12,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:12,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:12,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:12,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:14,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:49:14,564 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:49:14,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:14,612 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:49:14,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:49:14,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:14,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:14,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 23:49:14,809 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:14,810 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:14,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 23:49:14,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:14,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:14,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19
[2018-01-29 23:49:14,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:49:14,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:49:14,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:14,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:14,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:14,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30
[2018-01-29 23:49:14,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:49:14,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:49:14,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:14,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32
[2018-01-29 23:49:15,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2018-01-29 23:49:15,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26
[2018-01-29 23:49:15,043 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts.
[2018-01-29 23:49:15,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:49:15,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:49:15,065 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:71
[2018-01-29 23:49:15,123 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,124 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44
[2018-01-29 23:49:15,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:44
[2018-01-29 23:49:15,859 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,860 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-01-29 23:49:15,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85
[2018-01-29 23:49:15,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32
[2018-01-29 23:49:15,903 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 55
[2018-01-29 23:49:15,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,922 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,923 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84
[2018-01-29 23:49:15,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57
[2018-01-29 23:49:15,928 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,937 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,949 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:15,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107
[2018-01-29 23:49:15,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76
[2018-01-29 23:49:15,960 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,972 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 76
[2018-01-29 23:49:15,973 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:15,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46
[2018-01-29 23:49:15,985 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,985 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:15,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 61
[2018-01-29 23:49:15,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54
[2018-01-29 23:49:15,989 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:15,997 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:16,004 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:16,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2018-01-29 23:49:16,005 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:16,010 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:16,016 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:16,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33
[2018-01-29 23:49:16,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2018-01-29 23:49:16,038 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:16,044 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:16,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73
[2018-01-29 23:49:16,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21
[2018-01-29 23:49:16,047 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:16,055 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:16,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:16,073 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:155, output treesize:139
[2018-01-29 23:49:16,633 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:16,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, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 187
[2018-01-29 23:49:16,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts.
[2018-01-29 23:49:16,753 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:16,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 113
[2018-01-29 23:49:16,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-29 23:49:16,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts.
[2018-01-29 23:49:16,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:695, output treesize:823
[2018-01-29 23:49:17,193 WARN L146 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 83 DAG size of output 73
[2018-01-29 23:49:17,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 118
[2018-01-29 23:49:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 76
[2018-01-29 23:49:17,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81
[2018-01-29 23:49:17,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28
[2018-01-29 23:49:17,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 149
[2018-01-29 23:49:17,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30
[2018-01-29 23:49:17,470 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,485 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 147
[2018-01-29 23:49:17,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28
[2018-01-29 23:49:17,602 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,621 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175
[2018-01-29 23:49:17,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65
[2018-01-29 23:49:17,729 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,745 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83
[2018-01-29 23:49:17,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30
[2018-01-29 23:49:17,851 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,863 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:17,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts.
[2018-01-29 23:49:17,962 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:812, output treesize:678
[2018-01-29 23:49:18,156 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,157 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 95
[2018-01-29 23:49:18,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:18,230 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,232 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,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, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 145
[2018-01-29 23:49:18,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:18,292 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 147
[2018-01-29 23:49:18,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:18,452 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 81
[2018-01-29 23:49:18,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:18,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts.
[2018-01-29 23:49:18,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:656, output treesize:333
[2018-01-29 23:49:18,634 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,634 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,635 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,638 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107
[2018-01-29 23:49:18,650 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103
[2018-01-29 23:49:18,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:49:18,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:49:18,828 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,829 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,830 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,833 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:18,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 117
[2018-01-29 23:49:18,846 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 117
[2018-01-29 23:49:18,848 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:49:18,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:49:19,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts.
[2018-01-29 23:49:19,076 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:385, output treesize:603
[2018-01-29 23:49:21,361 WARN L146 SmtUtils]: Spent 2136ms on a formula simplification. DAG size of input: 164 DAG size of output 58
[2018-01-29 23:49:21,372 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:21,373 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:21,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75
[2018-01-29 23:49:21,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8
[2018-01-29 23:49:21,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:21,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20
[2018-01-29 23:49:21,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:21,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14
[2018-01-29 23:49:21,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:21,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:21,429 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:21,430 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:21,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69
[2018-01-29 23:49:21,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-01-29 23:49:21,434 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:21,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-01-29 23:49:21,445 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:21,453 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:21,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2018-01-29 23:49:21,454 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:21,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:21,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:21,475 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:163, output treesize:58
[2018-01-29 23:49:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:21,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:49:21,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 60
[2018-01-29 23:49:21,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states
[2018-01-29 23:49:21,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants.
[2018-01-29 23:49:21,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3424, Unknown=6, NotChecked=0, Total=3660
[2018-01-29 23:49:21,630 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 61 states.
[2018-01-29 23:49:28,175 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 118 DAG size of output 72
[2018-01-29 23:49:28,858 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 81 DAG size of output 70
[2018-01-29 23:49:30,001 WARN L146 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 100 DAG size of output 92
[2018-01-29 23:49:30,262 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 86 DAG size of output 82
[2018-01-29 23:49:30,722 WARN L146 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 100 DAG size of output 96
[2018-01-29 23:49:31,051 WARN L146 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 127 DAG size of output 79
[2018-01-29 23:49:31,230 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 103 DAG size of output 63
[2018-01-29 23:49:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:32,018 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions.
[2018-01-29 23:49:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2018-01-29 23:49:32,019 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 91
[2018-01-29 23:49:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:32,020 INFO L225 Difference]: With dead ends: 174
[2018-01-29 23:49:32,020 INFO L226 Difference]: Without dead ends: 173
[2018-01-29 23:49:32,022 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=733, Invalid=9361, Unknown=6, NotChecked=0, Total=10100
[2018-01-29 23:49:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2018-01-29 23:49:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 144.
[2018-01-29 23:49:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states.
[2018-01-29 23:49:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions.
[2018-01-29 23:49:32,030 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 91
[2018-01-29 23:49:32,030 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:32,030 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions.
[2018-01-29 23:49:32,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states.
[2018-01-29 23:49:32,031 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions.
[2018-01-29 23:49:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2018-01-29 23:49:32,031 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:32,031 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:32,031 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash 416520922, now seen corresponding path program 1 times
[2018-01-29 23:49:32,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:32,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:32,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:32,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:32,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:32,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:33,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:49:33,041 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:49:33,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:33,082 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:49:33,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:49:33,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:49:33,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7
[2018-01-29 23:49:33,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:49:33,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:49:33,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29
[2018-01-29 23:49:33,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18
[2018-01-29 23:49:33,333 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:33,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25
[2018-01-29 23:49:33,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:33,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:43
[2018-01-29 23:49:33,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-01-29 23:49:33,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2018-01-29 23:49:33,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27
[2018-01-29 23:49:33,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:33,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:33,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:33,482 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:121
[2018-01-29 23:49:33,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 87 treesize of output 71
[2018-01-29 23:49:33,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33
[2018-01-29 23:49:33,616 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:33,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42
[2018-01-29 23:49:33,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,635 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:33,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35
[2018-01-29 23:49:33,638 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:33,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30
[2018-01-29 23:49:33,640 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,645 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70
[2018-01-29 23:49:33,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26
[2018-01-29 23:49:33,662 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:33,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39
[2018-01-29 23:49:33,664 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,668 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,687 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:33,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48
[2018-01-29 23:49:33,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22
[2018-01-29 23:49:33,690 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,696 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,705 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41
[2018-01-29 23:49:33,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20
[2018-01-29 23:49:33,740 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:33,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23
[2018-01-29 23:49:33,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19
[2018-01-29 23:49:33,746 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,749 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,753 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,760 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:33,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:33,779 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:138, output treesize:71
[2018-01-29 23:49:34,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66
[2018-01-29 23:49:34,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 82
[2018-01-29 23:49:34,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:34,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:215, output treesize:149
[2018-01-29 23:49:34,272 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-01-29 23:49:34,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,275 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:34,275 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:34,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97
[2018-01-29 23:49:34,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,292 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:34,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 79
[2018-01-29 23:49:34,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49
[2018-01-29 23:49:34,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61
[2018-01-29 23:49:34,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47
[2018-01-29 23:49:34,319 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:34,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:34,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:34,352 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:191, output treesize:50
[2018-01-29 23:49:34,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24
[2018-01-29 23:49:34,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-01-29 23:49:34,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-01-29 23:49:34,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22
[2018-01-29 23:49:34,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-01-29 23:49:34,426 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-01-29 23:49:34,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,432 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:34,436 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:61, output treesize:9
[2018-01-29 23:49:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:34,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:49:34,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [23] total 40
[2018-01-29 23:49:34,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states
[2018-01-29 23:49:34,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2018-01-29 23:49:34,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1482, Unknown=4, NotChecked=0, Total=1640
[2018-01-29 23:49:34,519 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand 41 states.
[2018-01-29 23:49:39,482 WARN L146 SmtUtils]: Spent 4156ms on a formula simplification. DAG size of input: 86 DAG size of output 80
[2018-01-29 23:49:39,848 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 73 DAG size of output 49
[2018-01-29 23:49:40,073 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 87 DAG size of output 54
[2018-01-29 23:49:40,220 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 69 DAG size of output 49
[2018-01-29 23:49:40,715 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 67 DAG size of output 48
[2018-01-29 23:49:40,892 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 81 DAG size of output 51
[2018-01-29 23:49:41,033 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 62 DAG size of output 47
[2018-01-29 23:49:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:41,479 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions.
[2018-01-29 23:49:41,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-01-29 23:49:41,479 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 91
[2018-01-29 23:49:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:41,480 INFO L225 Difference]: With dead ends: 171
[2018-01-29 23:49:41,480 INFO L226 Difference]: Without dead ends: 170
[2018-01-29 23:49:41,481 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=513, Invalid=4590, Unknown=9, NotChecked=0, Total=5112
[2018-01-29 23:49:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2018-01-29 23:49:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 148.
[2018-01-29 23:49:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states.
[2018-01-29 23:49:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions.
[2018-01-29 23:49:41,490 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 91
[2018-01-29 23:49:41,491 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:41,491 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions.
[2018-01-29 23:49:41,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states.
[2018-01-29 23:49:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions.
[2018-01-29 23:49:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2018-01-29 23:49:41,492 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:41,492 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:41,492 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash 843568854, now seen corresponding path program 1 times
[2018-01-29 23:49:41,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:41,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:41,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:41,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:41,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:41,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-01-29 23:49:41,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:49:41,569 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:49:41,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:41,616 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:49:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-01-29 23:49:41,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:49:41,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10
[2018-01-29 23:49:41,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-29 23:49:41,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-29 23:49:41,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2018-01-29 23:49:41,756 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 10 states.
[2018-01-29 23:49:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:42,080 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions.
[2018-01-29 23:49:42,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-01-29 23:49:42,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93
[2018-01-29 23:49:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:42,081 INFO L225 Difference]: With dead ends: 153
[2018-01-29 23:49:42,082 INFO L226 Difference]: Without dead ends: 148
[2018-01-29 23:49:42,082 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240
[2018-01-29 23:49:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2018-01-29 23:49:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148.
[2018-01-29 23:49:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states.
[2018-01-29 23:49:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions.
[2018-01-29 23:49:42,092 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 93
[2018-01-29 23:49:42,093 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:42,093 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions.
[2018-01-29 23:49:42,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-29 23:49:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions.
[2018-01-29 23:49:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2018-01-29 23:49:42,094 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:42,094 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:42,094 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:42,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1294453949, now seen corresponding path program 1 times
[2018-01-29 23:49:42,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:42,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:42,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:42,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:42,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:42,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:42,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:49:42,572 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:49:42,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:42,616 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:49:42,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:49:42,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:49:42,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7
[2018-01-29 23:49:42,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:49:42,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:49:42,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:42,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:66
[2018-01-29 23:49:42,849 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_append_#in~plist.base|) |c_append_#in~plist.offset|) 0)) (exists ((|append_#t~ite8.offset| Int)) (= (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_append_#in~plist.base|) |c_append_#in~plist.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse1 (store (store (select |c_old(#memory_$Pointer$.offset)| .cse1) 0 (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite8.offset|))))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| 0))) |c_#memory_$Pointer$.offset|))) is different from true
[2018-01-29 23:49:42,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2018-01-29 23:49:42,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26
[2018-01-29 23:49:42,881 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:42,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39
[2018-01-29 23:49:42,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,896 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:42,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48
[2018-01-29 23:49:42,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22
[2018-01-29 23:49:42,899 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,904 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47
[2018-01-29 23:49:42,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33
[2018-01-29 23:49:42,917 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:42,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42
[2018-01-29 23:49:42,919 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,925 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,932 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:42,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35
[2018-01-29 23:49:42,934 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:42,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30
[2018-01-29 23:49:42,936 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,940 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,944 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:42,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:49:42,958 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:76, output treesize:61
[2018-01-29 23:49:43,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34
[2018-01-29 23:49:43,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23
[2018-01-29 23:49:43,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:40
[2018-01-29 23:49:43,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:49:43,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:43,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38
[2018-01-29 23:49:43,185 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:43,186 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:43,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 23:49:43,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,197 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:49:43,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42
[2018-01-29 23:49:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22
[2018-01-29 23:49:43,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:43,213 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30
[2018-01-29 23:49:43,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22
[2018-01-29 23:49:43,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-01-29 23:49:43,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-01-29 23:49:43,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:43,269 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3
[2018-01-29 23:49:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2018-01-29 23:49:43,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:49:43,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 34
[2018-01-29 23:49:43,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states
[2018-01-29 23:49:43,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2018-01-29 23:49:43,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=4, NotChecked=64, Total=1190
[2018-01-29 23:49:43,314 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 35 states.
[2018-01-29 23:49:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:44,185 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions.
[2018-01-29 23:49:44,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-01-29 23:49:44,185 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 96
[2018-01-29 23:49:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:44,186 INFO L225 Difference]: With dead ends: 159
[2018-01-29 23:49:44,186 INFO L226 Difference]: Without dead ends: 158
[2018-01-29 23:49:44,187 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=398, Invalid=2903, Unknown=9, NotChecked=112, Total=3422
[2018-01-29 23:49:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2018-01-29 23:49:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153.
[2018-01-29 23:49:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states.
[2018-01-29 23:49:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions.
[2018-01-29 23:49:44,195 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 96
[2018-01-29 23:49:44,195 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:44,195 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions.
[2018-01-29 23:49:44,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states.
[2018-01-29 23:49:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions.
[2018-01-29 23:49:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2018-01-29 23:49:44,196 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:44,196 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:44,196 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1294453948, now seen corresponding path program 1 times
[2018-01-29 23:49:44,196 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:44,196 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:44,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:44,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:44,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:44,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2018-01-29 23:49:44,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:49:44,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:49:44,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:49:44,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:49:44,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:49:44,253 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand 5 states.
[2018-01-29 23:49:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:44,377 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions.
[2018-01-29 23:49:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 23:49:44,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96
[2018-01-29 23:49:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:44,379 INFO L225 Difference]: With dead ends: 153
[2018-01-29 23:49:44,379 INFO L226 Difference]: Without dead ends: 152
[2018-01-29 23:49:44,379 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:49:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2018-01-29 23:49:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152.
[2018-01-29 23:49:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states.
[2018-01-29 23:49:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions.
[2018-01-29 23:49:44,393 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 96
[2018-01-29 23:49:44,393 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:44,393 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions.
[2018-01-29 23:49:44,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:49:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions.
[2018-01-29 23:49:44,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2018-01-29 23:49:44,394 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:44,394 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:44,395 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:44,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1570272932, now seen corresponding path program 1 times
[2018-01-29 23:49:44,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:44,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:44,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:44,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:44,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:44,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:45,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:49:45,318 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:49:45,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:45,369 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:49:45,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:49:45,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 23:49:45,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:49:45,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:49:45,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23
[2018-01-29 23:49:45,463 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:45,464 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:45,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-01-29 23:49:45,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25
[2018-01-29 23:49:45,709 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~item~4.base Int) (|append_#t~ite8.base| Int)) (and (= 0 (select |c_old(#valid)| append_~item~4.base)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~4.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~4.base) 0 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite8.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~4.base))) |c_#memory_$Pointer$.base|))) is different from true
[2018-01-29 23:49:45,737 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:45,738 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:45,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 23:49:45,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47
[2018-01-29 23:49:45,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18
[2018-01-29 23:49:45,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19
[2018-01-29 23:49:45,754 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41
[2018-01-29 23:49:45,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24
[2018-01-29 23:49:45,770 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,775 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,780 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,786 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:28
[2018-01-29 23:49:45,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19
[2018-01-29 23:49:45,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2018-01-29 23:49:45,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:45,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:39
[2018-01-29 23:49:45,992 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:45,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40
[2018-01-29 23:49:45,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32
[2018-01-29 23:49:45,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:46,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:46,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:46,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:40
[2018-01-29 23:49:46,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29
[2018-01-29 23:49:46,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-01-29 23:49:46,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:46,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9
[2018-01-29 23:49:46,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:46,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:46,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:46,107 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:14
[2018-01-29 23:49:46,110 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:46,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21
[2018-01-29 23:49:46,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:46,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:49:46,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15
[2018-01-29 23:49:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2018-01-29 23:49:46,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:49:46,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 43
[2018-01-29 23:49:46,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-01-29 23:49:46,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-01-29 23:49:46,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1663, Unknown=5, NotChecked=82, Total=1892
[2018-01-29 23:49:46,203 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 44 states.
[2018-01-29 23:49:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:47,785 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions.
[2018-01-29 23:49:47,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-01-29 23:49:47,785 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 98
[2018-01-29 23:49:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:47,786 INFO L225 Difference]: With dead ends: 173
[2018-01-29 23:49:47,786 INFO L226 Difference]: Without dead ends: 172
[2018-01-29 23:49:47,787 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=422, Invalid=3994, Unknown=10, NotChecked=130, Total=4556
[2018-01-29 23:49:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states.
[2018-01-29 23:49:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154.
[2018-01-29 23:49:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states.
[2018-01-29 23:49:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions.
[2018-01-29 23:49:47,796 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 98
[2018-01-29 23:49:47,797 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:47,797 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions.
[2018-01-29 23:49:47,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-01-29 23:49:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions.
[2018-01-29 23:49:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2018-01-29 23:49:47,797 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:47,797 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:47,798 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1143632949, now seen corresponding path program 1 times
[2018-01-29 23:49:47,798 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:47,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:47,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:47,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:47,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:47,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-01-29 23:49:47,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:49:47,900 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:49:47,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:47,952 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:49:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-01-29 23:49:47,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:49:47,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11
[2018-01-29 23:49:47,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-01-29 23:49:47,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-01-29 23:49:47,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2018-01-29 23:49:47,999 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 11 states.
[2018-01-29 23:49:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:49:48,122 INFO L93 Difference]: Finished difference Result 194 states and 200 transitions.
[2018-01-29 23:49:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-01-29 23:49:48,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105
[2018-01-29 23:49:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:49:48,123 INFO L225 Difference]: With dead ends: 194
[2018-01-29 23:49:48,123 INFO L226 Difference]: Without dead ends: 171
[2018-01-29 23:49:48,123 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342
[2018-01-29 23:49:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2018-01-29 23:49:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166.
[2018-01-29 23:49:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states.
[2018-01-29 23:49:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions.
[2018-01-29 23:49:48,132 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 105
[2018-01-29 23:49:48,132 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:49:48,132 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions.
[2018-01-29 23:49:48,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-01-29 23:49:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions.
[2018-01-29 23:49:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2018-01-29 23:49:48,133 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:49:48,133 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:49:48,133 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-29 23:49:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash 479286088, now seen corresponding path program 1 times
[2018-01-29 23:49:48,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:49:48,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:49:48,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:48,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:48,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:49:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:48,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:49:51,667 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 92 DAG size of output 60
[2018-01-29 23:49:51,825 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 81 DAG size of output 60
[2018-01-29 23:49:51,993 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 87 DAG size of output 64
[2018-01-29 23:49:52,156 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 75 DAG size of output 64
[2018-01-29 23:49:52,328 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 65 DAG size of output 58
[2018-01-29 23:49:53,395 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 103 DAG size of output 31
[2018-01-29 23:49:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:49:55,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:49:55,909 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:49:55,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:49:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:49:55,960 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:49:56,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:49:56,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:49:56,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:56,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:56,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:56,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:58
[2018-01-29 23:49:56,508 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 45 treesize of output 53
[2018-01-29 23:49:56,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45
[2018-01-29 23:49:56,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:56,541 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:56,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47
[2018-01-29 23:49:56,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:56,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:56,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:49:56,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:49:56,608 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:56,610 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:56,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:49:56,634 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:65, output treesize:127
[2018-01-29 23:49:57,634 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~item~4.base Int)) (and (= |c_#valid| (store |c_old(#valid)| append_~item~4.base 1)) (= 0 (select |c_old(#valid)| append_~item~4.base)) (not (= 0 append_~item~4.base)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~4.base (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|))) (let ((.cse1 (store (select |c_old(#memory_$Pointer$.base)| append_~item~4.base) 0 .cse2))) (store .cse1 4 (select (select (store |c_old(#memory_$Pointer$.base)| append_~item~4.base .cse1) .cse2) (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|) 4)))))))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~4.base)))))) is different from true
[2018-01-29 23:49:57,706 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:57,707 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:57,708 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:57,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 156
[2018-01-29 23:49:57,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32
[2018-01-29 23:49:57,721 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:57,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 55
[2018-01-29 23:49:57,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:57,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:57,749 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:57,750 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:57,751 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:57,754 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:57,756 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:57,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 149
[2018-01-29 23:49:57,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 128
[2018-01-29 23:49:57,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:57,779 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:57,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:57,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-01-29 23:49:57,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21
[2018-01-29 23:49:57,817 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:57,821 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:57,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:57,839 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:221, output treesize:194
[2018-01-29 23:49:58,815 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 208 treesize of output 200
[2018-01-29 23:49:58,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28
[2018-01-29 23:49:58,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:58,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:58,903 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 247 treesize of output 239
[2018-01-29 23:49:58,905 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 78 treesize of output 67
[2018-01-29 23:49:58,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:58,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:58,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:49:58,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:456, output treesize:418
[2018-01-29 23:49:59,194 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-01-29 23:49:59,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:59,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:49:59,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:411, output treesize:223
[2018-01-29 23:49:59,383 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:59,384 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:59,385 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:59,385 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:59,387 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:49:59,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 182
[2018-01-29 23:49:59,408 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 198
[2018-01-29 23:49:59,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:49:59,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:49:59,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:49:59,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:236, output treesize:574
Received shutdown request...
[2018-01-29 23:50:02,016 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants
[2018-01-29 23:50:02,016 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-01-29 23:50:02,021 WARN L185 ceAbstractionStarter]: Timeout
[2018-01-29 23:50:02,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:50:02 BoogieIcfgContainer
[2018-01-29 23:50:02,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-29 23:50:02,022 INFO L168 Benchmark]: Toolchain (without parser) took 119542.15 ms. Allocated memory was 308.8 MB in the beginning and 866.1 MB in the end (delta: 557.3 MB). Free memory was 268.8 MB in the beginning and 716.3 MB in the end (delta: -447.5 MB). Peak memory consumption was 109.8 MB. Max. memory is 5.3 GB.
[2018-01-29 23:50:02,023 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-29 23:50:02,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.35 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 257.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
[2018-01-29 23:50:02,024 INFO L168 Benchmark]: Boogie Preprocessor took 45.93 ms. Allocated memory is still 308.8 MB. Free memory was 256.8 MB in the beginning and 255.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB.
[2018-01-29 23:50:02,024 INFO L168 Benchmark]: RCFGBuilder took 503.97 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 225.7 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 5.3 GB.
[2018-01-29 23:50:02,024 INFO L168 Benchmark]: TraceAbstraction took 118779.32 ms. Allocated memory was 308.8 MB in the beginning and 866.1 MB in the end (delta: 557.3 MB). Free memory was 224.7 MB in the beginning and 716.3 MB in the end (delta: -491.6 MB). Peak memory consumption was 65.7 MB. Max. memory is 5.3 GB.
[2018-01-29 23:50:02,026 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.20 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 206.35 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 257.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 45.93 ms. Allocated memory is still 308.8 MB. Free memory was 256.8 MB in the beginning and 255.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB.
* RCFGBuilder took 503.97 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 225.7 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 118779.32 ms. Allocated memory was 308.8 MB in the beginning and 866.1 MB in the end (delta: 557.3 MB). Free memory was 224.7 MB in the beginning and 716.3 MB in the end (delta: -491.6 MB). Peak memory consumption was 65.7 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 125 locations, 43 error locations. TIMEOUT Result, 118.7s OverallTime, 36 OverallIterations, 2 TraceHistogramMax, 66.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2927 SDtfs, 4942 SDslu, 22866 SDs, 0 SdLazy, 17099 SolverSat, 848 SolverUnsat, 117 SolverUnknown, 0 SolverNotchecked, 23.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2091 GetRequests, 986 SyntacticMatches, 52 SemanticMatches, 1053 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15849 ImplicationChecksByTransitivity, 65.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 558 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 35.6s InterpolantComputationTime, 3188 NumberOfCodeBlocks, 3188 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3139 ConstructedInterpolants, 168 QuantifiedInterpolants, 5432448 SizeOfPredicates, 299 NumberOfNonLiveVariables, 4468 ConjunctsInSsa, 806 ConjunctsInUnsatCore, 49 InterpolantComputations, 24 PerfectInterpolantSequences, 363/714 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-50-02-033.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-50-02-033.csv
Completed graceful shutdown