java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:04:11,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:11,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:11,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:11,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:11,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:11,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:11,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:11,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:11,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:11,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:11,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:11,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:11,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:11,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:11,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:11,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:11,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:11,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:11,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:11,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:11,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:11,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:11,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:11,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:11,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:11,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:11,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:11,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:11,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:11,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:11,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:11,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:11,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:11,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:11,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:11,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:11,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:11,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:11,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:11,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:11,947 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-15 01:04:11,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:11,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:11,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:11,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:11,970 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:11,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:11,970 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:11,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:11,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:11,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:11,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:11,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:11,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:11,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:11,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:11,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:11,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:11,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:11,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:11,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:11,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:11,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:11,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:11,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:11,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:11,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:11,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:11,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:11,976 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-15 01:04:12,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:12,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:12,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:12,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:12,321 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:12,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-10-15 01:04:12,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16d73db6/4b468b774f664d55a210ef1bd3773a17/FLAG6dc386f79 [2019-10-15 01:04:12,865 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:12,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-10-15 01:04:12,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16d73db6/4b468b774f664d55a210ef1bd3773a17/FLAG6dc386f79 [2019-10-15 01:04:13,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16d73db6/4b468b774f664d55a210ef1bd3773a17 [2019-10-15 01:04:13,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:13,256 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:13,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:13,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:13,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:13,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:13" (1/1) ... [2019-10-15 01:04:13,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f51de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13, skipping insertion in model container [2019-10-15 01:04:13,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:13" (1/1) ... [2019-10-15 01:04:13,273 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:13,304 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:13,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:13,565 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:13,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:13,688 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:13,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13 WrapperNode [2019-10-15 01:04:13,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:13,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:13,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:13,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:13,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (1/1) ... [2019-10-15 01:04:13,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (1/1) ... [2019-10-15 01:04:13,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (1/1) ... [2019-10-15 01:04:13,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (1/1) ... [2019-10-15 01:04:13,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (1/1) ... [2019-10-15 01:04:13,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (1/1) ... [2019-10-15 01:04:13,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (1/1) ... [2019-10-15 01:04:13,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:13,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:13,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:13,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:13,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (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-15 01:04:13,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:13,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:13,792 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:14,205 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:14,205 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:14,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:14 BoogieIcfgContainer [2019-10-15 01:04:14,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:14,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:14,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:14,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:14,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:13" (1/3) ... [2019-10-15 01:04:14,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5105d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:14, skipping insertion in model container [2019-10-15 01:04:14,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:13" (2/3) ... [2019-10-15 01:04:14,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5105d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:14, skipping insertion in model container [2019-10-15 01:04:14,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:14" (3/3) ... [2019-10-15 01:04:14,219 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-10-15 01:04:14,229 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:14,244 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:14,255 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:14,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:14,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:14,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:14,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:14,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:14,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:14,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:14,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-10-15 01:04:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:14,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,308 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-15 01:04:14,310 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2019-10-15 01:04:14,323 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651934448] [2019-10-15 01:04:14,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,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-15 01:04:14,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651934448] [2019-10-15 01:04:14,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688903248] [2019-10-15 01:04:14,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,598 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-10-15 01:04:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,659 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2019-10-15 01:04:14,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,676 INFO L225 Difference]: With dead ends: 99 [2019-10-15 01:04:14,676 INFO L226 Difference]: Without dead ends: 84 [2019-10-15 01:04:14,680 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-15 01:04:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-15 01:04:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-10-15 01:04:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-15 01:04:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2019-10-15 01:04:14,728 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2019-10-15 01:04:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,729 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2019-10-15 01:04:14,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2019-10-15 01:04:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:14,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,730 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-15 01:04:14,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2019-10-15 01:04:14,732 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023171126] [2019-10-15 01:04:14,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,804 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-15 01:04:14,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023171126] [2019-10-15 01:04:14,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602525154] [2019-10-15 01:04:14,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,809 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2019-10-15 01:04:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:14,872 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2019-10-15 01:04:14,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:14,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:14,877 INFO L225 Difference]: With dead ends: 137 [2019-10-15 01:04:14,877 INFO L226 Difference]: Without dead ends: 84 [2019-10-15 01:04:14,879 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-15 01:04:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-15 01:04:14,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-15 01:04:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-15 01:04:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2019-10-15 01:04:14,891 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2019-10-15 01:04:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:14,892 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2019-10-15 01:04:14,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2019-10-15 01:04:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:14,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:14,894 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-15 01:04:14,894 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2019-10-15 01:04:14,895 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:14,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375479535] [2019-10-15 01:04:14,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:14,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:14,963 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-15 01:04:14,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375479535] [2019-10-15 01:04:14,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:14,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:14,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280819744] [2019-10-15 01:04:14,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:14,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:14,966 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2019-10-15 01:04:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,012 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2019-10-15 01:04:15,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,015 INFO L225 Difference]: With dead ends: 126 [2019-10-15 01:04:15,015 INFO L226 Difference]: Without dead ends: 87 [2019-10-15 01:04:15,016 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-15 01:04:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-15 01:04:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-15 01:04:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-15 01:04:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2019-10-15 01:04:15,036 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2019-10-15 01:04:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,037 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2019-10-15 01:04:15,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2019-10-15 01:04:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:15,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,039 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-15 01:04:15,039 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2019-10-15 01:04:15,040 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511720038] [2019-10-15 01:04:15,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,103 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-15 01:04:15,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511720038] [2019-10-15 01:04:15,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152732102] [2019-10-15 01:04:15,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,108 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2019-10-15 01:04:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,140 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2019-10-15 01:04:15,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,143 INFO L225 Difference]: With dead ends: 160 [2019-10-15 01:04:15,143 INFO L226 Difference]: Without dead ends: 158 [2019-10-15 01:04:15,144 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-15 01:04:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-15 01:04:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2019-10-15 01:04:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-15 01:04:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2019-10-15 01:04:15,171 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2019-10-15 01:04:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,171 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2019-10-15 01:04:15,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2019-10-15 01:04:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:15,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,174 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-15 01:04:15,174 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,175 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2019-10-15 01:04:15,175 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709537067] [2019-10-15 01:04:15,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,240 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-15 01:04:15,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709537067] [2019-10-15 01:04:15,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197017260] [2019-10-15 01:04:15,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,242 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2019-10-15 01:04:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,268 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2019-10-15 01:04:15,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,271 INFO L225 Difference]: With dead ends: 264 [2019-10-15 01:04:15,271 INFO L226 Difference]: Without dead ends: 160 [2019-10-15 01:04:15,273 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-15 01:04:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-15 01:04:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-10-15 01:04:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-15 01:04:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2019-10-15 01:04:15,287 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2019-10-15 01:04:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,288 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2019-10-15 01:04:15,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2019-10-15 01:04:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:15,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,290 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,290 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2019-10-15 01:04:15,291 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739502002] [2019-10-15 01:04:15,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,328 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-15 01:04:15,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739502002] [2019-10-15 01:04:15,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223496523] [2019-10-15 01:04:15,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,331 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2019-10-15 01:04:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,353 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2019-10-15 01:04:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,355 INFO L225 Difference]: With dead ends: 237 [2019-10-15 01:04:15,356 INFO L226 Difference]: Without dead ends: 162 [2019-10-15 01:04:15,357 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-15 01:04:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-15 01:04:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-15 01:04:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-15 01:04:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2019-10-15 01:04:15,368 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2019-10-15 01:04:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,369 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2019-10-15 01:04:15,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2019-10-15 01:04:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:15,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,371 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,371 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,372 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2019-10-15 01:04:15,372 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367611763] [2019-10-15 01:04:15,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,410 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-15 01:04:15,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367611763] [2019-10-15 01:04:15,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779802310] [2019-10-15 01:04:15,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,413 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2019-10-15 01:04:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,445 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2019-10-15 01:04:15,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,448 INFO L225 Difference]: With dead ends: 300 [2019-10-15 01:04:15,448 INFO L226 Difference]: Without dead ends: 298 [2019-10-15 01:04:15,449 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-15 01:04:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-15 01:04:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2019-10-15 01:04:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-15 01:04:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-10-15 01:04:15,461 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2019-10-15 01:04:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,462 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-10-15 01:04:15,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-10-15 01:04:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:15,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,466 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2019-10-15 01:04:15,467 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260850580] [2019-10-15 01:04:15,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,541 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-15 01:04:15,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260850580] [2019-10-15 01:04:15,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800911882] [2019-10-15 01:04:15,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,544 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-10-15 01:04:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,576 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2019-10-15 01:04:15,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,581 INFO L225 Difference]: With dead ends: 512 [2019-10-15 01:04:15,581 INFO L226 Difference]: Without dead ends: 306 [2019-10-15 01:04:15,582 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-15 01:04:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-15 01:04:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-15 01:04:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-15 01:04:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2019-10-15 01:04:15,603 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2019-10-15 01:04:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,604 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2019-10-15 01:04:15,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2019-10-15 01:04:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:15,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,610 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,610 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2019-10-15 01:04:15,611 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239150632] [2019-10-15 01:04:15,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,667 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-15 01:04:15,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239150632] [2019-10-15 01:04:15,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697560785] [2019-10-15 01:04:15,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,671 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2019-10-15 01:04:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,700 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2019-10-15 01:04:15,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,703 INFO L225 Difference]: With dead ends: 456 [2019-10-15 01:04:15,703 INFO L226 Difference]: Without dead ends: 310 [2019-10-15 01:04:15,704 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-15 01:04:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-15 01:04:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-10-15 01:04:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-15 01:04:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2019-10-15 01:04:15,719 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2019-10-15 01:04:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,721 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2019-10-15 01:04:15,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2019-10-15 01:04:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:15,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,723 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,723 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,723 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2019-10-15 01:04:15,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156511013] [2019-10-15 01:04:15,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,773 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-15 01:04:15,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156511013] [2019-10-15 01:04:15,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60314824] [2019-10-15 01:04:15,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,781 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2019-10-15 01:04:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,812 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2019-10-15 01:04:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,818 INFO L225 Difference]: With dead ends: 572 [2019-10-15 01:04:15,818 INFO L226 Difference]: Without dead ends: 570 [2019-10-15 01:04:15,819 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-15 01:04:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-15 01:04:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2019-10-15 01:04:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-10-15 01:04:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2019-10-15 01:04:15,834 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2019-10-15 01:04:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,835 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2019-10-15 01:04:15,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2019-10-15 01:04:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:15,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,839 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,840 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2019-10-15 01:04:15,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157746522] [2019-10-15 01:04:15,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,887 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-15 01:04:15,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157746522] [2019-10-15 01:04:15,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214387588] [2019-10-15 01:04:15,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,890 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2019-10-15 01:04:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:15,930 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2019-10-15 01:04:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:15,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:15,935 INFO L225 Difference]: With dead ends: 1004 [2019-10-15 01:04:15,936 INFO L226 Difference]: Without dead ends: 594 [2019-10-15 01:04:15,938 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-15 01:04:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-15 01:04:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2019-10-15 01:04:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-15 01:04:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2019-10-15 01:04:15,965 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2019-10-15 01:04:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:15,965 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2019-10-15 01:04:15,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2019-10-15 01:04:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:15,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,967 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,968 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2019-10-15 01:04:15,968 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787622959] [2019-10-15 01:04:15,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,007 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-15 01:04:16,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787622959] [2019-10-15 01:04:16,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705860041] [2019-10-15 01:04:16,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,009 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2019-10-15 01:04:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,034 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2019-10-15 01:04:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,039 INFO L225 Difference]: With dead ends: 888 [2019-10-15 01:04:16,039 INFO L226 Difference]: Without dead ends: 602 [2019-10-15 01:04:16,040 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-15 01:04:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-15 01:04:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-10-15 01:04:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-15 01:04:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2019-10-15 01:04:16,059 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2019-10-15 01:04:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,059 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2019-10-15 01:04:16,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2019-10-15 01:04:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:16,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,061 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,061 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2019-10-15 01:04:16,062 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122553284] [2019-10-15 01:04:16,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,092 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-15 01:04:16,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122553284] [2019-10-15 01:04:16,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543112406] [2019-10-15 01:04:16,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,095 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2019-10-15 01:04:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,131 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2019-10-15 01:04:16,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,143 INFO L225 Difference]: With dead ends: 1100 [2019-10-15 01:04:16,143 INFO L226 Difference]: Without dead ends: 1098 [2019-10-15 01:04:16,144 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-15 01:04:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-10-15 01:04:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2019-10-15 01:04:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-10-15 01:04:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2019-10-15 01:04:16,172 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2019-10-15 01:04:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,173 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2019-10-15 01:04:16,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2019-10-15 01:04:16,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:16,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,175 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,175 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2019-10-15 01:04:16,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599234068] [2019-10-15 01:04:16,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,205 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-15 01:04:16,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599234068] [2019-10-15 01:04:16,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105501715] [2019-10-15 01:04:16,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,208 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2019-10-15 01:04:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,246 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2019-10-15 01:04:16,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,255 INFO L225 Difference]: With dead ends: 1980 [2019-10-15 01:04:16,255 INFO L226 Difference]: Without dead ends: 1162 [2019-10-15 01:04:16,259 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-15 01:04:16,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-10-15 01:04:16,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2019-10-15 01:04:16,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-10-15 01:04:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2019-10-15 01:04:16,303 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2019-10-15 01:04:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,305 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2019-10-15 01:04:16,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2019-10-15 01:04:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,309 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2019-10-15 01:04:16,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653964347] [2019-10-15 01:04:16,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,339 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-15 01:04:16,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653964347] [2019-10-15 01:04:16,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460853935] [2019-10-15 01:04:16,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,342 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2019-10-15 01:04:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,376 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2019-10-15 01:04:16,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,383 INFO L225 Difference]: With dead ends: 1740 [2019-10-15 01:04:16,383 INFO L226 Difference]: Without dead ends: 1178 [2019-10-15 01:04:16,387 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-15 01:04:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-10-15 01:04:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2019-10-15 01:04:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-10-15 01:04:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2019-10-15 01:04:16,438 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2019-10-15 01:04:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,439 INFO L462 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2019-10-15 01:04:16,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2019-10-15 01:04:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,441 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2019-10-15 01:04:16,442 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635568978] [2019-10-15 01:04:16,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,462 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-15 01:04:16,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635568978] [2019-10-15 01:04:16,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205049295] [2019-10-15 01:04:16,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,467 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2019-10-15 01:04:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,508 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2019-10-15 01:04:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,520 INFO L225 Difference]: With dead ends: 2124 [2019-10-15 01:04:16,520 INFO L226 Difference]: Without dead ends: 2122 [2019-10-15 01:04:16,522 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-15 01:04:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-10-15 01:04:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2019-10-15 01:04:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-10-15 01:04:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2019-10-15 01:04:16,571 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2019-10-15 01:04:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,571 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2019-10-15 01:04:16,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2019-10-15 01:04:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:16,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,575 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,575 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2019-10-15 01:04:16,576 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470368195] [2019-10-15 01:04:16,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,610 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-15 01:04:16,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470368195] [2019-10-15 01:04:16,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138620375] [2019-10-15 01:04:16,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,613 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2019-10-15 01:04:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,668 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2019-10-15 01:04:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,680 INFO L225 Difference]: With dead ends: 3916 [2019-10-15 01:04:16,680 INFO L226 Difference]: Without dead ends: 2282 [2019-10-15 01:04:16,685 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-15 01:04:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-10-15 01:04:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2019-10-15 01:04:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-10-15 01:04:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2019-10-15 01:04:16,756 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2019-10-15 01:04:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,756 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2019-10-15 01:04:16,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2019-10-15 01:04:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:16,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,762 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,763 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2019-10-15 01:04:16,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47514823] [2019-10-15 01:04:16,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,797 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-15 01:04:16,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47514823] [2019-10-15 01:04:16,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154798981] [2019-10-15 01:04:16,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,800 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2019-10-15 01:04:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,867 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2019-10-15 01:04:16,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,882 INFO L225 Difference]: With dead ends: 3420 [2019-10-15 01:04:16,882 INFO L226 Difference]: Without dead ends: 2314 [2019-10-15 01:04:16,886 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-15 01:04:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-10-15 01:04:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2019-10-15 01:04:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-15 01:04:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2019-10-15 01:04:16,984 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2019-10-15 01:04:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,985 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2019-10-15 01:04:16,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2019-10-15 01:04:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:16,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,991 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,991 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2019-10-15 01:04:16,992 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807476566] [2019-10-15 01:04:16,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,014 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-15 01:04:17,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807476566] [2019-10-15 01:04:17,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215789599] [2019-10-15 01:04:17,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,019 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2019-10-15 01:04:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,105 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2019-10-15 01:04:17,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,134 INFO L225 Difference]: With dead ends: 4108 [2019-10-15 01:04:17,134 INFO L226 Difference]: Without dead ends: 4106 [2019-10-15 01:04:17,137 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-15 01:04:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-10-15 01:04:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2019-10-15 01:04:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-10-15 01:04:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2019-10-15 01:04:17,283 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2019-10-15 01:04:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,284 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2019-10-15 01:04:17,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2019-10-15 01:04:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:04:17,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,291 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,291 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2019-10-15 01:04:17,292 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931794986] [2019-10-15 01:04:17,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,322 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-15 01:04:17,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931794986] [2019-10-15 01:04:17,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166019551] [2019-10-15 01:04:17,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,325 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2019-10-15 01:04:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,419 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2019-10-15 01:04:17,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:04:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,442 INFO L225 Difference]: With dead ends: 7756 [2019-10-15 01:04:17,442 INFO L226 Difference]: Without dead ends: 4490 [2019-10-15 01:04:17,450 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-15 01:04:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-10-15 01:04:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2019-10-15 01:04:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2019-10-15 01:04:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2019-10-15 01:04:17,587 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2019-10-15 01:04:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,588 INFO L462 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2019-10-15 01:04:17,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2019-10-15 01:04:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:17,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,596 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,596 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,597 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2019-10-15 01:04:17,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304342732] [2019-10-15 01:04:17,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,617 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-15 01:04:17,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304342732] [2019-10-15 01:04:17,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190854144] [2019-10-15 01:04:17,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,619 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2019-10-15 01:04:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,703 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2019-10-15 01:04:17,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,738 INFO L225 Difference]: With dead ends: 6732 [2019-10-15 01:04:17,739 INFO L226 Difference]: Without dead ends: 4554 [2019-10-15 01:04:17,747 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-15 01:04:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-10-15 01:04:17,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2019-10-15 01:04:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-10-15 01:04:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2019-10-15 01:04:17,907 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2019-10-15 01:04:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,907 INFO L462 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2019-10-15 01:04:17,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2019-10-15 01:04:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:17,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,914 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,914 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2019-10-15 01:04:17,915 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714949316] [2019-10-15 01:04:17,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,940 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-15 01:04:17,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714949316] [2019-10-15 01:04:17,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438154211] [2019-10-15 01:04:17,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,943 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2019-10-15 01:04:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,090 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2019-10-15 01:04:18,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,115 INFO L225 Difference]: With dead ends: 13260 [2019-10-15 01:04:18,115 INFO L226 Difference]: Without dead ends: 8842 [2019-10-15 01:04:18,127 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-15 01:04:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2019-10-15 01:04:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2019-10-15 01:04:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-10-15 01:04:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2019-10-15 01:04:18,368 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2019-10-15 01:04:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:18,369 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2019-10-15 01:04:18,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2019-10-15 01:04:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:04:18,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:18,381 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:18,382 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2019-10-15 01:04:18,383 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:18,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390919054] [2019-10-15 01:04:18,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:18,406 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-15 01:04:18,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390919054] [2019-10-15 01:04:18,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:18,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:18,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110239532] [2019-10-15 01:04:18,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:18,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:18,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,409 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2019-10-15 01:04:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:18,613 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2019-10-15 01:04:18,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:18,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:04:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:18,634 INFO L225 Difference]: With dead ends: 10124 [2019-10-15 01:04:18,634 INFO L226 Difference]: Without dead ends: 10122 [2019-10-15 01:04:18,637 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-15 01:04:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2019-10-15 01:04:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2019-10-15 01:04:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-10-15 01:04:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2019-10-15 01:04:18,858 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2019-10-15 01:04:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:18,858 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2019-10-15 01:04:18,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2019-10-15 01:04:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:04:18,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:18,870 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:18,871 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:18,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2019-10-15 01:04:18,871 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:18,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207969192] [2019-10-15 01:04:18,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:18,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:18,893 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-15 01:04:18,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207969192] [2019-10-15 01:04:18,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:18,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:18,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429181763] [2019-10-15 01:04:18,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:18,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:18,895 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2019-10-15 01:04:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:19,052 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2019-10-15 01:04:19,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:19,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:04:19,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:19,083 INFO L225 Difference]: With dead ends: 15244 [2019-10-15 01:04:19,083 INFO L226 Difference]: Without dead ends: 15242 [2019-10-15 01:04:19,091 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-15 01:04:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2019-10-15 01:04:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2019-10-15 01:04:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-10-15 01:04:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2019-10-15 01:04:19,440 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2019-10-15 01:04:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:19,440 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2019-10-15 01:04:19,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2019-10-15 01:04:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:04:19,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:19,461 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:19,461 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:19,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:19,462 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2019-10-15 01:04:19,462 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:19,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436227032] [2019-10-15 01:04:19,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:19,483 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-15 01:04:19,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436227032] [2019-10-15 01:04:19,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:19,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:19,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782954725] [2019-10-15 01:04:19,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:19,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:19,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:19,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:19,487 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2019-10-15 01:04:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:19,681 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2019-10-15 01:04:19,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:19,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:04:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:19,716 INFO L225 Difference]: With dead ends: 30348 [2019-10-15 01:04:19,717 INFO L226 Difference]: Without dead ends: 17290 [2019-10-15 01:04:19,746 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-15 01:04:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-10-15 01:04:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2019-10-15 01:04:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2019-10-15 01:04:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2019-10-15 01:04:20,644 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2019-10-15 01:04:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,645 INFO L462 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2019-10-15 01:04:20,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2019-10-15 01:04:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:04:20,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,666 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,666 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2019-10-15 01:04:20,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985497987] [2019-10-15 01:04:20,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,688 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-15 01:04:20,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985497987] [2019-10-15 01:04:20,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411192915] [2019-10-15 01:04:20,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,693 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2019-10-15 01:04:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,880 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2019-10-15 01:04:20,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:04:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,919 INFO L225 Difference]: With dead ends: 26124 [2019-10-15 01:04:20,920 INFO L226 Difference]: Without dead ends: 17674 [2019-10-15 01:04:20,943 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-15 01:04:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2019-10-15 01:04:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2019-10-15 01:04:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2019-10-15 01:04:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2019-10-15 01:04:21,385 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2019-10-15 01:04:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,385 INFO L462 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2019-10-15 01:04:21,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2019-10-15 01:04:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:04:21,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,406 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:21,407 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2019-10-15 01:04:21,407 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660786508] [2019-10-15 01:04:21,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,428 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-15 01:04:21,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660786508] [2019-10-15 01:04:21,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472570424] [2019-10-15 01:04:21,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,430 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2019-10-15 01:04:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,714 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2019-10-15 01:04:21,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:04:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,779 INFO L225 Difference]: With dead ends: 29708 [2019-10-15 01:04:21,779 INFO L226 Difference]: Without dead ends: 29706 [2019-10-15 01:04:21,791 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-15 01:04:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2019-10-15 01:04:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2019-10-15 01:04:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-10-15 01:04:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2019-10-15 01:04:22,576 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2019-10-15 01:04:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,576 INFO L462 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2019-10-15 01:04:22,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2019-10-15 01:04:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:04:22,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,624 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,624 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2019-10-15 01:04:22,625 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655813654] [2019-10-15 01:04:22,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,649 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-15 01:04:22,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655813654] [2019-10-15 01:04:22,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435446660] [2019-10-15 01:04:22,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,651 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2019-10-15 01:04:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,003 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2019-10-15 01:04:23,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:04:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,093 INFO L225 Difference]: With dead ends: 60428 [2019-10-15 01:04:23,094 INFO L226 Difference]: Without dead ends: 34314 [2019-10-15 01:04:23,168 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-15 01:04:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2019-10-15 01:04:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2019-10-15 01:04:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2019-10-15 01:04:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2019-10-15 01:04:24,925 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2019-10-15 01:04:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,925 INFO L462 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2019-10-15 01:04:24,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2019-10-15 01:04:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:04:24,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:24,958 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2019-10-15 01:04:24,959 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834915298] [2019-10-15 01:04:24,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,987 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-15 01:04:24,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834915298] [2019-10-15 01:04:24,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358521544] [2019-10-15 01:04:24,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,989 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2019-10-15 01:04:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:25,379 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2019-10-15 01:04:25,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:25,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 01:04:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:25,436 INFO L225 Difference]: With dead ends: 51468 [2019-10-15 01:04:25,436 INFO L226 Difference]: Without dead ends: 34826 [2019-10-15 01:04:25,470 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-15 01:04:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2019-10-15 01:04:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2019-10-15 01:04:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2019-10-15 01:04:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2019-10-15 01:04:26,403 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2019-10-15 01:04:26,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:26,403 INFO L462 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2019-10-15 01:04:26,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2019-10-15 01:04:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:04:26,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:26,427 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:26,427 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2019-10-15 01:04:26,428 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:26,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472789853] [2019-10-15 01:04:26,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:26,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:26,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:26,452 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-15 01:04:26,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472789853] [2019-10-15 01:04:26,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:26,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:26,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69340491] [2019-10-15 01:04:26,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:26,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:26,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:26,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:26,455 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2019-10-15 01:04:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:27,386 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2019-10-15 01:04:27,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:27,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 01:04:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:27,481 INFO L225 Difference]: With dead ends: 57356 [2019-10-15 01:04:27,481 INFO L226 Difference]: Without dead ends: 57354 [2019-10-15 01:04:27,493 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-15 01:04:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2019-10-15 01:04:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2019-10-15 01:04:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2019-10-15 01:04:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2019-10-15 01:04:28,476 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2019-10-15 01:04:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:28,477 INFO L462 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2019-10-15 01:04:28,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2019-10-15 01:04:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:04:28,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:28,521 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:28,522 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:28,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:28,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2019-10-15 01:04:28,522 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:28,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613001204] [2019-10-15 01:04:28,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:28,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:28,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:28,542 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-15 01:04:28,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613001204] [2019-10-15 01:04:28,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:28,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:28,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210379315] [2019-10-15 01:04:28,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:28,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:28,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:28,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:28,545 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2019-10-15 01:04:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:29,438 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2019-10-15 01:04:29,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:29,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 01:04:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:29,508 INFO L225 Difference]: With dead ends: 119820 [2019-10-15 01:04:29,508 INFO L226 Difference]: Without dead ends: 67594 [2019-10-15 01:04:29,550 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-15 01:04:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2019-10-15 01:04:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2019-10-15 01:04:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2019-10-15 01:04:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2019-10-15 01:04:31,962 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2019-10-15 01:04:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:31,962 INFO L462 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2019-10-15 01:04:31,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2019-10-15 01:04:32,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:04:32,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:32,004 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:32,004 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2019-10-15 01:04:32,005 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:32,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732162019] [2019-10-15 01:04:32,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:32,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:32,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:32,030 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-15 01:04:32,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732162019] [2019-10-15 01:04:32,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:32,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:32,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559924719] [2019-10-15 01:04:32,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:32,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:32,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:32,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:32,032 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2019-10-15 01:04:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:32,571 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2019-10-15 01:04:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:32,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-15 01:04:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:32,645 INFO L225 Difference]: With dead ends: 101388 [2019-10-15 01:04:32,645 INFO L226 Difference]: Without dead ends: 68618 [2019-10-15 01:04:32,683 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-15 01:04:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2019-10-15 01:04:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2019-10-15 01:04:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2019-10-15 01:04:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2019-10-15 01:04:33,916 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2019-10-15 01:04:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:33,916 INFO L462 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2019-10-15 01:04:33,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2019-10-15 01:04:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:04:33,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:33,945 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:33,945 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2019-10-15 01:04:33,945 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:33,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852527706] [2019-10-15 01:04:33,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:33,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:33,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:33,969 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-15 01:04:33,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852527706] [2019-10-15 01:04:33,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:33,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:33,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50323179] [2019-10-15 01:04:33,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:33,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:33,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:33,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:33,970 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2019-10-15 01:04:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:35,074 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2019-10-15 01:04:35,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:35,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-15 01:04:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:35,185 INFO L225 Difference]: With dead ends: 110602 [2019-10-15 01:04:35,185 INFO L226 Difference]: Without dead ends: 110600 [2019-10-15 01:04:35,201 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-15 01:04:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2019-10-15 01:04:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2019-10-15 01:04:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2019-10-15 01:04:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2019-10-15 01:04:38,910 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2019-10-15 01:04:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:38,911 INFO L462 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2019-10-15 01:04:38,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2019-10-15 01:04:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:04:38,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:38,978 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:38,979 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2019-10-15 01:04:38,979 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:38,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209221774] [2019-10-15 01:04:38,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:38,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:38,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:39,002 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-15 01:04:39,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209221774] [2019-10-15 01:04:39,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:39,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:39,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992402807] [2019-10-15 01:04:39,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:39,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:39,004 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2019-10-15 01:04:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:39,984 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2019-10-15 01:04:39,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:39,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-15 01:04:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:39,985 INFO L225 Difference]: With dead ends: 237576 [2019-10-15 01:04:39,985 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:04:40,138 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-15 01:04:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:04:40,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:04:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:04:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:04:40,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-15 01:04:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:40,139 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:04:40,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:04:40,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:04:40,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:04:40,180 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:04:40,180 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:40,180 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:40,180 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:04:40,180 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:04:40,180 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:04:40,180 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,180 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2019-10-15 01:04:40,181 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,181 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,181 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-15 01:04:40,181 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-15 01:04:40,181 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-10-15 01:04:40,181 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,181 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,181 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,181 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,182 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2019-10-15 01:04:40,182 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-15 01:04:40,182 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,182 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-15 01:04:40,182 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,182 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2019-10-15 01:04:40,182 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-10-15 01:04:40,182 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-10-15 01:04:40,183 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,183 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,183 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-10-15 01:04:40,183 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,183 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,183 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-10-15 01:04:40,183 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-15 01:04:40,183 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,183 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,184 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-10-15 01:04:40,184 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-15 01:04:40,184 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-15 01:04:40,184 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-10-15 01:04:40,184 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-10-15 01:04:40,184 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,184 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,184 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,185 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,185 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,185 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,185 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,185 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-15 01:04:40,185 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-10-15 01:04:40,185 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-10-15 01:04:40,185 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-10-15 01:04:40,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:40 BoogieIcfgContainer [2019-10-15 01:04:40,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:40,197 INFO L168 Benchmark]: Toolchain (without parser) took 26940.60 ms. Allocated memory was 135.3 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 99.7 MB in the beginning and 720.5 MB in the end (delta: -620.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-10-15 01:04:40,198 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:04:40,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.29 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 178.0 MB in the end (delta: -78.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:40,199 INFO L168 Benchmark]: Boogie Preprocessor took 38.53 ms. Allocated memory is still 199.2 MB. Free memory was 178.0 MB in the beginning and 175.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:40,199 INFO L168 Benchmark]: RCFGBuilder took 478.41 ms. Allocated memory is still 199.2 MB. Free memory was 175.8 MB in the beginning and 155.0 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:40,200 INFO L168 Benchmark]: TraceAbstraction took 25986.66 ms. Allocated memory was 199.2 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 154.3 MB in the beginning and 720.5 MB in the end (delta: -566.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-10-15 01:04:40,202 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 135.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 432.29 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 178.0 MB in the end (delta: -78.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.53 ms. Allocated memory is still 199.2 MB. Free memory was 178.0 MB in the beginning and 175.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 478.41 ms. Allocated memory is still 199.2 MB. Free memory was 175.8 MB in the beginning and 155.0 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25986.66 ms. Allocated memory was 199.2 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 154.3 MB in the beginning and 720.5 MB in the end (delta: -566.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. Result: SAFE, OverallTime: 25.9s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...