java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/locks/test_locks_12.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:05:08,187 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:05:08,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:05:08,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:05:08,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:05:08,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:05:08,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:05:08,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:05:08,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:05:08,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:05:08,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:05:08,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:05:08,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:05:08,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:05:08,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:05:08,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:05:08,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:05:08,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:05:08,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:05:08,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:05:08,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:05:08,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:05:08,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:05:08,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:05:08,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:05:08,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:05:08,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:05:08,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:05:08,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:05:08,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:05:08,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:05:08,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:05:08,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:05:08,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:05:08,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:05:08,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:05:08,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:05:08,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:05:08,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:05:08,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:05:08,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:05:08,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-10-13 21:05:08,293 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 21:05:08,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:05:08,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:05:08,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 21:05:08,295 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 21:05:08,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:05:08,295 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 21:05:08,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 21:05:08,296 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 21:05:08,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 21:05:08,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:05:08,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:05:08,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:05:08,297 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 21:05:08,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 21:05:08,297 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 21:05:08,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:05:08,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:05:08,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 21:05:08,298 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 21:05:08,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 21:05:08,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:05:08,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:05:08,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:05:08,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:05:08,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 21:05:08,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:05:08,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:05:08,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES
[2019-10-13 21:05:08,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:05:08,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:05:08,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:05:08,576 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 21:05:08,577 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 21:05:08,577 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c
[2019-10-13 21:05:08,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5339cf60/8509638b8a0e488da1b7f582317f7228/FLAGfe374eb40
[2019-10-13 21:05:09,200 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 21:05:09,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c
[2019-10-13 21:05:09,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5339cf60/8509638b8a0e488da1b7f582317f7228/FLAGfe374eb40
[2019-10-13 21:05:09,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5339cf60/8509638b8a0e488da1b7f582317f7228
[2019-10-13 21:05:09,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:05:09,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:05:09,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:05:09,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:05:09,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:05:09,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:09" (1/1) ...
[2019-10-13 21:05:09,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfb33f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09, skipping insertion in model container
[2019-10-13 21:05:09,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:09" (1/1) ...
[2019-10-13 21:05:09,580 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 21:05:09,608 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:05:09,823 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:05:09,828 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 21:05:09,857 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:05:09,871 INFO L192 MainTranslator]: Completed translation
[2019-10-13 21:05:09,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09 WrapperNode
[2019-10-13 21:05:09,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:05:09,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:05:09,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:05:09,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:05:09,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ...
[2019-10-13 21:05:09,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ...
[2019-10-13 21:05:09,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ...
[2019-10-13 21:05:09,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ...
[2019-10-13 21:05:09,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ...
[2019-10-13 21:05:09,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ...
[2019-10-13 21:05:09,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ...
[2019-10-13 21:05:09,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:05:09,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:05:09,996 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:05:09,996 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:05:09,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ...
No working directory specified, using /storage/repos/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
[2019-10-13 21:05:10,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:05:10,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:05:10,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:05:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:05:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 21:05:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:05:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:05:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:05:10,401 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:05:10,402 INFO L284 CfgBuilder]: Removed 1 assume(true) statements.
[2019-10-13 21:05:10,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:10 BoogieIcfgContainer
[2019-10-13 21:05:10,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:05:10,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:05:10,405 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:05:10,408 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:05:10,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:09" (1/3) ...
[2019-10-13 21:05:10,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ed3b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:10, skipping insertion in model container
[2019-10-13 21:05:10,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (2/3) ...
[2019-10-13 21:05:10,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ed3b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:10, skipping insertion in model container
[2019-10-13 21:05:10,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:10" (3/3) ...
[2019-10-13 21:05:10,411 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c
[2019-10-13 21:05:10,424 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:05:10,433 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 21:05:10,446 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 21:05:10,479 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:05:10,479 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 21:05:10,479 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:05:10,479 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:05:10,479 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:05:10,480 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 21:05:10,480 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:05:10,480 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:05:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states.
[2019-10-13 21:05:10,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-10-13 21:05:10,510 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:10,511 INFO L380 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]
[2019-10-13 21:05:10,513 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:10,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times
[2019-10-13 21:05:10,534 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:10,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743991369]
[2019-10-13 21:05:10,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:10,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:10,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:10,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743991369]
[2019-10-13 21:05:10,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:10,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:10,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965352170]
[2019-10-13 21:05:10,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:10,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:10,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:10,754 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states.
[2019-10-13 21:05:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:10,833 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions.
[2019-10-13 21:05:10,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:10,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22
[2019-10-13 21:05:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:10,850 INFO L225 Difference]: With dead ends: 99
[2019-10-13 21:05:10,850 INFO L226 Difference]: Without dead ends: 84
[2019-10-13 21:05:10,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2019-10-13 21:05:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58.
[2019-10-13 21:05:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2019-10-13 21:05:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions.
[2019-10-13 21:05:10,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22
[2019-10-13 21:05:10,904 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:10,905 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions.
[2019-10-13 21:05:10,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions.
[2019-10-13 21:05:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-10-13 21:05:10,906 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:10,907 INFO L380 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]
[2019-10-13 21:05:10,907 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times
[2019-10-13 21:05:10,912 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:10,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652905285]
[2019-10-13 21:05:10,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:10,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:10,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:11,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652905285]
[2019-10-13 21:05:11,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:11,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:11,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390277511]
[2019-10-13 21:05:11,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:11,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:11,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,007 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states.
[2019-10-13 21:05:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:11,059 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions.
[2019-10-13 21:05:11,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:11,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22
[2019-10-13 21:05:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:11,062 INFO L225 Difference]: With dead ends: 137
[2019-10-13 21:05:11,062 INFO L226 Difference]: Without dead ends: 84
[2019-10-13 21:05:11,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2019-10-13 21:05:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82.
[2019-10-13 21:05:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2019-10-13 21:05:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions.
[2019-10-13 21:05:11,079 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22
[2019-10-13 21:05:11,079 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:11,079 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions.
[2019-10-13 21:05:11,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions.
[2019-10-13 21:05:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2019-10-13 21:05:11,081 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:11,082 INFO L380 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]
[2019-10-13 21:05:11,082 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:11,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times
[2019-10-13 21:05:11,083 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:11,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924310737]
[2019-10-13 21:05:11,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:11,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924310737]
[2019-10-13 21:05:11,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:11,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:11,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964135172]
[2019-10-13 21:05:11,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:11,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:11,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,155 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states.
[2019-10-13 21:05:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:11,209 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions.
[2019-10-13 21:05:11,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:11,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2019-10-13 21:05:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:11,212 INFO L225 Difference]: With dead ends: 126
[2019-10-13 21:05:11,212 INFO L226 Difference]: Without dead ends: 87
[2019-10-13 21:05:11,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2019-10-13 21:05:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85.
[2019-10-13 21:05:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2019-10-13 21:05:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions.
[2019-10-13 21:05:11,227 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23
[2019-10-13 21:05:11,227 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:11,227 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions.
[2019-10-13 21:05:11,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions.
[2019-10-13 21:05:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2019-10-13 21:05:11,228 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:11,229 INFO L380 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]
[2019-10-13 21:05:11,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:11,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:11,229 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times
[2019-10-13 21:05:11,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:11,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076655938]
[2019-10-13 21:05:11,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:11,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076655938]
[2019-10-13 21:05:11,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:11,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:11,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569188440]
[2019-10-13 21:05:11,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:11,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:11,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,310 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states.
[2019-10-13 21:05:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:11,332 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions.
[2019-10-13 21:05:11,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:11,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2019-10-13 21:05:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:11,335 INFO L225 Difference]: With dead ends: 160
[2019-10-13 21:05:11,335 INFO L226 Difference]: Without dead ends: 158
[2019-10-13 21:05:11,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2019-10-13 21:05:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112.
[2019-10-13 21:05:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states.
[2019-10-13 21:05:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions.
[2019-10-13 21:05:11,357 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23
[2019-10-13 21:05:11,357 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:11,357 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions.
[2019-10-13 21:05:11,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions.
[2019-10-13 21:05:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2019-10-13 21:05:11,359 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:11,359 INFO L380 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]
[2019-10-13 21:05:11,360 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:11,360 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times
[2019-10-13 21:05:11,360 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:11,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680550881]
[2019-10-13 21:05:11,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:11,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680550881]
[2019-10-13 21:05:11,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:11,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:11,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78124849]
[2019-10-13 21:05:11,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:11,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:11,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:11,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,411 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states.
[2019-10-13 21:05:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:11,438 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions.
[2019-10-13 21:05:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:11,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2019-10-13 21:05:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:11,440 INFO L225 Difference]: With dead ends: 264
[2019-10-13 21:05:11,441 INFO L226 Difference]: Without dead ends: 160
[2019-10-13 21:05:11,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2019-10-13 21:05:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158.
[2019-10-13 21:05:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states.
[2019-10-13 21:05:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions.
[2019-10-13 21:05:11,457 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23
[2019-10-13 21:05:11,457 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:11,458 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions.
[2019-10-13 21:05:11,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions.
[2019-10-13 21:05:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2019-10-13 21:05:11,459 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:11,460 INFO L380 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]
[2019-10-13 21:05:11,460 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:11,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:11,461 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times
[2019-10-13 21:05:11,461 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:11,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126198813]
[2019-10-13 21:05:11,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:11,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126198813]
[2019-10-13 21:05:11,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:11,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:11,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045184490]
[2019-10-13 21:05:11,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:11,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:11,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,520 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states.
[2019-10-13 21:05:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:11,550 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions.
[2019-10-13 21:05:11,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:11,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24
[2019-10-13 21:05:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:11,552 INFO L225 Difference]: With dead ends: 237
[2019-10-13 21:05:11,552 INFO L226 Difference]: Without dead ends: 162
[2019-10-13 21:05:11,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2019-10-13 21:05:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160.
[2019-10-13 21:05:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states.
[2019-10-13 21:05:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions.
[2019-10-13 21:05:11,570 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24
[2019-10-13 21:05:11,570 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:11,570 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions.
[2019-10-13 21:05:11,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions.
[2019-10-13 21:05:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2019-10-13 21:05:11,572 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:11,572 INFO L380 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]
[2019-10-13 21:05:11,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times
[2019-10-13 21:05:11,573 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:11,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776004510]
[2019-10-13 21:05:11,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:11,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776004510]
[2019-10-13 21:05:11,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:11,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:11,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173559298]
[2019-10-13 21:05:11,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:11,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:11,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:11,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,658 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states.
[2019-10-13 21:05:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:11,685 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions.
[2019-10-13 21:05:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:11,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24
[2019-10-13 21:05:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:11,688 INFO L225 Difference]: With dead ends: 300
[2019-10-13 21:05:11,688 INFO L226 Difference]: Without dead ends: 298
[2019-10-13 21:05:11,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states.
[2019-10-13 21:05:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216.
[2019-10-13 21:05:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states.
[2019-10-13 21:05:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions.
[2019-10-13 21:05:11,718 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24
[2019-10-13 21:05:11,719 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:11,719 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions.
[2019-10-13 21:05:11,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions.
[2019-10-13 21:05:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2019-10-13 21:05:11,721 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:11,721 INFO L380 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]
[2019-10-13 21:05:11,721 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times
[2019-10-13 21:05:11,722 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:11,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664585551]
[2019-10-13 21:05:11,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:11,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664585551]
[2019-10-13 21:05:11,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:11,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:11,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761095140]
[2019-10-13 21:05:11,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:11,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,763 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states.
[2019-10-13 21:05:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:11,797 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions.
[2019-10-13 21:05:11,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:11,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24
[2019-10-13 21:05:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:11,800 INFO L225 Difference]: With dead ends: 512
[2019-10-13 21:05:11,800 INFO L226 Difference]: Without dead ends: 306
[2019-10-13 21:05:11,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states.
[2019-10-13 21:05:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304.
[2019-10-13 21:05:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states.
[2019-10-13 21:05:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions.
[2019-10-13 21:05:11,821 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24
[2019-10-13 21:05:11,821 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:11,821 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions.
[2019-10-13 21:05:11,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions.
[2019-10-13 21:05:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-10-13 21:05:11,823 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:11,823 INFO L380 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]
[2019-10-13 21:05:11,823 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:11,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times
[2019-10-13 21:05:11,824 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:11,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652498673]
[2019-10-13 21:05:11,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:11,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652498673]
[2019-10-13 21:05:11,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:11,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:11,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982839696]
[2019-10-13 21:05:11,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:11,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:11,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,859 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states.
[2019-10-13 21:05:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:11,886 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions.
[2019-10-13 21:05:11,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:11,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25
[2019-10-13 21:05:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:11,888 INFO L225 Difference]: With dead ends: 456
[2019-10-13 21:05:11,889 INFO L226 Difference]: Without dead ends: 310
[2019-10-13 21:05:11,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states.
[2019-10-13 21:05:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308.
[2019-10-13 21:05:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states.
[2019-10-13 21:05:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions.
[2019-10-13 21:05:11,906 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25
[2019-10-13 21:05:11,908 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:11,909 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions.
[2019-10-13 21:05:11,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions.
[2019-10-13 21:05:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-10-13 21:05:11,910 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:11,910 INFO L380 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]
[2019-10-13 21:05:11,911 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:11,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:11,911 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times
[2019-10-13 21:05:11,911 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:11,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497866939]
[2019-10-13 21:05:11,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:11,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:11,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497866939]
[2019-10-13 21:05:11,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:11,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:11,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411145210]
[2019-10-13 21:05:11,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:11,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:11,966 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states.
[2019-10-13 21:05:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:11,996 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions.
[2019-10-13 21:05:11,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:11,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25
[2019-10-13 21:05:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:12,002 INFO L225 Difference]: With dead ends: 572
[2019-10-13 21:05:12,002 INFO L226 Difference]: Without dead ends: 570
[2019-10-13 21:05:12,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states.
[2019-10-13 21:05:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424.
[2019-10-13 21:05:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states.
[2019-10-13 21:05:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions.
[2019-10-13 21:05:12,019 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25
[2019-10-13 21:05:12,019 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:12,019 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions.
[2019-10-13 21:05:12,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions.
[2019-10-13 21:05:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-10-13 21:05:12,023 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:12,023 INFO L380 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]
[2019-10-13 21:05:12,024 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:12,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:12,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times
[2019-10-13 21:05:12,025 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:12,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201686907]
[2019-10-13 21:05:12,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:12,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201686907]
[2019-10-13 21:05:12,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:12,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:12,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654852179]
[2019-10-13 21:05:12,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:12,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:12,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,083 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states.
[2019-10-13 21:05:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:12,141 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions.
[2019-10-13 21:05:12,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:12,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25
[2019-10-13 21:05:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:12,148 INFO L225 Difference]: With dead ends: 1004
[2019-10-13 21:05:12,148 INFO L226 Difference]: Without dead ends: 594
[2019-10-13 21:05:12,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states.
[2019-10-13 21:05:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592.
[2019-10-13 21:05:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states.
[2019-10-13 21:05:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions.
[2019-10-13 21:05:12,187 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25
[2019-10-13 21:05:12,187 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:12,188 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions.
[2019-10-13 21:05:12,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions.
[2019-10-13 21:05:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-10-13 21:05:12,190 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:12,190 INFO L380 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]
[2019-10-13 21:05:12,190 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:12,191 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times
[2019-10-13 21:05:12,191 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:12,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609421890]
[2019-10-13 21:05:12,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:12,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609421890]
[2019-10-13 21:05:12,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:12,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:12,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24223920]
[2019-10-13 21:05:12,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:12,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,238 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states.
[2019-10-13 21:05:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:12,267 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions.
[2019-10-13 21:05:12,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:12,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26
[2019-10-13 21:05:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:12,272 INFO L225 Difference]: With dead ends: 888
[2019-10-13 21:05:12,273 INFO L226 Difference]: Without dead ends: 602
[2019-10-13 21:05:12,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states.
[2019-10-13 21:05:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600.
[2019-10-13 21:05:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states.
[2019-10-13 21:05:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions.
[2019-10-13 21:05:12,298 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26
[2019-10-13 21:05:12,300 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:12,300 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions.
[2019-10-13 21:05:12,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions.
[2019-10-13 21:05:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-10-13 21:05:12,302 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:12,302 INFO L380 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]
[2019-10-13 21:05:12,302 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times
[2019-10-13 21:05:12,303 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:12,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067308631]
[2019-10-13 21:05:12,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:12,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067308631]
[2019-10-13 21:05:12,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:12,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:12,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845681141]
[2019-10-13 21:05:12,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:12,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:12,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:12,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,343 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states.
[2019-10-13 21:05:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:12,378 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions.
[2019-10-13 21:05:12,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:12,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26
[2019-10-13 21:05:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:12,385 INFO L225 Difference]: With dead ends: 1100
[2019-10-13 21:05:12,385 INFO L226 Difference]: Without dead ends: 1098
[2019-10-13 21:05:12,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states.
[2019-10-13 21:05:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840.
[2019-10-13 21:05:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states.
[2019-10-13 21:05:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions.
[2019-10-13 21:05:12,414 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26
[2019-10-13 21:05:12,414 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:12,414 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions.
[2019-10-13 21:05:12,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions.
[2019-10-13 21:05:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-10-13 21:05:12,418 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:12,418 INFO L380 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]
[2019-10-13 21:05:12,418 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:12,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times
[2019-10-13 21:05:12,419 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:12,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771255997]
[2019-10-13 21:05:12,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:12,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771255997]
[2019-10-13 21:05:12,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:12,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:12,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619634660]
[2019-10-13 21:05:12,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:12,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:12,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:12,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,452 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states.
[2019-10-13 21:05:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:12,487 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions.
[2019-10-13 21:05:12,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:12,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26
[2019-10-13 21:05:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:12,494 INFO L225 Difference]: With dead ends: 1980
[2019-10-13 21:05:12,494 INFO L226 Difference]: Without dead ends: 1162
[2019-10-13 21:05:12,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states.
[2019-10-13 21:05:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160.
[2019-10-13 21:05:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states.
[2019-10-13 21:05:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions.
[2019-10-13 21:05:12,535 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26
[2019-10-13 21:05:12,536 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:12,536 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions.
[2019-10-13 21:05:12,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions.
[2019-10-13 21:05:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2019-10-13 21:05:12,538 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:12,538 INFO L380 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]
[2019-10-13 21:05:12,539 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:12,539 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times
[2019-10-13 21:05:12,539 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:12,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651129301]
[2019-10-13 21:05:12,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:12,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651129301]
[2019-10-13 21:05:12,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:12,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:12,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985691976]
[2019-10-13 21:05:12,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:12,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:12,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:12,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,568 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states.
[2019-10-13 21:05:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:12,612 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions.
[2019-10-13 21:05:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:12,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27
[2019-10-13 21:05:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:12,618 INFO L225 Difference]: With dead ends: 1740
[2019-10-13 21:05:12,619 INFO L226 Difference]: Without dead ends: 1178
[2019-10-13 21:05:12,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states.
[2019-10-13 21:05:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176.
[2019-10-13 21:05:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states.
[2019-10-13 21:05:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions.
[2019-10-13 21:05:12,655 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27
[2019-10-13 21:05:12,655 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:12,656 INFO L462 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions.
[2019-10-13 21:05:12,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions.
[2019-10-13 21:05:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2019-10-13 21:05:12,658 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:12,658 INFO L380 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]
[2019-10-13 21:05:12,658 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times
[2019-10-13 21:05:12,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:12,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565993630]
[2019-10-13 21:05:12,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:12,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565993630]
[2019-10-13 21:05:12,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:12,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:12,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587534560]
[2019-10-13 21:05:12,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:12,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:12,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:12,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,682 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states.
[2019-10-13 21:05:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:12,717 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions.
[2019-10-13 21:05:12,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:12,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27
[2019-10-13 21:05:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:12,728 INFO L225 Difference]: With dead ends: 2124
[2019-10-13 21:05:12,728 INFO L226 Difference]: Without dead ends: 2122
[2019-10-13 21:05:12,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states.
[2019-10-13 21:05:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672.
[2019-10-13 21:05:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states.
[2019-10-13 21:05:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions.
[2019-10-13 21:05:12,785 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27
[2019-10-13 21:05:12,785 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:12,785 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions.
[2019-10-13 21:05:12,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions.
[2019-10-13 21:05:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2019-10-13 21:05:12,790 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:12,790 INFO L380 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]
[2019-10-13 21:05:12,791 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times
[2019-10-13 21:05:12,792 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:12,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986506537]
[2019-10-13 21:05:12,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:12,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:12,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986506537]
[2019-10-13 21:05:12,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:12,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:12,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574044795]
[2019-10-13 21:05:12,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:12,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:12,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:12,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,819 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states.
[2019-10-13 21:05:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:12,886 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions.
[2019-10-13 21:05:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:12,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27
[2019-10-13 21:05:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:12,903 INFO L225 Difference]: With dead ends: 3916
[2019-10-13 21:05:12,903 INFO L226 Difference]: Without dead ends: 2282
[2019-10-13 21:05:12,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states.
[2019-10-13 21:05:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280.
[2019-10-13 21:05:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states.
[2019-10-13 21:05:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions.
[2019-10-13 21:05:13,009 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27
[2019-10-13 21:05:13,009 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:13,009 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions.
[2019-10-13 21:05:13,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions.
[2019-10-13 21:05:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2019-10-13 21:05:13,013 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:13,013 INFO L380 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]
[2019-10-13 21:05:13,014 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times
[2019-10-13 21:05:13,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:13,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912581583]
[2019-10-13 21:05:13,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:13,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:13,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:13,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912581583]
[2019-10-13 21:05:13,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:13,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:13,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483416706]
[2019-10-13 21:05:13,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:13,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:13,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:13,042 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states.
[2019-10-13 21:05:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:13,111 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions.
[2019-10-13 21:05:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:13,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28
[2019-10-13 21:05:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:13,128 INFO L225 Difference]: With dead ends: 3420
[2019-10-13 21:05:13,129 INFO L226 Difference]: Without dead ends: 2314
[2019-10-13 21:05:13,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states.
[2019-10-13 21:05:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312.
[2019-10-13 21:05:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states.
[2019-10-13 21:05:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions.
[2019-10-13 21:05:13,254 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28
[2019-10-13 21:05:13,254 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:13,254 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions.
[2019-10-13 21:05:13,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions.
[2019-10-13 21:05:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2019-10-13 21:05:13,258 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:13,258 INFO L380 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]
[2019-10-13 21:05:13,258 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:13,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times
[2019-10-13 21:05:13,259 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:13,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230351321]
[2019-10-13 21:05:13,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:13,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:13,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:13,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230351321]
[2019-10-13 21:05:13,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:13,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:13,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037887656]
[2019-10-13 21:05:13,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:13,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:13,282 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states.
[2019-10-13 21:05:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:13,349 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions.
[2019-10-13 21:05:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:13,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28
[2019-10-13 21:05:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:13,370 INFO L225 Difference]: With dead ends: 4108
[2019-10-13 21:05:13,370 INFO L226 Difference]: Without dead ends: 4106
[2019-10-13 21:05:13,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states.
[2019-10-13 21:05:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336.
[2019-10-13 21:05:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states.
[2019-10-13 21:05:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions.
[2019-10-13 21:05:13,468 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28
[2019-10-13 21:05:13,468 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:13,468 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions.
[2019-10-13 21:05:13,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions.
[2019-10-13 21:05:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2019-10-13 21:05:13,475 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:13,475 INFO L380 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]
[2019-10-13 21:05:13,475 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times
[2019-10-13 21:05:13,476 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:13,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916027545]
[2019-10-13 21:05:13,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:13,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:13,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:13,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916027545]
[2019-10-13 21:05:13,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:13,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:13,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517813227]
[2019-10-13 21:05:13,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:13,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:13,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:13,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:13,495 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states.
[2019-10-13 21:05:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:13,569 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions.
[2019-10-13 21:05:13,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:13,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28
[2019-10-13 21:05:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:13,595 INFO L225 Difference]: With dead ends: 7756
[2019-10-13 21:05:13,595 INFO L226 Difference]: Without dead ends: 4490
[2019-10-13 21:05:13,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states.
[2019-10-13 21:05:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488.
[2019-10-13 21:05:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states.
[2019-10-13 21:05:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions.
[2019-10-13 21:05:13,801 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28
[2019-10-13 21:05:13,801 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:13,801 INFO L462 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions.
[2019-10-13 21:05:13,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions.
[2019-10-13 21:05:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2019-10-13 21:05:13,808 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:13,808 INFO L380 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]
[2019-10-13 21:05:13,808 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:13,809 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times
[2019-10-13 21:05:13,809 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:13,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816454345]
[2019-10-13 21:05:13,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:13,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:13,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:13,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816454345]
[2019-10-13 21:05:13,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:13,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:13,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675868877]
[2019-10-13 21:05:13,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:13,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:13,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:13,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:13,836 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states.
[2019-10-13 21:05:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:13,909 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions.
[2019-10-13 21:05:13,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:13,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29
[2019-10-13 21:05:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:13,943 INFO L225 Difference]: With dead ends: 6732
[2019-10-13 21:05:13,943 INFO L226 Difference]: Without dead ends: 4554
[2019-10-13 21:05:13,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states.
[2019-10-13 21:05:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552.
[2019-10-13 21:05:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states.
[2019-10-13 21:05:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions.
[2019-10-13 21:05:14,076 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29
[2019-10-13 21:05:14,076 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:14,076 INFO L462 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions.
[2019-10-13 21:05:14,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions.
[2019-10-13 21:05:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2019-10-13 21:05:14,082 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:14,083 INFO L380 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]
[2019-10-13 21:05:14,083 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:14,084 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times
[2019-10-13 21:05:14,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:14,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775086884]
[2019-10-13 21:05:14,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:14,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:14,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:14,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775086884]
[2019-10-13 21:05:14,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:14,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:14,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879022615]
[2019-10-13 21:05:14,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:14,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:14,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:14,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:14,112 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states.
[2019-10-13 21:05:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:14,260 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions.
[2019-10-13 21:05:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:14,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29
[2019-10-13 21:05:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:14,281 INFO L225 Difference]: With dead ends: 13260
[2019-10-13 21:05:14,281 INFO L226 Difference]: Without dead ends: 8842
[2019-10-13 21:05:14,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states.
[2019-10-13 21:05:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840.
[2019-10-13 21:05:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states.
[2019-10-13 21:05:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions.
[2019-10-13 21:05:14,597 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29
[2019-10-13 21:05:14,597 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:14,597 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions.
[2019-10-13 21:05:14,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions.
[2019-10-13 21:05:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2019-10-13 21:05:14,608 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:14,608 INFO L380 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]
[2019-10-13 21:05:14,610 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times
[2019-10-13 21:05:14,610 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:14,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429733183]
[2019-10-13 21:05:14,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:14,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:14,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:14,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429733183]
[2019-10-13 21:05:14,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:14,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:14,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455635410]
[2019-10-13 21:05:14,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:14,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:14,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:14,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:14,641 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states.
[2019-10-13 21:05:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:14,778 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions.
[2019-10-13 21:05:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:14,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29
[2019-10-13 21:05:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:14,802 INFO L225 Difference]: With dead ends: 10124
[2019-10-13 21:05:14,802 INFO L226 Difference]: Without dead ends: 10122
[2019-10-13 21:05:14,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states.
[2019-10-13 21:05:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840.
[2019-10-13 21:05:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states.
[2019-10-13 21:05:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions.
[2019-10-13 21:05:15,143 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29
[2019-10-13 21:05:15,143 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:15,143 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions.
[2019-10-13 21:05:15,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions.
[2019-10-13 21:05:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2019-10-13 21:05:15,155 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:15,155 INFO L380 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]
[2019-10-13 21:05:15,155 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:15,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times
[2019-10-13 21:05:15,156 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:15,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715159842]
[2019-10-13 21:05:15,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:15,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:15,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:15,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715159842]
[2019-10-13 21:05:15,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:15,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:15,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528588616]
[2019-10-13 21:05:15,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:15,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:15,178 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states.
[2019-10-13 21:05:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:15,390 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions.
[2019-10-13 21:05:15,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:15,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30
[2019-10-13 21:05:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:15,434 INFO L225 Difference]: With dead ends: 15244
[2019-10-13 21:05:15,434 INFO L226 Difference]: Without dead ends: 15242
[2019-10-13 21:05:15,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:15,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states.
[2019-10-13 21:05:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192.
[2019-10-13 21:05:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states.
[2019-10-13 21:05:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions.
[2019-10-13 21:05:15,999 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30
[2019-10-13 21:05:15,999 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:15,999 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions.
[2019-10-13 21:05:15,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions.
[2019-10-13 21:05:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2019-10-13 21:05:16,023 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:16,023 INFO L380 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]
[2019-10-13 21:05:16,023 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:16,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:16,024 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times
[2019-10-13 21:05:16,024 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:16,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253933100]
[2019-10-13 21:05:16,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:16,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:16,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:16,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253933100]
[2019-10-13 21:05:16,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:16,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:16,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013949253]
[2019-10-13 21:05:16,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:16,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:16,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:16,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:16,051 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states.
[2019-10-13 21:05:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:16,284 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions.
[2019-10-13 21:05:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:16,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30
[2019-10-13 21:05:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:16,319 INFO L225 Difference]: With dead ends: 30348
[2019-10-13 21:05:16,319 INFO L226 Difference]: Without dead ends: 17290
[2019-10-13 21:05:16,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states.
[2019-10-13 21:05:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288.
[2019-10-13 21:05:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states.
[2019-10-13 21:05:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions.
[2019-10-13 21:05:17,235 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30
[2019-10-13 21:05:17,235 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:17,235 INFO L462 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions.
[2019-10-13 21:05:17,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions.
[2019-10-13 21:05:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2019-10-13 21:05:17,257 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:17,258 INFO L380 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]
[2019-10-13 21:05:17,258 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:17,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times
[2019-10-13 21:05:17,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:17,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583175831]
[2019-10-13 21:05:17,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:17,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:17,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:17,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583175831]
[2019-10-13 21:05:17,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:17,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:17,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916174210]
[2019-10-13 21:05:17,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:17,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:17,282 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states.
[2019-10-13 21:05:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:17,464 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions.
[2019-10-13 21:05:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:17,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31
[2019-10-13 21:05:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:17,498 INFO L225 Difference]: With dead ends: 26124
[2019-10-13 21:05:17,499 INFO L226 Difference]: Without dead ends: 17674
[2019-10-13 21:05:17,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states.
[2019-10-13 21:05:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672.
[2019-10-13 21:05:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states.
[2019-10-13 21:05:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions.
[2019-10-13 21:05:17,971 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31
[2019-10-13 21:05:17,971 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:17,972 INFO L462 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions.
[2019-10-13 21:05:17,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions.
[2019-10-13 21:05:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2019-10-13 21:05:17,994 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:17,994 INFO L380 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]
[2019-10-13 21:05:17,995 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:17,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times
[2019-10-13 21:05:17,995 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:17,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14054697]
[2019-10-13 21:05:17,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:17,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:17,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:18,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14054697]
[2019-10-13 21:05:18,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:18,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:18,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825997079]
[2019-10-13 21:05:18,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:18,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:18,014 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states.
[2019-10-13 21:05:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:18,301 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions.
[2019-10-13 21:05:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:18,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31
[2019-10-13 21:05:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:18,366 INFO L225 Difference]: With dead ends: 29708
[2019-10-13 21:05:18,367 INFO L226 Difference]: Without dead ends: 29706
[2019-10-13 21:05:18,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states.
[2019-10-13 21:05:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632.
[2019-10-13 21:05:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states.
[2019-10-13 21:05:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions.
[2019-10-13 21:05:18,956 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31
[2019-10-13 21:05:18,956 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:18,956 INFO L462 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions.
[2019-10-13 21:05:18,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions.
[2019-10-13 21:05:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2019-10-13 21:05:18,997 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:18,997 INFO L380 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]
[2019-10-13 21:05:18,997 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times
[2019-10-13 21:05:18,998 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:18,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097959673]
[2019-10-13 21:05:18,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:18,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:18,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:19,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097959673]
[2019-10-13 21:05:19,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:19,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:19,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095286943]
[2019-10-13 21:05:19,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:19,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:19,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:19,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:19,017 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states.
[2019-10-13 21:05:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:19,344 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions.
[2019-10-13 21:05:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:19,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31
[2019-10-13 21:05:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:19,420 INFO L225 Difference]: With dead ends: 60428
[2019-10-13 21:05:19,421 INFO L226 Difference]: Without dead ends: 34314
[2019-10-13 21:05:19,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states.
[2019-10-13 21:05:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312.
[2019-10-13 21:05:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states.
[2019-10-13 21:05:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions.
[2019-10-13 21:05:20,292 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31
[2019-10-13 21:05:20,292 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:20,293 INFO L462 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions.
[2019-10-13 21:05:20,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions.
[2019-10-13 21:05:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2019-10-13 21:05:20,328 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:20,329 INFO L380 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]
[2019-10-13 21:05:20,329 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times
[2019-10-13 21:05:20,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:20,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227270306]
[2019-10-13 21:05:20,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:20,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:20,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:20,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227270306]
[2019-10-13 21:05:20,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:20,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:20,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456023175]
[2019-10-13 21:05:20,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:20,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:20,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:20,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:20,351 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states.
[2019-10-13 21:05:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:20,897 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions.
[2019-10-13 21:05:20,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:20,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32
[2019-10-13 21:05:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:20,976 INFO L225 Difference]: With dead ends: 51468
[2019-10-13 21:05:20,977 INFO L226 Difference]: Without dead ends: 34826
[2019-10-13 21:05:21,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states.
[2019-10-13 21:05:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824.
[2019-10-13 21:05:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states.
[2019-10-13 21:05:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions.
[2019-10-13 21:05:21,606 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32
[2019-10-13 21:05:21,606 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:21,606 INFO L462 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions.
[2019-10-13 21:05:21,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions.
[2019-10-13 21:05:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2019-10-13 21:05:21,629 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:21,629 INFO L380 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]
[2019-10-13 21:05:21,629 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:21,630 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times
[2019-10-13 21:05:21,630 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:21,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881603918]
[2019-10-13 21:05:21,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:21,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:21,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:21,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881603918]
[2019-10-13 21:05:21,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:21,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:21,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754736943]
[2019-10-13 21:05:21,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:21,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:21,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:21,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:21,648 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states.
[2019-10-13 21:05:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:22,292 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions.
[2019-10-13 21:05:22,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:22,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32
[2019-10-13 21:05:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:22,357 INFO L225 Difference]: With dead ends: 57356
[2019-10-13 21:05:22,357 INFO L226 Difference]: Without dead ends: 57354
[2019-10-13 21:05:22,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states.
[2019-10-13 21:05:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256.
[2019-10-13 21:05:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states.
[2019-10-13 21:05:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions.
[2019-10-13 21:05:24,569 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32
[2019-10-13 21:05:24,569 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:24,569 INFO L462 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions.
[2019-10-13 21:05:24,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions.
[2019-10-13 21:05:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2019-10-13 21:05:24,606 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:24,607 INFO L380 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]
[2019-10-13 21:05:24,607 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:24,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times
[2019-10-13 21:05:24,608 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:24,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577733009]
[2019-10-13 21:05:24,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:24,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:24,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:24,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577733009]
[2019-10-13 21:05:24,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:24,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:24,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171864568]
[2019-10-13 21:05:24,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:24,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:24,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:24,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:24,631 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states.
[2019-10-13 21:05:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:25,290 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions.
[2019-10-13 21:05:25,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:25,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32
[2019-10-13 21:05:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:25,382 INFO L225 Difference]: With dead ends: 119820
[2019-10-13 21:05:25,382 INFO L226 Difference]: Without dead ends: 67594
[2019-10-13 21:05:25,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states.
[2019-10-13 21:05:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592.
[2019-10-13 21:05:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states.
[2019-10-13 21:05:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions.
[2019-10-13 21:05:26,668 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32
[2019-10-13 21:05:26,668 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:26,668 INFO L462 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions.
[2019-10-13 21:05:26,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions.
[2019-10-13 21:05:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2019-10-13 21:05:26,711 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:26,711 INFO L380 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]
[2019-10-13 21:05:26,712 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times
[2019-10-13 21:05:26,712 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:26,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790998568]
[2019-10-13 21:05:26,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:26,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:26,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:26,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790998568]
[2019-10-13 21:05:26,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:26,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:26,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105084608]
[2019-10-13 21:05:26,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:26,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:26,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:26,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:26,731 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states.
[2019-10-13 21:05:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:27,233 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions.
[2019-10-13 21:05:27,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:27,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33
[2019-10-13 21:05:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:27,300 INFO L225 Difference]: With dead ends: 101388
[2019-10-13 21:05:27,300 INFO L226 Difference]: Without dead ends: 68618
[2019-10-13 21:05:27,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states.
[2019-10-13 21:05:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616.
[2019-10-13 21:05:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states.
[2019-10-13 21:05:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions.
[2019-10-13 21:05:28,512 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33
[2019-10-13 21:05:28,512 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:28,513 INFO L462 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions.
[2019-10-13 21:05:28,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions.
[2019-10-13 21:05:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2019-10-13 21:05:28,546 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:28,546 INFO L380 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]
[2019-10-13 21:05:28,547 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times
[2019-10-13 21:05:28,547 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:28,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362554337]
[2019-10-13 21:05:28,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:28,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:28,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:28,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362554337]
[2019-10-13 21:05:28,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:28,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:28,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649109601]
[2019-10-13 21:05:28,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:28,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:28,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:28,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:28,574 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states.
[2019-10-13 21:05:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:30,494 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions.
[2019-10-13 21:05:30,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:30,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33
[2019-10-13 21:05:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:30,601 INFO L225 Difference]: With dead ends: 110602
[2019-10-13 21:05:30,601 INFO L226 Difference]: Without dead ends: 110600
[2019-10-13 21:05:30,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states.
[2019-10-13 21:05:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504.
[2019-10-13 21:05:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states.
[2019-10-13 21:05:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions.
[2019-10-13 21:05:31,852 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33
[2019-10-13 21:05:31,852 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:31,852 INFO L462 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions.
[2019-10-13 21:05:31,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions.
[2019-10-13 21:05:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2019-10-13 21:05:31,942 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:05:31,942 INFO L380 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]
[2019-10-13 21:05:31,942 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:05:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:05:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times
[2019-10-13 21:05:31,942 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:05:31,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967357549]
[2019-10-13 21:05:31,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:31,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:05:31,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:05:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:05:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:05:31,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967357549]
[2019-10-13 21:05:31,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:05:31,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:05:31,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563224237]
[2019-10-13 21:05:31,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:05:31,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:05:31,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:05:31,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:31,963 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states.
[2019-10-13 21:05:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:05:32,987 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions.
[2019-10-13 21:05:32,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:05:32,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33
[2019-10-13 21:05:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:05:32,987 INFO L225 Difference]: With dead ends: 237576
[2019-10-13 21:05:32,987 INFO L226 Difference]: Without dead ends: 0
[2019-10-13 21:05:35,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:05:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 21:05:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 21:05:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 21:05:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 21:05:35,299 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33
[2019-10-13 21:05:35,299 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:05:35,300 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 21:05:35,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:05:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 21:05:35,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 21:05:35,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 21:05:35,332 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2019-10-13 21:05:35,332 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 21:05:35,333 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 21:05:35,333 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true
[2019-10-13 21:05:35,333 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2019-10-13 21:05:35,333 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 21:05:35,333 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,333 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed.
[2019-10-13 21:05:35,333 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,333 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,333 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,334 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed.
[2019-10-13 21:05:35,335 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,335 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true
[2019-10-13 21:05:35,335 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true
[2019-10-13 21:05:35,335 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,335 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,335 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed.
[2019-10-13 21:05:35,335 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,335 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,335 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed.
[2019-10-13 21:05:35,336 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed.
[2019-10-13 21:05:35,336 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,336 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,336 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true
[2019-10-13 21:05:35,336 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed.
[2019-10-13 21:05:35,336 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed.
[2019-10-13 21:05:35,336 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed.
[2019-10-13 21:05:35,336 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false
[2019-10-13 21:05:35,337 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,337 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,337 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,337 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,337 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,337 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed.
[2019-10-13 21:05:35,337 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,338 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,338 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed.
[2019-10-13 21:05:35,338 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed.
[2019-10-13 21:05:35,338 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed.
[2019-10-13 21:05:35,338 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed.
[2019-10-13 21:05:35,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:05:35 BoogieIcfgContainer
[2019-10-13 21:05:35,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 21:05:35,349 INFO L168 Benchmark]: Toolchain (without parser) took 25790.68 ms. Allocated memory was 138.4 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 101.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 283.1 MB. Max. memory is 7.1 GB.
[2019-10-13 21:05:35,349 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 21:05:35,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.24 ms. Allocated memory is still 138.4 MB. Free memory was 101.5 MB in the beginning and 90.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB.
[2019-10-13 21:05:35,350 INFO L168 Benchmark]: Boogie Preprocessor took 123.55 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 180.1 MB in the end (delta: -89.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB.
[2019-10-13 21:05:35,351 INFO L168 Benchmark]: RCFGBuilder took 407.57 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 159.7 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB.
[2019-10-13 21:05:35,351 INFO L168 Benchmark]: TraceAbstraction took 24942.15 ms. Allocated memory was 202.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 159.0 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 276.5 MB. Max. memory is 7.1 GB.
[2019-10-13 21:05:35,354 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 309.24 ms. Allocated memory is still 138.4 MB. Free memory was 101.5 MB in the beginning and 90.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 123.55 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 180.1 MB in the end (delta: -89.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 407.57 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 159.7 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 24942.15 ms. Allocated memory was 202.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 159.0 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 276.5 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 5]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 45]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 5]: Loop Invariant
Derived loop invariant: 0
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 50 locations, 1 error locations. Result: SAFE, OverallTime: 24.8s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...