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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:17,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:17,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:17,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:17,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:17,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:17,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:17,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:17,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:17,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:17,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:17,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:17,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:17,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:17,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:17,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:17,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:17,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:17,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:17,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:17,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:17,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:17,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:17,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:17,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:17,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:17,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:17,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:17,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:17,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:17,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:17,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:17,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:17,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:17,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:17,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:17,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:17,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:17,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:17,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:17,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:17,230 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:17,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:17,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:17,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:17,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:17,268 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:17,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:17,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:17,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:17,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:17,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:17,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:17,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:17,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:17,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:17,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:17,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:17,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:17,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:17,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:17,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:17,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:17,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:17,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:17,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:17,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:17,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:17,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:17,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:17,275 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:17,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:17,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:17,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:17,605 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:17,605 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:17,606 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-10-13 21:05:17,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7eee8c1a/92d0e424ce9445c483aea03f0c0adfab/FLAG0f8719802 [2019-10-13 21:05:18,147 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:18,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-10-13 21:05:18,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7eee8c1a/92d0e424ce9445c483aea03f0c0adfab/FLAG0f8719802 [2019-10-13 21:05:18,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7eee8c1a/92d0e424ce9445c483aea03f0c0adfab [2019-10-13 21:05:18,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:18,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:18,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:18,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:18,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:18,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:18" (1/1) ... [2019-10-13 21:05:18,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:18, skipping insertion in model container [2019-10-13 21:05:18,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:18" (1/1) ... [2019-10-13 21:05:18,572 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:18,591 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:18,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:18,760 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:18,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:18,878 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:18,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:18 WrapperNode [2019-10-13 21:05:18,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:18,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:18,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:18,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:18,890 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:18" (1/1) ... [2019-10-13 21:05:18,890 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:18" (1/1) ... [2019-10-13 21:05:18,896 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:18" (1/1) ... [2019-10-13 21:05:18,896 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:18" (1/1) ... [2019-10-13 21:05:18,900 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:18" (1/1) ... [2019-10-13 21:05:18,912 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:18" (1/1) ... [2019-10-13 21:05:18,913 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:18" (1/1) ... [2019-10-13 21:05:18,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:18,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:18,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:18,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:18,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:18" (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:18,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:18,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:18,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:05:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:19,248 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:19,248 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:19,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:19 BoogieIcfgContainer [2019-10-13 21:05:19,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:19,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:19,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:19,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:19,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:18" (1/3) ... [2019-10-13 21:05:19,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50304962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:19, skipping insertion in model container [2019-10-13 21:05:19,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:18" (2/3) ... [2019-10-13 21:05:19,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50304962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:19, skipping insertion in model container [2019-10-13 21:05:19,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:19" (3/3) ... [2019-10-13 21:05:19,263 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-10-13 21:05:19,280 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:19,297 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:19,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:19,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:19,331 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:19,331 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:19,332 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:19,332 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:19,332 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:19,332 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:19,332 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-13 21:05:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:05:19,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,359 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:19,361 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-10-13 21:05:19,372 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208376487] [2019-10-13 21:05:19,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,526 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,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208376487] [2019-10-13 21:05:19,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604096025] [2019-10-13 21:05:19,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,554 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-10-13 21:05:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,610 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2019-10-13 21:05:19,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:05:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,626 INFO L225 Difference]: With dead ends: 69 [2019-10-13 21:05:19,627 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 21:05:19,633 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,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 21:05:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-10-13 21:05:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 21:05:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-10-13 21:05:19,708 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-10-13 21:05:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,709 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-10-13 21:05:19,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-10-13 21:05:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:05:19,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,712 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:19,713 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-10-13 21:05:19,716 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696753347] [2019-10-13 21:05:19,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,821 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,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696753347] [2019-10-13 21:05:19,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302612306] [2019-10-13 21:05:19,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,830 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-10-13 21:05:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,879 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-10-13 21:05:19,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:05:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,881 INFO L225 Difference]: With dead ends: 87 [2019-10-13 21:05:19,882 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 21:05:19,883 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,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 21:05:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-10-13 21:05:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 21:05:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-10-13 21:05:19,891 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-10-13 21:05:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,892 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-10-13 21:05:19,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-10-13 21:05:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:19,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:19,894 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-10-13 21:05:19,895 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119642533] [2019-10-13 21:05:19,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,941 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,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119642533] [2019-10-13 21:05:19,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015766287] [2019-10-13 21:05:19,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,944 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-10-13 21:05:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,965 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2019-10-13 21:05:19,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,967 INFO L225 Difference]: With dead ends: 81 [2019-10-13 21:05:19,967 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 21:05:19,968 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,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 21:05:19,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-13 21:05:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 21:05:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-10-13 21:05:19,976 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-10-13 21:05:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,977 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-10-13 21:05:19,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-10-13 21:05:19,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:19,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,978 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:19,979 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-10-13 21:05:19,980 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392185887] [2019-10-13 21:05:19,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,013 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,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392185887] [2019-10-13 21:05:20,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280176749] [2019-10-13 21:05:20,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,016 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-10-13 21:05:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,052 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2019-10-13 21:05:20,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,054 INFO L225 Difference]: With dead ends: 100 [2019-10-13 21:05:20,054 INFO L226 Difference]: Without dead ends: 98 [2019-10-13 21:05:20,055 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:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-13 21:05:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-10-13 21:05:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 21:05:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-10-13 21:05:20,068 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-10-13 21:05:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,068 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-10-13 21:05:20,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,069 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-10-13 21:05:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:20,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,073 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:20,073 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,074 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-10-13 21:05:20,074 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570028387] [2019-10-13 21:05:20,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,140 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,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570028387] [2019-10-13 21:05:20,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913891166] [2019-10-13 21:05:20,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,145 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-10-13 21:05:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,179 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2019-10-13 21:05:20,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,182 INFO L225 Difference]: With dead ends: 164 [2019-10-13 21:05:20,182 INFO L226 Difference]: Without dead ends: 100 [2019-10-13 21:05:20,183 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:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-13 21:05:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-10-13 21:05:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-13 21:05:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-10-13 21:05:20,203 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-10-13 21:05:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,204 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-10-13 21:05:20,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-10-13 21:05:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:20,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,205 INFO L380 BasicCegarLoop]: trace histogram [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,205 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-10-13 21:05:20,206 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993082017] [2019-10-13 21:05:20,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,246 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,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993082017] [2019-10-13 21:05:20,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796769328] [2019-10-13 21:05:20,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,251 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-10-13 21:05:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,276 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2019-10-13 21:05:20,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,278 INFO L225 Difference]: With dead ends: 147 [2019-10-13 21:05:20,278 INFO L226 Difference]: Without dead ends: 102 [2019-10-13 21:05:20,281 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:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-13 21:05:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-13 21:05:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-13 21:05:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-10-13 21:05:20,299 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-10-13 21:05:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,299 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-10-13 21:05:20,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-10-13 21:05:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:20,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,301 INFO L380 BasicCegarLoop]: trace histogram [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,301 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-10-13 21:05:20,304 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049676858] [2019-10-13 21:05:20,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,329 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,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049676858] [2019-10-13 21:05:20,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519991454] [2019-10-13 21:05:20,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,332 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-10-13 21:05:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,348 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-10-13 21:05:20,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,350 INFO L225 Difference]: With dead ends: 180 [2019-10-13 21:05:20,350 INFO L226 Difference]: Without dead ends: 178 [2019-10-13 21:05:20,351 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:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-13 21:05:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-10-13 21:05:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-13 21:05:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-10-13 21:05:20,362 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-10-13 21:05:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,363 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-10-13 21:05:20,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-10-13 21:05:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:20,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,365 INFO L380 BasicCegarLoop]: trace histogram [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,365 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-10-13 21:05:20,366 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761522090] [2019-10-13 21:05:20,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,389 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,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761522090] [2019-10-13 21:05:20,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354728625] [2019-10-13 21:05:20,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,392 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-10-13 21:05:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,426 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-10-13 21:05:20,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,428 INFO L225 Difference]: With dead ends: 312 [2019-10-13 21:05:20,429 INFO L226 Difference]: Without dead ends: 186 [2019-10-13 21:05:20,430 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:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-13 21:05:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-10-13 21:05:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-13 21:05:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-10-13 21:05:20,442 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-10-13 21:05:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,442 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-10-13 21:05:20,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-10-13 21:05:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:20,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,444 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] [2019-10-13 21:05:20,445 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-10-13 21:05:20,445 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362330800] [2019-10-13 21:05:20,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,476 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,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362330800] [2019-10-13 21:05:20,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733941795] [2019-10-13 21:05:20,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,479 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-10-13 21:05:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,509 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2019-10-13 21:05:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,511 INFO L225 Difference]: With dead ends: 276 [2019-10-13 21:05:20,511 INFO L226 Difference]: Without dead ends: 190 [2019-10-13 21:05:20,512 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:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-13 21:05:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-10-13 21:05:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-13 21:05:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-10-13 21:05:20,532 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-10-13 21:05:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,533 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-10-13 21:05:20,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-10-13 21:05:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:20,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,536 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] [2019-10-13 21:05:20,537 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-10-13 21:05:20,537 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577318048] [2019-10-13 21:05:20,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,569 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,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577318048] [2019-10-13 21:05:20,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752508324] [2019-10-13 21:05:20,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,572 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-10-13 21:05:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,609 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2019-10-13 21:05:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,613 INFO L225 Difference]: With dead ends: 332 [2019-10-13 21:05:20,613 INFO L226 Difference]: Without dead ends: 330 [2019-10-13 21:05:20,613 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:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-13 21:05:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-10-13 21:05:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-13 21:05:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-10-13 21:05:20,624 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-10-13 21:05:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,624 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-10-13 21:05:20,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-10-13 21:05:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:20,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,626 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] [2019-10-13 21:05:20,627 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-10-13 21:05:20,627 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902076513] [2019-10-13 21:05:20,628 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,628 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,652 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,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902076513] [2019-10-13 21:05:20,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395738177] [2019-10-13 21:05:20,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,655 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-10-13 21:05:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,689 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2019-10-13 21:05:20,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,692 INFO L225 Difference]: With dead ends: 604 [2019-10-13 21:05:20,693 INFO L226 Difference]: Without dead ends: 354 [2019-10-13 21:05:20,694 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:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-13 21:05:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-10-13 21:05:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-13 21:05:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-10-13 21:05:20,717 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-10-13 21:05:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,717 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-10-13 21:05:20,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-10-13 21:05:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:20,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,720 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] [2019-10-13 21:05:20,720 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-10-13 21:05:20,721 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279777628] [2019-10-13 21:05:20,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,762 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,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279777628] [2019-10-13 21:05:20,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847033610] [2019-10-13 21:05:20,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,765 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-10-13 21:05:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,789 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2019-10-13 21:05:20,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,791 INFO L225 Difference]: With dead ends: 528 [2019-10-13 21:05:20,792 INFO L226 Difference]: Without dead ends: 362 [2019-10-13 21:05:20,792 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:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-13 21:05:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-13 21:05:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-13 21:05:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-10-13 21:05:20,805 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-10-13 21:05:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,805 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-10-13 21:05:20,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-10-13 21:05:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:20,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,807 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] [2019-10-13 21:05:20,807 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-10-13 21:05:20,807 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042386682] [2019-10-13 21:05:20,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,835 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,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042386682] [2019-10-13 21:05:20,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351724614] [2019-10-13 21:05:20,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,837 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-10-13 21:05:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,861 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2019-10-13 21:05:20,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,865 INFO L225 Difference]: With dead ends: 620 [2019-10-13 21:05:20,865 INFO L226 Difference]: Without dead ends: 618 [2019-10-13 21:05:20,866 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:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-13 21:05:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-10-13 21:05:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-10-13 21:05:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-10-13 21:05:20,883 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-10-13 21:05:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,883 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-10-13 21:05:20,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-10-13 21:05:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:20,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,885 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] [2019-10-13 21:05:20,885 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-10-13 21:05:20,886 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913683715] [2019-10-13 21:05:20,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,903 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,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913683715] [2019-10-13 21:05:20,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652899625] [2019-10-13 21:05:20,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,906 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-10-13 21:05:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,934 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2019-10-13 21:05:20,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,938 INFO L225 Difference]: With dead ends: 1180 [2019-10-13 21:05:20,938 INFO L226 Difference]: Without dead ends: 682 [2019-10-13 21:05:20,939 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:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-13 21:05:20,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-10-13 21:05:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-10-13 21:05:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-10-13 21:05:20,964 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-10-13 21:05:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,965 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-10-13 21:05:20,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-10-13 21:05:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:20,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,966 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:20,966 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,967 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-10-13 21:05:20,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251321977] [2019-10-13 21:05:20,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,985 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,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251321977] [2019-10-13 21:05:20,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359628307] [2019-10-13 21:05:20,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,988 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-10-13 21:05:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,013 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2019-10-13 21:05:21,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,018 INFO L225 Difference]: With dead ends: 1020 [2019-10-13 21:05:21,018 INFO L226 Difference]: Without dead ends: 698 [2019-10-13 21:05:21,019 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,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-13 21:05:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-10-13 21:05:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-13 21:05:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-10-13 21:05:21,041 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-10-13 21:05:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,042 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-10-13 21:05:21,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-10-13 21:05:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:21,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,044 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:21,044 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-10-13 21:05:21,045 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224514278] [2019-10-13 21:05:21,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,066 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,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224514278] [2019-10-13 21:05:21,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908017209] [2019-10-13 21:05:21,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,069 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-10-13 21:05:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,099 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2019-10-13 21:05:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,105 INFO L225 Difference]: With dead ends: 1164 [2019-10-13 21:05:21,105 INFO L226 Difference]: Without dead ends: 1162 [2019-10-13 21:05:21,106 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,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-10-13 21:05:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-10-13 21:05:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-13 21:05:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-10-13 21:05:21,142 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-10-13 21:05:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,142 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-10-13 21:05:21,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-10-13 21:05:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:21,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,145 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:21,145 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-10-13 21:05:21,146 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557448948] [2019-10-13 21:05:21,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,173 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,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557448948] [2019-10-13 21:05:21,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490617455] [2019-10-13 21:05:21,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,175 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-10-13 21:05:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,226 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2019-10-13 21:05:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,232 INFO L225 Difference]: With dead ends: 2316 [2019-10-13 21:05:21,232 INFO L226 Difference]: Without dead ends: 1322 [2019-10-13 21:05:21,234 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,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-10-13 21:05:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-10-13 21:05:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-10-13 21:05:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-10-13 21:05:21,277 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-10-13 21:05:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,277 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-10-13 21:05:21,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-10-13 21:05:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:21,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,280 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:21,280 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-10-13 21:05:21,280 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489650409] [2019-10-13 21:05:21,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,296 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,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489650409] [2019-10-13 21:05:21,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369528440] [2019-10-13 21:05:21,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,298 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-10-13 21:05:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,331 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2019-10-13 21:05:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,338 INFO L225 Difference]: With dead ends: 1980 [2019-10-13 21:05:21,338 INFO L226 Difference]: Without dead ends: 1354 [2019-10-13 21:05:21,340 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,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-13 21:05:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-10-13 21:05:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-10-13 21:05:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-10-13 21:05:21,382 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-10-13 21:05:21,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,383 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-10-13 21:05:21,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-10-13 21:05:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:21,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,386 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:21,386 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-10-13 21:05:21,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142289826] [2019-10-13 21:05:21,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,407 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,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142289826] [2019-10-13 21:05:21,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474671844] [2019-10-13 21:05:21,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,410 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-10-13 21:05:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,484 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2019-10-13 21:05:21,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,496 INFO L225 Difference]: With dead ends: 2186 [2019-10-13 21:05:21,496 INFO L226 Difference]: Without dead ends: 2184 [2019-10-13 21:05:21,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:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-10-13 21:05:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-10-13 21:05:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-13 21:05:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-10-13 21:05:21,589 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-10-13 21:05:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,589 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-10-13 21:05:21,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-10-13 21:05:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:21,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,595 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:21,595 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-10-13 21:05:21,596 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603311689] [2019-10-13 21:05:21,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,621 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,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603311689] [2019-10-13 21:05:21,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088426472] [2019-10-13 21:05:21,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,625 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-10-13 21:05:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,724 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2019-10-13 21:05:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,725 INFO L225 Difference]: With dead ends: 4552 [2019-10-13 21:05:21,725 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:05:21,733 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,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:05:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:05:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:05:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:05:21,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-13 21:05:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,735 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:05:21,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:05:21,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:05:21,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:05:21,769 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 21:05:21,770 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:21,770 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:21,770 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:05:21,770 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:05:21,771 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:05:21,771 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2019-10-13 21:05:21,771 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-10-13 21:05:21,771 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,771 INFO L446 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-10-13 21:05:21,772 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-10-13 21:05:21,772 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-13 21:05:21,772 INFO L439 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-10-13 21:05:21,772 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2019-10-13 21:05:21,772 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,773 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,773 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,773 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2019-10-13 21:05:21,773 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,773 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-10-13 21:05:21,774 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-13 21:05:21,774 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,774 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,774 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-10-13 21:05:21,775 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-13 21:05:21,776 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-10-13 21:05:21,776 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,776 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,776 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,777 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-10-13 21:05:21,777 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,777 INFO L446 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-10-13 21:05:21,777 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-10-13 21:05:21,777 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,778 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 21:05:21,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:05:21 BoogieIcfgContainer [2019-10-13 21:05:21,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:05:21,798 INFO L168 Benchmark]: Toolchain (without parser) took 3234.86 ms. Allocated memory was 141.6 MB in the beginning and 244.8 MB in the end (delta: 103.3 MB). Free memory was 103.9 MB in the beginning and 103.2 MB in the end (delta: 693.8 kB). Peak memory consumption was 104.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:21,800 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 122.5 MB in the beginning and 122.3 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:21,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.73 ms. Allocated memory was 141.6 MB in the beginning and 201.3 MB in the end (delta: 59.8 MB). Free memory was 103.5 MB in the beginning and 180.7 MB in the end (delta: -77.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:21,803 INFO L168 Benchmark]: Boogie Preprocessor took 36.42 ms. Allocated memory is still 201.3 MB. Free memory was 180.7 MB in the beginning and 178.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:21,810 INFO L168 Benchmark]: RCFGBuilder took 333.72 ms. Allocated memory is still 201.3 MB. Free memory was 178.4 MB in the beginning and 162.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:21,812 INFO L168 Benchmark]: TraceAbstraction took 2539.08 ms. Allocated memory was 201.3 MB in the beginning and 244.8 MB in the end (delta: 43.5 MB). Free memory was 162.5 MB in the beginning and 103.2 MB in the end (delta: 59.2 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:21,821 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.21 ms. Allocated memory is still 141.6 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 320.73 ms. Allocated memory was 141.6 MB in the beginning and 201.3 MB in the end (delta: 59.8 MB). Free memory was 103.5 MB in the beginning and 180.7 MB in the end (delta: -77.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.42 ms. Allocated memory is still 201.3 MB. Free memory was 180.7 MB in the beginning and 178.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 333.72 ms. Allocated memory is still 201.3 MB. Free memory was 178.4 MB in the beginning and 162.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2539.08 ms. Allocated memory was 201.3 MB in the beginning and 244.8 MB in the end (delta: 43.5 MB). Free memory was 162.5 MB in the beginning and 103.2 MB in the end (delta: 59.2 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. Result: SAFE, OverallTime: 2.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...