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/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-1cceb4a
[2018-01-30 00:23:43,993 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-30 00:23:43,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-30 00:23:44,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-30 00:23:44,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-30 00:23:44,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-30 00:23:44,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-30 00:23:44,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-30 00:23:44,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-30 00:23:44,013 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-30 00:23:44,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-30 00:23:44,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-30 00:23:44,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-30 00:23:44,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-30 00:23:44,016 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-30 00:23:44,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-30 00:23:44,021 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-30 00:23:44,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-30 00:23:44,024 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-30 00:23:44,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-30 00:23:44,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-30 00:23:44,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-30 00:23:44,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-30 00:23:44,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-30 00:23:44,030 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-30 00:23:44,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-30 00:23:44,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-30 00:23:44,032 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-30 00:23:44,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-30 00:23:44,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-30 00:23:44,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-30 00:23:44,034 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-30 00:23:44,043 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-30 00:23:44,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-30 00:23:44,044 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-30 00:23:44,045 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-30 00:23:44,045 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-30 00:23:44,045 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-30 00:23:44,045 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-30 00:23:44,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-30 00:23:44,046 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-30 00:23:44,046 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-30 00:23:44,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-30 00:23:44,047 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-30 00:23:44,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-30 00:23:44,047 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-30 00:23:44,047 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-30 00:23:44,048 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-30 00:23:44,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-30 00:23:44,048 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-30 00:23:44,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-30 00:23:44,048 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-30 00:23:44,049 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-30 00:23:44,049 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-30 00:23:44,049 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-30 00:23:44,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-30 00:23:44,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-30 00:23:44,050 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-30 00:23:44,050 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-30 00:23:44,050 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-30 00:23:44,050 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-30 00:23:44,050 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-30 00:23:44,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-30 00:23:44,051 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-30 00:23:44,052 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-30 00:23:44,052 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-30 00:23:44,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-30 00:23:44,100 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-30 00:23:44,104 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-30 00:23:44,106 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-30 00:23:44,106 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-30 00:23:44,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i
[2018-01-30 00:23:44,291 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-30 00:23:44,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-30 00:23:44,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-30 00:23:44,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-30 00:23:44,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-30 00:23:44,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:23:44" (1/1) ...
[2018-01-30 00:23:44,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45875f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44, skipping insertion in model container
[2018-01-30 00:23:44,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:23:44" (1/1) ...
[2018-01-30 00:23:44,322 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-30 00:23:44,362 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-30 00:23:44,477 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-30 00:23:44,505 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-30 00:23:44,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44 WrapperNode
[2018-01-30 00:23:44,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-30 00:23:44,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-30 00:23:44,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-30 00:23:44,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-30 00:23:44,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44" (1/1) ...
[2018-01-30 00:23:44,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44" (1/1) ...
[2018-01-30 00:23:44,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44" (1/1) ...
[2018-01-30 00:23:44,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44" (1/1) ...
[2018-01-30 00:23:44,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44" (1/1) ...
[2018-01-30 00:23:44,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44" (1/1) ...
[2018-01-30 00:23:44,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44" (1/1) ...
[2018-01-30 00:23:44,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-30 00:23:44,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-30 00:23:44,549 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-30 00:23:44,549 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-30 00:23:44,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-30 00:23:44,598 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-30 00:23:44,598 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-30 00:23:44,598 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-30 00:23:44,598 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-30 00:23:44,599 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-01-30 00:23:44,600 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-30 00:23:44,600 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-30 00:23:44,600 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-30 00:23:45,186 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-30 00:23:45,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:23:45 BoogieIcfgContainer
[2018-01-30 00:23:45,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-30 00:23:45,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-30 00:23:45,188 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-30 00:23:45,192 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-30 00:23:45,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:23:44" (1/3) ...
[2018-01-30 00:23:45,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15241641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:23:45, skipping insertion in model container
[2018-01-30 00:23:45,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:23:44" (2/3) ...
[2018-01-30 00:23:45,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15241641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:23:45, skipping insertion in model container
[2018-01-30 00:23:45,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:23:45" (3/3) ...
[2018-01-30 00:23:45,197 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i
[2018-01-30 00:23:45,207 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-30 00:23:45,216 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations.
[2018-01-30 00:23:45,271 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-30 00:23:45,271 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-30 00:23:45,272 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-30 00:23:45,272 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-30 00:23:45,272 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-30 00:23:45,272 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-30 00:23:45,272 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-30 00:23:45,273 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-30 00:23:45,273 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-30 00:23:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states.
[2018-01-30 00:23:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-30 00:23:45,304 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:45,305 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:23:45,306 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:45,311 INFO L82 PathProgramCache]: Analyzing trace with hash -219291675, now seen corresponding path program 1 times
[2018-01-30 00:23:45,314 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:45,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:45,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:45,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:45,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:45,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:45,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:45,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-30 00:23:45,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-30 00:23:45,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-30 00:23:45,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-30 00:23:45,613 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 4 states.
[2018-01-30 00:23:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:45,893 INFO L93 Difference]: Finished difference Result 383 states and 444 transitions.
[2018-01-30 00:23:45,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-30 00:23:45,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9
[2018-01-30 00:23:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:45,903 INFO L225 Difference]: With dead ends: 383
[2018-01-30 00:23:45,903 INFO L226 Difference]: Without dead ends: 202
[2018-01-30 00:23:45,907 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-30 00:23:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2018-01-30 00:23:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 175.
[2018-01-30 00:23:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states.
[2018-01-30 00:23:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 180 transitions.
[2018-01-30 00:23:45,947 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 180 transitions. Word has length 9
[2018-01-30 00:23:45,947 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:45,947 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 180 transitions.
[2018-01-30 00:23:45,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-30 00:23:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 180 transitions.
[2018-01-30 00:23:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-30 00:23:45,948 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:45,948 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:23:45,948 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:45,949 INFO L82 PathProgramCache]: Analyzing trace with hash -219291674, now seen corresponding path program 1 times
[2018-01-30 00:23:45,949 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:45,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:45,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:45,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:45,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:45,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:46,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:46,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-30 00:23:46,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-30 00:23:46,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-30 00:23:46,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-30 00:23:46,049 INFO L87 Difference]: Start difference. First operand 175 states and 180 transitions. Second operand 4 states.
[2018-01-30 00:23:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:46,220 INFO L93 Difference]: Finished difference Result 175 states and 180 transitions.
[2018-01-30 00:23:46,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-30 00:23:46,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9
[2018-01-30 00:23:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:46,223 INFO L225 Difference]: With dead ends: 175
[2018-01-30 00:23:46,223 INFO L226 Difference]: Without dead ends: 172
[2018-01-30 00:23:46,224 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-30 00:23:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states.
[2018-01-30 00:23:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172.
[2018-01-30 00:23:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states.
[2018-01-30 00:23:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 177 transitions.
[2018-01-30 00:23:46,237 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 177 transitions. Word has length 9
[2018-01-30 00:23:46,238 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:46,238 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 177 transitions.
[2018-01-30 00:23:46,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-30 00:23:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions.
[2018-01-30 00:23:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-01-30 00:23:46,239 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:46,239 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:23:46,239 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash -415190554, now seen corresponding path program 1 times
[2018-01-30 00:23:46,239 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:46,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:46,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:46,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:46,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:46,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:46,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:46,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-30 00:23:46,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-30 00:23:46,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-30 00:23:46,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-30 00:23:46,301 INFO L87 Difference]: Start difference. First operand 172 states and 177 transitions. Second operand 4 states.
[2018-01-30 00:23:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:46,437 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions.
[2018-01-30 00:23:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-30 00:23:46,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2018-01-30 00:23:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:46,440 INFO L225 Difference]: With dead ends: 195
[2018-01-30 00:23:46,440 INFO L226 Difference]: Without dead ends: 187
[2018-01-30 00:23:46,440 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-30 00:23:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states.
[2018-01-30 00:23:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 168.
[2018-01-30 00:23:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states.
[2018-01-30 00:23:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 175 transitions.
[2018-01-30 00:23:46,453 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 175 transitions. Word has length 14
[2018-01-30 00:23:46,454 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:46,454 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 175 transitions.
[2018-01-30 00:23:46,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-30 00:23:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 175 transitions.
[2018-01-30 00:23:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-01-30 00:23:46,455 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:46,455 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:23:46,455 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash -415190553, now seen corresponding path program 1 times
[2018-01-30 00:23:46,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:46,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:46,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:46,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:46,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:46,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:46,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:46,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-30 00:23:46,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-30 00:23:46,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-30 00:23:46,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-30 00:23:46,529 INFO L87 Difference]: Start difference. First operand 168 states and 175 transitions. Second operand 4 states.
[2018-01-30 00:23:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:46,655 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions.
[2018-01-30 00:23:46,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-30 00:23:46,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2018-01-30 00:23:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:46,657 INFO L225 Difference]: With dead ends: 192
[2018-01-30 00:23:46,657 INFO L226 Difference]: Without dead ends: 184
[2018-01-30 00:23:46,658 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-30 00:23:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2018-01-30 00:23:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 176.
[2018-01-30 00:23:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states.
[2018-01-30 00:23:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 183 transitions.
[2018-01-30 00:23:46,670 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 183 transitions. Word has length 14
[2018-01-30 00:23:46,670 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:46,671 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 183 transitions.
[2018-01-30 00:23:46,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-30 00:23:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 183 transitions.
[2018-01-30 00:23:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-01-30 00:23:46,672 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:46,672 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]
[2018-01-30 00:23:46,672 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1097304755, now seen corresponding path program 1 times
[2018-01-30 00:23:46,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:46,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:46,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:46,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:46,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:46,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:46,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:46,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-30 00:23:46,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-30 00:23:46,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-30 00:23:46,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-30 00:23:46,783 INFO L87 Difference]: Start difference. First operand 176 states and 183 transitions. Second operand 4 states.
[2018-01-30 00:23:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:46,938 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions.
[2018-01-30 00:23:46,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-30 00:23:46,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23
[2018-01-30 00:23:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:46,940 INFO L225 Difference]: With dead ends: 197
[2018-01-30 00:23:46,940 INFO L226 Difference]: Without dead ends: 181
[2018-01-30 00:23:46,941 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-30 00:23:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2018-01-30 00:23:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164.
[2018-01-30 00:23:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states.
[2018-01-30 00:23:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions.
[2018-01-30 00:23:46,949 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 23
[2018-01-30 00:23:46,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:46,950 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions.
[2018-01-30 00:23:46,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-30 00:23:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions.
[2018-01-30 00:23:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-01-30 00:23:46,950 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:46,950 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]
[2018-01-30 00:23:46,951 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1097304756, now seen corresponding path program 1 times
[2018-01-30 00:23:46,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:46,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:46,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:46,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:46,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:46,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:47,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:47,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-30 00:23:47,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-30 00:23:47,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-30 00:23:47,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-01-30 00:23:47,078 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 7 states.
[2018-01-30 00:23:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:47,419 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions.
[2018-01-30 00:23:47,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-30 00:23:47,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23
[2018-01-30 00:23:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:47,421 INFO L225 Difference]: With dead ends: 213
[2018-01-30 00:23:47,421 INFO L226 Difference]: Without dead ends: 206
[2018-01-30 00:23:47,421 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2018-01-30 00:23:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2018-01-30 00:23:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 178.
[2018-01-30 00:23:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states.
[2018-01-30 00:23:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions.
[2018-01-30 00:23:47,427 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 23
[2018-01-30 00:23:47,427 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:47,428 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions.
[2018-01-30 00:23:47,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-30 00:23:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions.
[2018-01-30 00:23:47,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-30 00:23:47,429 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:47,429 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-30 00:23:47,429 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2052084938, now seen corresponding path program 1 times
[2018-01-30 00:23:47,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:47,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:47,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:47,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:47,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:47,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:47,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:47,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-30 00:23:47,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-30 00:23:47,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-30 00:23:47,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-30 00:23:47,498 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand 5 states.
[2018-01-30 00:23:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:47,675 INFO L93 Difference]: Finished difference Result 240 states and 257 transitions.
[2018-01-30 00:23:47,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-30 00:23:47,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25
[2018-01-30 00:23:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:47,677 INFO L225 Difference]: With dead ends: 240
[2018-01-30 00:23:47,677 INFO L226 Difference]: Without dead ends: 239
[2018-01-30 00:23:47,677 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-01-30 00:23:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2018-01-30 00:23:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 177.
[2018-01-30 00:23:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states.
[2018-01-30 00:23:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions.
[2018-01-30 00:23:47,684 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 25
[2018-01-30 00:23:47,685 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:47,685 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions.
[2018-01-30 00:23:47,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-30 00:23:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions.
[2018-01-30 00:23:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-30 00:23:47,685 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:47,685 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-30 00:23:47,686 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:47,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2052084937, now seen corresponding path program 1 times
[2018-01-30 00:23:47,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:47,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:47,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:47,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:47,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:47,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:47,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:47,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-30 00:23:47,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-30 00:23:47,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-30 00:23:47,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-30 00:23:47,778 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 5 states.
[2018-01-30 00:23:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:48,179 INFO L93 Difference]: Finished difference Result 267 states and 285 transitions.
[2018-01-30 00:23:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-30 00:23:48,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25
[2018-01-30 00:23:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:48,181 INFO L225 Difference]: With dead ends: 267
[2018-01-30 00:23:48,181 INFO L226 Difference]: Without dead ends: 266
[2018-01-30 00:23:48,182 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2018-01-30 00:23:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2018-01-30 00:23:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 176.
[2018-01-30 00:23:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states.
[2018-01-30 00:23:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions.
[2018-01-30 00:23:48,190 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 25
[2018-01-30 00:23:48,190 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:48,190 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions.
[2018-01-30 00:23:48,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-30 00:23:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions.
[2018-01-30 00:23:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-01-30 00:23:48,191 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:48,192 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]
[2018-01-30 00:23:48,192 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash -646814050, now seen corresponding path program 1 times
[2018-01-30 00:23:48,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:48,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:48,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:48,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:48,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:48,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:48,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:48,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-30 00:23:48,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-30 00:23:48,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-30 00:23:48,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-01-30 00:23:48,316 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 9 states.
[2018-01-30 00:23:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:48,802 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions.
[2018-01-30 00:23:48,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-30 00:23:48,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30
[2018-01-30 00:23:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:48,804 INFO L225 Difference]: With dead ends: 192
[2018-01-30 00:23:48,804 INFO L226 Difference]: Without dead ends: 191
[2018-01-30 00:23:48,805 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2018-01-30 00:23:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2018-01-30 00:23:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 175.
[2018-01-30 00:23:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states.
[2018-01-30 00:23:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 185 transitions.
[2018-01-30 00:23:48,813 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 185 transitions. Word has length 30
[2018-01-30 00:23:48,813 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:48,814 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 185 transitions.
[2018-01-30 00:23:48,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-30 00:23:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 185 transitions.
[2018-01-30 00:23:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-01-30 00:23:48,815 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:48,815 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]
[2018-01-30 00:23:48,815 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:48,815 INFO L82 PathProgramCache]: Analyzing trace with hash -646814049, now seen corresponding path program 1 times
[2018-01-30 00:23:48,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:48,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:48,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:48,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:48,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:48,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:48,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:49,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-01-30 00:23:49,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-30 00:23:49,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-30 00:23:49,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-01-30 00:23:49,026 INFO L87 Difference]: Start difference. First operand 175 states and 185 transitions. Second operand 10 states.
[2018-01-30 00:23:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:49,523 INFO L93 Difference]: Finished difference Result 222 states and 233 transitions.
[2018-01-30 00:23:49,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-30 00:23:49,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30
[2018-01-30 00:23:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:49,524 INFO L225 Difference]: With dead ends: 222
[2018-01-30 00:23:49,524 INFO L226 Difference]: Without dead ends: 211
[2018-01-30 00:23:49,525 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462
[2018-01-30 00:23:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2018-01-30 00:23:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 182.
[2018-01-30 00:23:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states.
[2018-01-30 00:23:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions.
[2018-01-30 00:23:49,533 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 30
[2018-01-30 00:23:49,534 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:49,534 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions.
[2018-01-30 00:23:49,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-30 00:23:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions.
[2018-01-30 00:23:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-01-30 00:23:49,535 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:49,535 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]
[2018-01-30 00:23:49,535 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:49,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1093593353, now seen corresponding path program 1 times
[2018-01-30 00:23:49,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:49,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:49,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:49,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:49,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:49,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:49,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:49,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-30 00:23:49,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-30 00:23:49,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-30 00:23:49,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-01-30 00:23:49,610 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 8 states.
[2018-01-30 00:23:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:49,826 INFO L93 Difference]: Finished difference Result 259 states and 274 transitions.
[2018-01-30 00:23:49,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-30 00:23:49,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37
[2018-01-30 00:23:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:49,828 INFO L225 Difference]: With dead ends: 259
[2018-01-30 00:23:49,828 INFO L226 Difference]: Without dead ends: 214
[2018-01-30 00:23:49,829 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2018-01-30 00:23:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2018-01-30 00:23:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 182.
[2018-01-30 00:23:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states.
[2018-01-30 00:23:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 191 transitions.
[2018-01-30 00:23:49,836 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 191 transitions. Word has length 37
[2018-01-30 00:23:49,836 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:49,836 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 191 transitions.
[2018-01-30 00:23:49,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-30 00:23:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 191 transitions.
[2018-01-30 00:23:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-01-30 00:23:49,837 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:49,838 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]
[2018-01-30 00:23:49,838 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:49,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2000775916, now seen corresponding path program 1 times
[2018-01-30 00:23:49,838 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:49,838 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:49,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:49,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:49,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:49,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:49,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:49,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-30 00:23:49,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-30 00:23:49,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-30 00:23:49,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-30 00:23:49,900 INFO L87 Difference]: Start difference. First operand 182 states and 191 transitions. Second operand 5 states.
[2018-01-30 00:23:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:50,232 INFO L93 Difference]: Finished difference Result 277 states and 292 transitions.
[2018-01-30 00:23:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-30 00:23:50,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38
[2018-01-30 00:23:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:50,234 INFO L225 Difference]: With dead ends: 277
[2018-01-30 00:23:50,234 INFO L226 Difference]: Without dead ends: 276
[2018-01-30 00:23:50,235 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-01-30 00:23:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states.
[2018-01-30 00:23:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 181.
[2018-01-30 00:23:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states.
[2018-01-30 00:23:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 190 transitions.
[2018-01-30 00:23:50,242 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 190 transitions. Word has length 38
[2018-01-30 00:23:50,242 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:50,242 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 190 transitions.
[2018-01-30 00:23:50,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-30 00:23:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 190 transitions.
[2018-01-30 00:23:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-01-30 00:23:50,243 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:50,244 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]
[2018-01-30 00:23:50,244 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:50,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2000775917, now seen corresponding path program 1 times
[2018-01-30 00:23:50,244 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:50,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:50,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:50,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:50,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:50,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:50,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:50,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-30 00:23:50,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-30 00:23:50,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-30 00:23:50,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-30 00:23:50,398 INFO L87 Difference]: Start difference. First operand 181 states and 190 transitions. Second operand 5 states.
[2018-01-30 00:23:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:50,697 INFO L93 Difference]: Finished difference Result 304 states and 321 transitions.
[2018-01-30 00:23:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-30 00:23:50,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38
[2018-01-30 00:23:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:50,699 INFO L225 Difference]: With dead ends: 304
[2018-01-30 00:23:50,699 INFO L226 Difference]: Without dead ends: 303
[2018-01-30 00:23:50,699 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2018-01-30 00:23:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states.
[2018-01-30 00:23:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 180.
[2018-01-30 00:23:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states.
[2018-01-30 00:23:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 189 transitions.
[2018-01-30 00:23:50,705 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 189 transitions. Word has length 38
[2018-01-30 00:23:50,706 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:50,706 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 189 transitions.
[2018-01-30 00:23:50,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-30 00:23:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 189 transitions.
[2018-01-30 00:23:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-01-30 00:23:50,707 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:50,707 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:23:50,707 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1556041730, now seen corresponding path program 1 times
[2018-01-30 00:23:50,708 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:50,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:50,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:50,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:50,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:50,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:50,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:23:50,895 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-30 00:23:50,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:50,967 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:23:51,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-30 00:23:51,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-30 00:23:51,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-30 00:23:51,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-30 00:23:51,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15
[2018-01-30 00:23:51,090 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 26 treesize of output 21
[2018-01-30 00:23:51,099 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,103 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-30 00:23:51,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,130 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 26 treesize of output 21
[2018-01-30 00:23:51,139 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,140 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-30 00:23:51,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,157 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33
[2018-01-30 00:23:51,181 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 36 treesize of output 29
[2018-01-30 00:23:51,186 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,187 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,188 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37
[2018-01-30 00:23:51,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29
[2018-01-30 00:23:51,224 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,226 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,227 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37
[2018-01-30 00:23:51,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33
[2018-01-30 00:23:51,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18
[2018-01-30 00:23:51,274 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,275 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 18 treesize of output 10
[2018-01-30 00:23:51,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,292 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-30 00:23:51,296 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:23:51,297 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 18 treesize of output 10
[2018-01-30 00:23:51,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:51,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7
[2018-01-30 00:23:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:51,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:23:51,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8
[2018-01-30 00:23:51,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-30 00:23:51,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-30 00:23:51,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-01-30 00:23:51,358 INFO L87 Difference]: Start difference. First operand 180 states and 189 transitions. Second operand 8 states.
[2018-01-30 00:23:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:51,953 INFO L93 Difference]: Finished difference Result 332 states and 351 transitions.
[2018-01-30 00:23:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-01-30 00:23:51,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42
[2018-01-30 00:23:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:51,954 INFO L225 Difference]: With dead ends: 332
[2018-01-30 00:23:51,954 INFO L226 Difference]: Without dead ends: 261
[2018-01-30 00:23:51,955 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156
[2018-01-30 00:23:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2018-01-30 00:23:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 204.
[2018-01-30 00:23:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states.
[2018-01-30 00:23:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 215 transitions.
[2018-01-30 00:23:51,966 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 215 transitions. Word has length 42
[2018-01-30 00:23:51,966 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:51,966 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 215 transitions.
[2018-01-30 00:23:51,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-30 00:23:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 215 transitions.
[2018-01-30 00:23:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-01-30 00:23:51,966 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:51,967 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]
[2018-01-30 00:23:51,967 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:51,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1620217993, now seen corresponding path program 1 times
[2018-01-30 00:23:51,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:51,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:51,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:51,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:51,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:51,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:52,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:52,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-30 00:23:52,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-30 00:23:52,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-30 00:23:52,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-01-30 00:23:52,148 INFO L87 Difference]: Start difference. First operand 204 states and 215 transitions. Second operand 8 states.
[2018-01-30 00:23:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:53,092 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions.
[2018-01-30 00:23:53,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-30 00:23:53,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43
[2018-01-30 00:23:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:53,093 INFO L225 Difference]: With dead ends: 207
[2018-01-30 00:23:53,093 INFO L226 Difference]: Without dead ends: 206
[2018-01-30 00:23:53,093 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2018-01-30 00:23:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2018-01-30 00:23:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203.
[2018-01-30 00:23:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states.
[2018-01-30 00:23:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 214 transitions.
[2018-01-30 00:23:53,102 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 214 transitions. Word has length 43
[2018-01-30 00:23:53,102 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:53,102 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 214 transitions.
[2018-01-30 00:23:53,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-30 00:23:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 214 transitions.
[2018-01-30 00:23:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-01-30 00:23:53,102 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:53,102 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]
[2018-01-30 00:23:53,103 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:53,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1620217994, now seen corresponding path program 1 times
[2018-01-30 00:23:53,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:53,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:53,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:53,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:53,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:53,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:53,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:53,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-30 00:23:53,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-30 00:23:53,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-30 00:23:53,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-01-30 00:23:53,294 INFO L87 Difference]: Start difference. First operand 203 states and 214 transitions. Second operand 9 states.
[2018-01-30 00:23:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:53,686 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions.
[2018-01-30 00:23:53,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-30 00:23:53,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43
[2018-01-30 00:23:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:53,688 INFO L225 Difference]: With dead ends: 209
[2018-01-30 00:23:53,688 INFO L226 Difference]: Without dead ends: 202
[2018-01-30 00:23:53,689 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210
[2018-01-30 00:23:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2018-01-30 00:23:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 173.
[2018-01-30 00:23:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states.
[2018-01-30 00:23:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions.
[2018-01-30 00:23:53,698 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 43
[2018-01-30 00:23:53,698 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:53,698 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions.
[2018-01-30 00:23:53,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-30 00:23:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions.
[2018-01-30 00:23:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-01-30 00:23:53,699 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:53,699 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-30 00:23:53,699 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:53,700 INFO L82 PathProgramCache]: Analyzing trace with hash -319477457, now seen corresponding path program 1 times
[2018-01-30 00:23:53,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:53,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:53,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:53,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:53,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:53,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:53,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:53,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-30 00:23:53,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-30 00:23:53,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-30 00:23:53,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-30 00:23:53,804 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 5 states.
[2018-01-30 00:23:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:53,932 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions.
[2018-01-30 00:23:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-30 00:23:53,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44
[2018-01-30 00:23:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:53,933 INFO L225 Difference]: With dead ends: 250
[2018-01-30 00:23:53,933 INFO L226 Difference]: Without dead ends: 177
[2018-01-30 00:23:53,934 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-30 00:23:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2018-01-30 00:23:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171.
[2018-01-30 00:23:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states.
[2018-01-30 00:23:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 179 transitions.
[2018-01-30 00:23:53,942 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 179 transitions. Word has length 44
[2018-01-30 00:23:53,943 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:53,943 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 179 transitions.
[2018-01-30 00:23:53,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-30 00:23:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 179 transitions.
[2018-01-30 00:23:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-01-30 00:23:53,943 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:53,944 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:23:53,944 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:53,944 INFO L82 PathProgramCache]: Analyzing trace with hash 457585015, now seen corresponding path program 1 times
[2018-01-30 00:23:53,944 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:53,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:53,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:53,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:53,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:53,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-01-30 00:23:54,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:23:54,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-30 00:23:54,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-30 00:23:54,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-30 00:23:54,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-01-30 00:23:54,078 INFO L87 Difference]: Start difference. First operand 171 states and 179 transitions. Second operand 8 states.
[2018-01-30 00:23:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:54,251 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions.
[2018-01-30 00:23:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-30 00:23:54,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45
[2018-01-30 00:23:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:54,253 INFO L225 Difference]: With dead ends: 188
[2018-01-30 00:23:54,253 INFO L226 Difference]: Without dead ends: 185
[2018-01-30 00:23:54,253 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182
[2018-01-30 00:23:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states.
[2018-01-30 00:23:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171.
[2018-01-30 00:23:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states.
[2018-01-30 00:23:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 178 transitions.
[2018-01-30 00:23:54,261 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 178 transitions. Word has length 45
[2018-01-30 00:23:54,261 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:54,261 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 178 transitions.
[2018-01-30 00:23:54,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-30 00:23:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 178 transitions.
[2018-01-30 00:23:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-01-30 00:23:54,262 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:54,262 INFO L350 BasicCegarLoop]: trace histogram [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]
[2018-01-30 00:23:54,262 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:54,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1598807677, now seen corresponding path program 1 times
[2018-01-30 00:23:54,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:54,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:54,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:54,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:54,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:54,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:54,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:23:54,364 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-30 00:23:54,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:54,404 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:23:54,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-30 00:23:54,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-30 00:23:54,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:54,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:54,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:54,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9
[2018-01-30 00:23:54,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15
[2018-01-30 00:23:54,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 15 treesize of output 3
[2018-01-30 00:23:54,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:54,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:54,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:54,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3
[2018-01-30 00:23:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-01-30 00:23:54,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-30 00:23:54,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9
[2018-01-30 00:23:54,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-30 00:23:54,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-30 00:23:54,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-01-30 00:23:54,476 INFO L87 Difference]: Start difference. First operand 171 states and 178 transitions. Second operand 9 states.
[2018-01-30 00:23:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:54,696 INFO L93 Difference]: Finished difference Result 234 states and 244 transitions.
[2018-01-30 00:23:54,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-01-30 00:23:54,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51
[2018-01-30 00:23:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:54,698 INFO L225 Difference]: With dead ends: 234
[2018-01-30 00:23:54,698 INFO L226 Difference]: Without dead ends: 198
[2018-01-30 00:23:54,698 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306
[2018-01-30 00:23:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2018-01-30 00:23:54,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 166.
[2018-01-30 00:23:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states.
[2018-01-30 00:23:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 172 transitions.
[2018-01-30 00:23:54,703 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 172 transitions. Word has length 51
[2018-01-30 00:23:54,703 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:54,703 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 172 transitions.
[2018-01-30 00:23:54,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-30 00:23:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 172 transitions.
[2018-01-30 00:23:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-01-30 00:23:54,704 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:54,704 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:23:54,704 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash 685765606, now seen corresponding path program 1 times
[2018-01-30 00:23:54,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:54,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:54,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:54,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:54,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:54,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:23:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:54,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:23:54,856 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-30 00:23:54,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:23:54,899 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:23:54,941 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 19 treesize of output 16
[2018-01-30 00:23:54,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1
[2018-01-30 00:23:54,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:54,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:54,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:54,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:3
[2018-01-30 00:23:55,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-01-30 00:23:55,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-01-30 00:23:55,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:55,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:55,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-01-30 00:23:55,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-01-30 00:23:55,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:55,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:55,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:23:55,041 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10
[2018-01-30 00:23:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:23:55,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:23:55,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16
[2018-01-30 00:23:55,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-01-30 00:23:55,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-01-30 00:23:55,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240
[2018-01-30 00:23:55,102 INFO L87 Difference]: Start difference. First operand 166 states and 172 transitions. Second operand 16 states.
[2018-01-30 00:23:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:23:55,663 INFO L93 Difference]: Finished difference Result 250 states and 261 transitions.
[2018-01-30 00:23:55,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-01-30 00:23:55,663 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54
[2018-01-30 00:23:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:23:55,664 INFO L225 Difference]: With dead ends: 250
[2018-01-30 00:23:55,664 INFO L226 Difference]: Without dead ends: 219
[2018-01-30 00:23:55,665 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552
[2018-01-30 00:23:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states.
[2018-01-30 00:23:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 182.
[2018-01-30 00:23:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states.
[2018-01-30 00:23:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 189 transitions.
[2018-01-30 00:23:55,673 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 189 transitions. Word has length 54
[2018-01-30 00:23:55,674 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:23:55,674 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 189 transitions.
[2018-01-30 00:23:55,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-01-30 00:23:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 189 transitions.
[2018-01-30 00:23:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-01-30 00:23:55,675 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:23:55,675 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:23:55,675 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-01-30 00:23:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash -216103110, now seen corresponding path program 1 times
[2018-01-30 00:23:55,675 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:23:55,675 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:23:55,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:55,676 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:23:55,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:23:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-01-30 00:23:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-01-30 00:23:55,732 INFO L409 BasicCegarLoop]: Counterexample might be feasible
[2018-01-30 00:23:55,760 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-30 00:23:55,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:23:55 BoogieIcfgContainer
[2018-01-30 00:23:55,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-30 00:23:55,785 INFO L168 Benchmark]: Toolchain (without parser) took 11494.20 ms. Allocated memory was 304.6 MB in the beginning and 594.0 MB in the end (delta: 289.4 MB). Free memory was 264.6 MB in the beginning and 401.7 MB in the end (delta: -137.0 MB). Peak memory consumption was 152.4 MB. Max. memory is 5.3 GB.
[2018-01-30 00:23:55,787 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-30 00:23:55,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.35 ms. Allocated memory is still 304.6 MB. Free memory was 263.6 MB in the beginning and 251.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 5.3 GB.
[2018-01-30 00:23:55,787 INFO L168 Benchmark]: Boogie Preprocessor took 35.19 ms. Allocated memory is still 304.6 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-30 00:23:55,788 INFO L168 Benchmark]: RCFGBuilder took 638.56 ms. Allocated memory is still 304.6 MB. Free memory was 249.3 MB in the beginning and 205.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 5.3 GB.
[2018-01-30 00:23:55,788 INFO L168 Benchmark]: TraceAbstraction took 10596.67 ms. Allocated memory was 304.6 MB in the beginning and 594.0 MB in the end (delta: 289.4 MB). Free memory was 205.0 MB in the beginning and 401.7 MB in the end (delta: -196.7 MB). Peak memory consumption was 92.7 MB. Max. memory is 5.3 GB.
[2018-01-30 00:23:55,790 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.19 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 213.35 ms. Allocated memory is still 304.6 MB. Free memory was 263.6 MB in the beginning and 251.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 35.19 ms. Allocated memory is still 304.6 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 638.56 ms. Allocated memory is still 304.6 MB. Free memory was 249.3 MB in the beginning and 205.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 10596.67 ms. Allocated memory was 304.6 MB in the beginning and 594.0 MB in the end (delta: 289.4 MB). Free memory was 205.0 MB in the beginning and 401.7 MB in the end (delta: -196.7 MB). Peak memory consumption was 92.7 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor:
- GenericResult: Unfinished Backtranslation
Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 985.
Possible FailurePath:
[L987] EXPR, FCALL malloc(sizeof(struct TSLL))
VAL [malloc(sizeof(struct TSLL))={19:0}]
[L987] struct TSLL* null = malloc(sizeof(struct TSLL));
VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}]
[L988] FCALL null->next = ((void*)0)
VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}]
[L989] FCALL null->prev = ((void*)0)
VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}]
[L990] FCALL null->colour = BLACK
VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}]
[L992] EXPR, FCALL malloc(sizeof(struct TSLL))
VAL [malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L992] struct TSLL* list = malloc(sizeof(struct TSLL));
VAL [list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L993] FCALL list->next = null
VAL [list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L994] FCALL list->prev = null
VAL [list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L995] FCALL list->colour = BLACK
VAL [list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L997] struct TSLL* end = list;
VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1000] COND FALSE !(__VERIFIER_nondet_int())
VAL [__VERIFIER_nondet_int()=0, end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1026] end = null
VAL [end={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1027] end = list
VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1030] COND FALSE !(!(null != end))
VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1030] COND FALSE !(0)
VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1031] EXPR, FCALL end->colour
VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1031] COND FALSE !(!(BLACK == end->colour))
VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1031] COND FALSE !(0)
VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1032] COND TRUE null != end
VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1034] EXPR, FCALL end->colour
VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1034] COND FALSE !(RED == end->colour)
VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1041] EXPR, FCALL end->next
VAL [end={15:0}, end->next={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1041] end = end->next
VAL [end={19:0}, end->next={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1032] COND FALSE !(null != end)
VAL [end={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1045] COND TRUE null != list
VAL [end={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1047] EXPR, FCALL list->colour
VAL [end={19:0}, list={15:0}, list->colour=1, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1047] COND FALSE !(RED == list->colour)
VAL [end={19:0}, list={15:0}, list->colour=1, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1056] EXPR, FCALL list->next
VAL [end={19:0}, list={15:0}, list->next={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1056] end = list->next
VAL [end={19:0}, list={15:0}, list->next={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1057] FCALL free(list)
VAL [end={19:0}, list={15:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1058] list = end
VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1045] COND FALSE !(null != list)
VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
[L1062] return 0;
VAL [\result=0, end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={15:0}, null={19:0}]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 192 locations, 67 error locations. UNSAFE Result, 10.5s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2469 SDtfs, 5239 SDslu, 5689 SDs, 0 SdLazy, 5300 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 158 SyntacticMatches, 16 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 724 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 839 NumberOfCodeBlocks, 839 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 169377 SizeOfPredicates, 34 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 8/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-23-55-798.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-23-55-798.csv
Received shutdown request...