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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:18,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:18,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:18,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:18,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:18,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:18,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:18,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:18,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:18,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:18,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:18,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:18,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:18,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:18,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:18,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:18,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:18,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:18,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:18,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:18,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:18,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:18,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:18,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:18,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:18,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:18,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:18,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:18,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:18,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:18,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:18,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:18,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:18,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:18,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:18,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:18,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:18,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:18,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:18,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:18,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:18,501 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:05:18,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:18,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:18,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:18,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:18,519 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:18,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:18,519 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:18,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:18,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:18,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:18,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:18,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:18,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:18,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:18,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:18,521 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:18,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:18,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:18,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:18,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:18,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:18,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:18,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:18,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:18,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:18,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:18,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:18,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:18,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:05:18,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:18,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:18,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:18,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:18,817 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:18,818 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-10-13 21:05:18,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/695af492f/1a5ea5b188254d5083b1ed5d59667f0f/FLAG12521e2f7 [2019-10-13 21:05:19,337 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:19,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-10-13 21:05:19,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/695af492f/1a5ea5b188254d5083b1ed5d59667f0f/FLAG12521e2f7 [2019-10-13 21:05:19,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/695af492f/1a5ea5b188254d5083b1ed5d59667f0f [2019-10-13 21:05:19,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:19,716 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:19,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:19,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:19,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:19,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:19" (1/1) ... [2019-10-13 21:05:19,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211aa4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19, skipping insertion in model container [2019-10-13 21:05:19,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:19" (1/1) ... [2019-10-13 21:05:19,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:19,752 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:19,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:19,926 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:19,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:19,974 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:19,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19 WrapperNode [2019-10-13 21:05:19,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:19,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:19,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:19,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:20,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19" (1/1) ... [2019-10-13 21:05:20,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19" (1/1) ... [2019-10-13 21:05:20,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19" (1/1) ... [2019-10-13 21:05:20,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19" (1/1) ... [2019-10-13 21:05:20,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19" (1/1) ... [2019-10-13 21:05:20,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19" (1/1) ... [2019-10-13 21:05:20,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19" (1/1) ... [2019-10-13 21:05:20,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:20,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:20,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:20,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:20,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:20,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:20,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:20,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:05:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:20,440 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:20,441 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:20,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:20 BoogieIcfgContainer [2019-10-13 21:05:20,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:20,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:20,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:20,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:20,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:19" (1/3) ... [2019-10-13 21:05:20,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532e044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:20, skipping insertion in model container [2019-10-13 21:05:20,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:19" (2/3) ... [2019-10-13 21:05:20,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532e044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:20, skipping insertion in model container [2019-10-13 21:05:20,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:20" (3/3) ... [2019-10-13 21:05:20,464 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-10-13 21:05:20,475 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:20,482 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:20,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:20,518 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:20,518 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:20,518 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:20,518 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:20,518 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:20,519 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:20,519 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:20,519 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-13 21:05:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:20,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,549 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:20,550 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,555 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-10-13 21:05:20,563 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462351909] [2019-10-13 21:05:20,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:20,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462351909] [2019-10-13 21:05:20,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839735585] [2019-10-13 21:05:20,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,743 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-13 21:05:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,808 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2019-10-13 21:05:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,820 INFO L225 Difference]: With dead ends: 75 [2019-10-13 21:05:20,820 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 21:05:20,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 21:05:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-10-13 21:05:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 21:05:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-10-13 21:05:20,863 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-10-13 21:05:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,864 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-10-13 21:05:20,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-10-13 21:05:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:20,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,866 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:20,866 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-10-13 21:05:20,867 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56467147] [2019-10-13 21:05:20,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:20,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56467147] [2019-10-13 21:05:20,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431452902] [2019-10-13 21:05:20,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,928 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-10-13 21:05:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,955 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2019-10-13 21:05:20,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,957 INFO L225 Difference]: With dead ends: 97 [2019-10-13 21:05:20,958 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 21:05:20,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 21:05:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-13 21:05:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 21:05:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-10-13 21:05:20,971 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-10-13 21:05:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,971 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-10-13 21:05:20,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-10-13 21:05:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:20,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:20,973 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-10-13 21:05:20,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971977963] [2019-10-13 21:05:20,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971977963] [2019-10-13 21:05:21,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199354916] [2019-10-13 21:05:21,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,030 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-10-13 21:05:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,057 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2019-10-13 21:05:21,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,059 INFO L225 Difference]: With dead ends: 90 [2019-10-13 21:05:21,060 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 21:05:21,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 21:05:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-13 21:05:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 21:05:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-10-13 21:05:21,070 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-10-13 21:05:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,071 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-10-13 21:05:21,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-10-13 21:05:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:21,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,072 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,073 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-10-13 21:05:21,073 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336226445] [2019-10-13 21:05:21,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336226445] [2019-10-13 21:05:21,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204149551] [2019-10-13 21:05:21,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,116 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-10-13 21:05:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,162 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2019-10-13 21:05:21,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,165 INFO L225 Difference]: With dead ends: 112 [2019-10-13 21:05:21,165 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 21:05:21,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 21:05:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-10-13 21:05:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 21:05:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-10-13 21:05:21,184 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-10-13 21:05:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,184 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-10-13 21:05:21,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-10-13 21:05:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:21,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,186 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,186 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-10-13 21:05:21,188 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118648721] [2019-10-13 21:05:21,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118648721] [2019-10-13 21:05:21,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812821920] [2019-10-13 21:05:21,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,239 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-10-13 21:05:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,275 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2019-10-13 21:05:21,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,283 INFO L225 Difference]: With dead ends: 184 [2019-10-13 21:05:21,283 INFO L226 Difference]: Without dead ends: 112 [2019-10-13 21:05:21,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-13 21:05:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-10-13 21:05:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 21:05:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-10-13 21:05:21,310 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-10-13 21:05:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,311 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-10-13 21:05:21,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-10-13 21:05:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:21,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,313 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-10-13 21:05:21,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031734282] [2019-10-13 21:05:21,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031734282] [2019-10-13 21:05:21,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450738556] [2019-10-13 21:05:21,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,381 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-10-13 21:05:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,398 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2019-10-13 21:05:21,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,400 INFO L225 Difference]: With dead ends: 165 [2019-10-13 21:05:21,400 INFO L226 Difference]: Without dead ends: 114 [2019-10-13 21:05:21,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-13 21:05:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-10-13 21:05:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-13 21:05:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-10-13 21:05:21,413 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-10-13 21:05:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,414 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-10-13 21:05:21,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-10-13 21:05:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:21,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,415 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,416 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,416 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-10-13 21:05:21,416 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207612482] [2019-10-13 21:05:21,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207612482] [2019-10-13 21:05:21,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689882218] [2019-10-13 21:05:21,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,456 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-10-13 21:05:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,483 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2019-10-13 21:05:21,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,485 INFO L225 Difference]: With dead ends: 204 [2019-10-13 21:05:21,485 INFO L226 Difference]: Without dead ends: 202 [2019-10-13 21:05:21,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-13 21:05:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-10-13 21:05:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-13 21:05:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-10-13 21:05:21,507 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-10-13 21:05:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,507 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-10-13 21:05:21,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-10-13 21:05:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:21,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,511 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,511 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-10-13 21:05:21,512 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445926243] [2019-10-13 21:05:21,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445926243] [2019-10-13 21:05:21,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649464007] [2019-10-13 21:05:21,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,589 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-10-13 21:05:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,622 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2019-10-13 21:05:21,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,626 INFO L225 Difference]: With dead ends: 352 [2019-10-13 21:05:21,626 INFO L226 Difference]: Without dead ends: 210 [2019-10-13 21:05:21,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-13 21:05:21,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-10-13 21:05:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-13 21:05:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-10-13 21:05:21,650 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-10-13 21:05:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,650 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-10-13 21:05:21,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-10-13 21:05:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:21,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,653 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-10-13 21:05:21,653 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265622798] [2019-10-13 21:05:21,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265622798] [2019-10-13 21:05:21,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092733476] [2019-10-13 21:05:21,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,682 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-10-13 21:05:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,701 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-10-13 21:05:21,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,703 INFO L225 Difference]: With dead ends: 312 [2019-10-13 21:05:21,703 INFO L226 Difference]: Without dead ends: 214 [2019-10-13 21:05:21,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-13 21:05:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-13 21:05:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-10-13 21:05:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-13 21:05:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-10-13 21:05:21,727 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-10-13 21:05:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,728 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-10-13 21:05:21,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-10-13 21:05:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:21,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,729 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,730 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,730 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-10-13 21:05:21,730 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408273747] [2019-10-13 21:05:21,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408273747] [2019-10-13 21:05:21,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995221090] [2019-10-13 21:05:21,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,781 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-10-13 21:05:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,815 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2019-10-13 21:05:21,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,820 INFO L225 Difference]: With dead ends: 380 [2019-10-13 21:05:21,820 INFO L226 Difference]: Without dead ends: 378 [2019-10-13 21:05:21,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-13 21:05:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-10-13 21:05:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-13 21:05:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-10-13 21:05:21,843 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-10-13 21:05:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,843 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-10-13 21:05:21,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-10-13 21:05:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:21,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,851 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,851 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-10-13 21:05:21,852 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866739427] [2019-10-13 21:05:21,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866739427] [2019-10-13 21:05:21,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506889305] [2019-10-13 21:05:21,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,900 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-10-13 21:05:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,933 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2019-10-13 21:05:21,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,937 INFO L225 Difference]: With dead ends: 684 [2019-10-13 21:05:21,937 INFO L226 Difference]: Without dead ends: 402 [2019-10-13 21:05:21,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-10-13 21:05:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-10-13 21:05:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-13 21:05:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-10-13 21:05:21,955 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-10-13 21:05:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:21,956 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-10-13 21:05:21,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-10-13 21:05:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:21,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,960 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-10-13 21:05:21,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29640056] [2019-10-13 21:05:21,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:21,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29640056] [2019-10-13 21:05:21,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389017848] [2019-10-13 21:05:21,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:21,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:21,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:21,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:21,999 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-10-13 21:05:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,026 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2019-10-13 21:05:22,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,029 INFO L225 Difference]: With dead ends: 600 [2019-10-13 21:05:22,030 INFO L226 Difference]: Without dead ends: 410 [2019-10-13 21:05:22,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-13 21:05:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-10-13 21:05:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-13 21:05:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-10-13 21:05:22,043 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-10-13 21:05:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,045 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-10-13 21:05:22,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-10-13 21:05:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:22,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,047 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,047 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-10-13 21:05:22,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715781269] [2019-10-13 21:05:22,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:22,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715781269] [2019-10-13 21:05:22,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171368898] [2019-10-13 21:05:22,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,083 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-10-13 21:05:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,103 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2019-10-13 21:05:22,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,107 INFO L225 Difference]: With dead ends: 716 [2019-10-13 21:05:22,107 INFO L226 Difference]: Without dead ends: 714 [2019-10-13 21:05:22,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-13 21:05:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-10-13 21:05:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:05:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-10-13 21:05:22,127 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-10-13 21:05:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,127 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-10-13 21:05:22,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-10-13 21:05:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:22,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,129 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,129 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-10-13 21:05:22,130 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335369820] [2019-10-13 21:05:22,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:22,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335369820] [2019-10-13 21:05:22,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672843376] [2019-10-13 21:05:22,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,152 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-10-13 21:05:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,178 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2019-10-13 21:05:22,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:22,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,183 INFO L225 Difference]: With dead ends: 1340 [2019-10-13 21:05:22,183 INFO L226 Difference]: Without dead ends: 778 [2019-10-13 21:05:22,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-10-13 21:05:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-10-13 21:05:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-13 21:05:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-10-13 21:05:22,208 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-10-13 21:05:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,208 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-10-13 21:05:22,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-10-13 21:05:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:22,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,210 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,210 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-10-13 21:05:22,211 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755389642] [2019-10-13 21:05:22,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:22,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755389642] [2019-10-13 21:05:22,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723010630] [2019-10-13 21:05:22,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,236 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-10-13 21:05:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,262 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2019-10-13 21:05:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,266 INFO L225 Difference]: With dead ends: 1164 [2019-10-13 21:05:22,267 INFO L226 Difference]: Without dead ends: 794 [2019-10-13 21:05:22,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-10-13 21:05:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-10-13 21:05:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-10-13 21:05:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-10-13 21:05:22,297 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-10-13 21:05:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,297 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-10-13 21:05:22,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-10-13 21:05:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:22,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,300 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-10-13 21:05:22,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485213252] [2019-10-13 21:05:22,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:22,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485213252] [2019-10-13 21:05:22,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246402081] [2019-10-13 21:05:22,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,337 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-10-13 21:05:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,372 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2019-10-13 21:05:22,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:22,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,379 INFO L225 Difference]: With dead ends: 1356 [2019-10-13 21:05:22,379 INFO L226 Difference]: Without dead ends: 1354 [2019-10-13 21:05:22,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-13 21:05:22,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-10-13 21:05:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-10-13 21:05:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-10-13 21:05:22,434 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-10-13 21:05:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,435 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-10-13 21:05:22,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-10-13 21:05:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:22,437 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,438 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,438 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-10-13 21:05:22,438 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813350736] [2019-10-13 21:05:22,439 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,439 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:22,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813350736] [2019-10-13 21:05:22,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485570302] [2019-10-13 21:05:22,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,457 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-10-13 21:05:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,495 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2019-10-13 21:05:22,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,503 INFO L225 Difference]: With dead ends: 2636 [2019-10-13 21:05:22,503 INFO L226 Difference]: Without dead ends: 1514 [2019-10-13 21:05:22,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-10-13 21:05:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-10-13 21:05:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-10-13 21:05:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-10-13 21:05:22,576 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-10-13 21:05:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,576 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-10-13 21:05:22,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-10-13 21:05:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:22,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,580 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,580 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-10-13 21:05:22,581 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438714261] [2019-10-13 21:05:22,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:22,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438714261] [2019-10-13 21:05:22,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864068297] [2019-10-13 21:05:22,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,606 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-10-13 21:05:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,663 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2019-10-13 21:05:22,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,673 INFO L225 Difference]: With dead ends: 2268 [2019-10-13 21:05:22,673 INFO L226 Difference]: Without dead ends: 1546 [2019-10-13 21:05:22,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-13 21:05:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-10-13 21:05:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-13 21:05:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-10-13 21:05:22,745 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-10-13 21:05:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,746 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-10-13 21:05:22,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-10-13 21:05:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:22,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,749 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,749 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-10-13 21:05:22,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315128232] [2019-10-13 21:05:22,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:22,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315128232] [2019-10-13 21:05:22,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560786743] [2019-10-13 21:05:22,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,774 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-10-13 21:05:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,849 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2019-10-13 21:05:22,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,866 INFO L225 Difference]: With dead ends: 2572 [2019-10-13 21:05:22,866 INFO L226 Difference]: Without dead ends: 2570 [2019-10-13 21:05:22,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-10-13 21:05:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-10-13 21:05:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-13 21:05:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-10-13 21:05:22,961 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-10-13 21:05:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,962 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-10-13 21:05:22,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-10-13 21:05:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:22,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,966 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,966 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-10-13 21:05:22,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468054878] [2019-10-13 21:05:22,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:22,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468054878] [2019-10-13 21:05:22,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504310300] [2019-10-13 21:05:22,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,988 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-10-13 21:05:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,088 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2019-10-13 21:05:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,100 INFO L225 Difference]: With dead ends: 5196 [2019-10-13 21:05:23,100 INFO L226 Difference]: Without dead ends: 2954 [2019-10-13 21:05:23,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-13 21:05:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-10-13 21:05:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-10-13 21:05:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-10-13 21:05:23,190 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-10-13 21:05:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,190 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-10-13 21:05:23,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-10-13 21:05:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:23,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:23,195 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-10-13 21:05:23,196 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652495054] [2019-10-13 21:05:23,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:23,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652495054] [2019-10-13 21:05:23,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077659241] [2019-10-13 21:05:23,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,227 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-10-13 21:05:23,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,285 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2019-10-13 21:05:23,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,298 INFO L225 Difference]: With dead ends: 4428 [2019-10-13 21:05:23,298 INFO L226 Difference]: Without dead ends: 3018 [2019-10-13 21:05:23,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-10-13 21:05:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-10-13 21:05:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-10-13 21:05:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-10-13 21:05:23,389 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-10-13 21:05:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,389 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-10-13 21:05:23,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-10-13 21:05:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:23,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,394 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:23,394 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,395 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-10-13 21:05:23,395 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074770499] [2019-10-13 21:05:23,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:23,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074770499] [2019-10-13 21:05:23,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82863719] [2019-10-13 21:05:23,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,416 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-10-13 21:05:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,543 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2019-10-13 21:05:23,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,557 INFO L225 Difference]: With dead ends: 8650 [2019-10-13 21:05:23,557 INFO L226 Difference]: Without dead ends: 3016 [2019-10-13 21:05:23,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-10-13 21:05:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-10-13 21:05:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-10-13 21:05:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-10-13 21:05:23,648 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-10-13 21:05:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,648 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-10-13 21:05:23,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-10-13 21:05:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:23,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,653 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:23,653 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,654 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-10-13 21:05:23,654 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019412277] [2019-10-13 21:05:23,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:23,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019412277] [2019-10-13 21:05:23,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432751517] [2019-10-13 21:05:23,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,670 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-10-13 21:05:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,712 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2019-10-13 21:05:23,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,713 INFO L225 Difference]: With dead ends: 3016 [2019-10-13 21:05:23,713 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:05:23,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:05:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:05:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:05:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:05:23,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-13 21:05:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,719 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:05:23,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:05:23,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:05:23,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:05:23,741 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 21:05:23,741 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:23,741 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:23,741 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:05:23,741 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:05:23,741 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:05:23,741 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-10-13 21:05:23,742 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-13 21:05:23,742 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-10-13 21:05:23,742 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,742 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2019-10-13 21:05:23,742 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,742 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-13 21:05:23,742 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,742 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,742 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2019-10-13 21:05:23,743 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-13 21:05:23,743 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2019-10-13 21:05:23,743 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-13 21:05:23,743 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,743 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,743 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,743 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,743 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-10-13 21:05:23,743 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,744 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-13 21:05:23,744 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-10-13 21:05:23,744 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,744 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,744 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-13 21:05:23,745 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-10-13 21:05:23,746 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,746 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-10-13 21:05:23,746 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,746 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,746 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-10-13 21:05:23,746 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-10-13 21:05:23,746 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-10-13 21:05:23,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:05:23 BoogieIcfgContainer [2019-10-13 21:05:23,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:05:23,759 INFO L168 Benchmark]: Toolchain (without parser) took 4041.16 ms. Allocated memory was 145.8 MB in the beginning and 287.3 MB in the end (delta: 141.6 MB). Free memory was 103.8 MB in the beginning and 184.0 MB in the end (delta: -80.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:23,760 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:05:23,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.23 ms. Allocated memory is still 145.8 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:23,768 INFO L168 Benchmark]: Boogie Preprocessor took 125.42 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 93.2 MB in the beginning and 181.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:23,768 INFO L168 Benchmark]: RCFGBuilder took 339.80 ms. Allocated memory is still 202.9 MB. Free memory was 180.7 MB in the beginning and 163.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:23,769 INFO L168 Benchmark]: TraceAbstraction took 3311.80 ms. Allocated memory was 202.9 MB in the beginning and 287.3 MB in the end (delta: 84.4 MB). Free memory was 163.6 MB in the beginning and 184.0 MB in the end (delta: -20.4 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:23,772 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 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.23 ms. Allocated memory is still 145.8 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.42 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 93.2 MB in the beginning and 181.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 339.80 ms. Allocated memory is still 202.9 MB. Free memory was 180.7 MB in the beginning and 163.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3311.80 ms. Allocated memory was 202.9 MB in the beginning and 287.3 MB in the end (delta: 84.4 MB). Free memory was 163.6 MB in the beginning and 184.0 MB in the end (delta: -20.4 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 3.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...