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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:53,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:53,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:53,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:53,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:53,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:53,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:53,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:53,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:53,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:53,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:53,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:53,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:53,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:53,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:53,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:53,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:53,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:53,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:53,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:53,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:53,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:53,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:53,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:53,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:53,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:53,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:53,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:53,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:53,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:53,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:53,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:53,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:53,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:53,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:53,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:53,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:53,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:53,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:53,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:53,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:53,570 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:23:53,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:53,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:53,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:53,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:53,585 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:53,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:53,585 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:53,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:53,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:53,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:53,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:53,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:53,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:53,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:53,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:53,587 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:53,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:53,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:53,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:53,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:53,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:53,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:53,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:53,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:53,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:53,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:53,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:53,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:53,589 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:23:53,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:53,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:53,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:53,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:53,883 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:53,884 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:53,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d32a9e26/f3a814f6859c4bf6a56c82447bc77e4e/FLAGa6f3d0c76 [2019-10-13 21:23:54,450 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:54,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:54,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d32a9e26/f3a814f6859c4bf6a56c82447bc77e4e/FLAGa6f3d0c76 [2019-10-13 21:23:54,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d32a9e26/f3a814f6859c4bf6a56c82447bc77e4e [2019-10-13 21:23:54,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:54,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:54,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:54,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:54,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:54,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:54" (1/1) ... [2019-10-13 21:23:54,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1a3812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:54, skipping insertion in model container [2019-10-13 21:23:54,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:54" (1/1) ... [2019-10-13 21:23:54,809 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:54,864 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:55,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:55,272 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:55,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:55,389 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:55,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55 WrapperNode [2019-10-13 21:23:55,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:55,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:55,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:55,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:55,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:55,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:55,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:55,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:55,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (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:23:55,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:55,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:55,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:55,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:55,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:55,513 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:55,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:56,270 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:56,270 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:56,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:56 BoogieIcfgContainer [2019-10-13 21:23:56,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:56,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:56,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:56,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:56,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:54" (1/3) ... [2019-10-13 21:23:56,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f825991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:56, skipping insertion in model container [2019-10-13 21:23:56,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (2/3) ... [2019-10-13 21:23:56,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f825991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:56, skipping insertion in model container [2019-10-13 21:23:56,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:56" (3/3) ... [2019-10-13 21:23:56,280 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:56,290 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:56,298 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:23:56,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:23:56,338 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:56,338 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:56,339 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:56,339 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:56,339 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:56,339 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:56,339 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:56,340 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-10-13 21:23:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 21:23:56,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:56,372 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:56,374 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash 273290580, now seen corresponding path program 1 times [2019-10-13 21:23:56,391 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:56,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250905359] [2019-10-13 21:23:56,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:56,933 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:23:56,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250905359] [2019-10-13 21:23:56,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:56,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:23:56,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553536943] [2019-10-13 21:23:56,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:23:56,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:56,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:23:56,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:23:56,964 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 6 states. [2019-10-13 21:23:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:57,399 INFO L93 Difference]: Finished difference Result 731 states and 1151 transitions. [2019-10-13 21:23:57,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:23:57,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-13 21:23:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:57,435 INFO L225 Difference]: With dead ends: 731 [2019-10-13 21:23:57,435 INFO L226 Difference]: Without dead ends: 632 [2019-10-13 21:23:57,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:23:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-13 21:23:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 425. [2019-10-13 21:23:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-13 21:23:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 641 transitions. [2019-10-13 21:23:57,586 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 641 transitions. Word has length 53 [2019-10-13 21:23:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,587 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 641 transitions. [2019-10-13 21:23:57,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:23:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 641 transitions. [2019-10-13 21:23:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:23:57,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:57,592 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1842914518, now seen corresponding path program 1 times [2019-10-13 21:23:57,593 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999613766] [2019-10-13 21:23:57,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:57,721 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:23:57,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999613766] [2019-10-13 21:23:57,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:57,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:57,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059217515] [2019-10-13 21:23:57,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:57,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:57,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:57,727 INFO L87 Difference]: Start difference. First operand 425 states and 641 transitions. Second operand 3 states. [2019-10-13 21:23:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:57,788 INFO L93 Difference]: Finished difference Result 1108 states and 1693 transitions. [2019-10-13 21:23:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:57,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-13 21:23:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:57,793 INFO L225 Difference]: With dead ends: 1108 [2019-10-13 21:23:57,793 INFO L226 Difference]: Without dead ends: 751 [2019-10-13 21:23:57,797 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:23:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-10-13 21:23:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 749. [2019-10-13 21:23:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-13 21:23:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1125 transitions. [2019-10-13 21:23:57,844 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1125 transitions. Word has length 56 [2019-10-13 21:23:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,844 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 1125 transitions. [2019-10-13 21:23:57,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1125 transitions. [2019-10-13 21:23:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:23:57,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,848 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:57,848 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash -315457832, now seen corresponding path program 1 times [2019-10-13 21:23:57,849 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186109386] [2019-10-13 21:23:57,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:57,938 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:23:57,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186109386] [2019-10-13 21:23:57,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:57,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:57,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608353780] [2019-10-13 21:23:57,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:57,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:57,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:57,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:57,941 INFO L87 Difference]: Start difference. First operand 749 states and 1125 transitions. Second operand 3 states. [2019-10-13 21:23:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:58,059 INFO L93 Difference]: Finished difference Result 2012 states and 3038 transitions. [2019-10-13 21:23:58,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:58,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-13 21:23:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:58,067 INFO L225 Difference]: With dead ends: 2012 [2019-10-13 21:23:58,067 INFO L226 Difference]: Without dead ends: 1339 [2019-10-13 21:23:58,069 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:23:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-10-13 21:23:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-10-13 21:23:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-10-13 21:23:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1974 transitions. [2019-10-13 21:23:58,132 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1974 transitions. Word has length 56 [2019-10-13 21:23:58,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:58,132 INFO L462 AbstractCegarLoop]: Abstraction has 1337 states and 1974 transitions. [2019-10-13 21:23:58,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1974 transitions. [2019-10-13 21:23:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:23:58,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:58,135 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:58,136 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:58,136 INFO L82 PathProgramCache]: Analyzing trace with hash -622080838, now seen corresponding path program 1 times [2019-10-13 21:23:58,136 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:58,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882092097] [2019-10-13 21:23:58,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:58,320 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:23:58,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882092097] [2019-10-13 21:23:58,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:58,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:23:58,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162454529] [2019-10-13 21:23:58,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:23:58,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:23:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:23:58,323 INFO L87 Difference]: Start difference. First operand 1337 states and 1974 transitions. Second operand 10 states. [2019-10-13 21:24:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:00,084 INFO L93 Difference]: Finished difference Result 7876 states and 11683 transitions. [2019-10-13 21:24:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:24:00,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-10-13 21:24:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:00,131 INFO L225 Difference]: With dead ends: 7876 [2019-10-13 21:24:00,131 INFO L226 Difference]: Without dead ends: 7375 [2019-10-13 21:24:00,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:24:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7375 states. [2019-10-13 21:24:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7375 to 1362. [2019-10-13 21:24:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-10-13 21:24:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2006 transitions. [2019-10-13 21:24:00,430 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2006 transitions. Word has length 57 [2019-10-13 21:24:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:00,430 INFO L462 AbstractCegarLoop]: Abstraction has 1362 states and 2006 transitions. [2019-10-13 21:24:00,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:24:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2006 transitions. [2019-10-13 21:24:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:00,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:00,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:00,433 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash -993204644, now seen corresponding path program 1 times [2019-10-13 21:24:00,434 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:00,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682021748] [2019-10-13 21:24:00,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:00,559 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:24:00,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682021748] [2019-10-13 21:24:00,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:00,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:00,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594456351] [2019-10-13 21:24:00,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:00,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:00,562 INFO L87 Difference]: Start difference. First operand 1362 states and 2006 transitions. Second operand 9 states. [2019-10-13 21:24:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:02,636 INFO L93 Difference]: Finished difference Result 8646 states and 12825 transitions. [2019-10-13 21:24:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:24:02,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-13 21:24:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:02,672 INFO L225 Difference]: With dead ends: 8646 [2019-10-13 21:24:02,672 INFO L226 Difference]: Without dead ends: 7508 [2019-10-13 21:24:02,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:24:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2019-10-13 21:24:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 1401. [2019-10-13 21:24:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-13 21:24:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2057 transitions. [2019-10-13 21:24:02,896 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2057 transitions. Word has length 58 [2019-10-13 21:24:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:02,897 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 2057 transitions. [2019-10-13 21:24:02,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2057 transitions. [2019-10-13 21:24:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:02,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:02,899 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:02,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1499714113, now seen corresponding path program 1 times [2019-10-13 21:24:02,900 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:02,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466005660] [2019-10-13 21:24:02,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:02,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:24:02,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466005660] [2019-10-13 21:24:02,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:02,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:24:02,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989671492] [2019-10-13 21:24:02,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:24:02,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:02,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:24:02,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:02,989 INFO L87 Difference]: Start difference. First operand 1401 states and 2057 transitions. Second operand 7 states. [2019-10-13 21:24:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:04,067 INFO L93 Difference]: Finished difference Result 5866 states and 8795 transitions. [2019-10-13 21:24:04,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:24:04,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-13 21:24:04,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:04,091 INFO L225 Difference]: With dead ends: 5866 [2019-10-13 21:24:04,093 INFO L226 Difference]: Without dead ends: 5365 [2019-10-13 21:24:04,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:24:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-10-13 21:24:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 1382. [2019-10-13 21:24:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-10-13 21:24:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2033 transitions. [2019-10-13 21:24:04,274 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2033 transitions. Word has length 58 [2019-10-13 21:24:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:04,276 INFO L462 AbstractCegarLoop]: Abstraction has 1382 states and 2033 transitions. [2019-10-13 21:24:04,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:24:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2033 transitions. [2019-10-13 21:24:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:04,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:04,278 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:04,278 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1924616750, now seen corresponding path program 1 times [2019-10-13 21:24:04,279 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:04,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828831309] [2019-10-13 21:24:04,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:04,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:04,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:04,390 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:24:04,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828831309] [2019-10-13 21:24:04,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:04,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:24:04,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832509011] [2019-10-13 21:24:04,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:24:04,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:04,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:24:04,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:04,392 INFO L87 Difference]: Start difference. First operand 1382 states and 2033 transitions. Second operand 7 states. [2019-10-13 21:24:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:05,178 INFO L93 Difference]: Finished difference Result 5664 states and 8377 transitions. [2019-10-13 21:24:05,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:24:05,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-13 21:24:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:05,202 INFO L225 Difference]: With dead ends: 5664 [2019-10-13 21:24:05,202 INFO L226 Difference]: Without dead ends: 4526 [2019-10-13 21:24:05,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:24:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2019-10-13 21:24:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 1363. [2019-10-13 21:24:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-13 21:24:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2006 transitions. [2019-10-13 21:24:05,408 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2006 transitions. Word has length 59 [2019-10-13 21:24:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:05,409 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2006 transitions. [2019-10-13 21:24:05,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:24:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2006 transitions. [2019-10-13 21:24:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:05,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:05,410 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:05,411 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:05,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:05,411 INFO L82 PathProgramCache]: Analyzing trace with hash -157395530, now seen corresponding path program 1 times [2019-10-13 21:24:05,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:05,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402980386] [2019-10-13 21:24:05,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:05,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:05,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:05,525 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:24:05,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402980386] [2019-10-13 21:24:05,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:05,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:05,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293369641] [2019-10-13 21:24:05,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:05,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:05,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:05,527 INFO L87 Difference]: Start difference. First operand 1363 states and 2006 transitions. Second operand 9 states. [2019-10-13 21:24:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:06,737 INFO L93 Difference]: Finished difference Result 7072 states and 10472 transitions. [2019-10-13 21:24:06,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:24:06,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-13 21:24:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:06,752 INFO L225 Difference]: With dead ends: 7072 [2019-10-13 21:24:06,752 INFO L226 Difference]: Without dead ends: 5799 [2019-10-13 21:24:06,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:24:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5799 states. [2019-10-13 21:24:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5799 to 3842. [2019-10-13 21:24:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3842 states. [2019-10-13 21:24:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 5718 transitions. [2019-10-13 21:24:07,236 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 5718 transitions. Word has length 59 [2019-10-13 21:24:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:07,236 INFO L462 AbstractCegarLoop]: Abstraction has 3842 states and 5718 transitions. [2019-10-13 21:24:07,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 5718 transitions. [2019-10-13 21:24:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:07,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:07,239 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:07,239 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:07,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2127126793, now seen corresponding path program 1 times [2019-10-13 21:24:07,239 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:07,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327387488] [2019-10-13 21:24:07,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:07,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:07,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:07,345 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:24:07,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327387488] [2019-10-13 21:24:07,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:07,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:07,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479043165] [2019-10-13 21:24:07,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:07,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:07,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:07,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:07,349 INFO L87 Difference]: Start difference. First operand 3842 states and 5718 transitions. Second operand 9 states. [2019-10-13 21:24:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:09,716 INFO L93 Difference]: Finished difference Result 20312 states and 30202 transitions. [2019-10-13 21:24:09,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:24:09,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-13 21:24:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:09,749 INFO L225 Difference]: With dead ends: 20312 [2019-10-13 21:24:09,750 INFO L226 Difference]: Without dead ends: 16960 [2019-10-13 21:24:09,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:24:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16960 states. [2019-10-13 21:24:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16960 to 11727. [2019-10-13 21:24:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-10-13 21:24:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 17416 transitions. [2019-10-13 21:24:10,937 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 17416 transitions. Word has length 59 [2019-10-13 21:24:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:10,938 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 17416 transitions. [2019-10-13 21:24:10,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 17416 transitions. [2019-10-13 21:24:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:10,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:10,945 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:10,946 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1033600256, now seen corresponding path program 1 times [2019-10-13 21:24:10,946 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:10,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488247927] [2019-10-13 21:24:10,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:10,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:10,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:11,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488247927] [2019-10-13 21:24:11,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:11,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:11,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367496232] [2019-10-13 21:24:11,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:11,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:11,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:11,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:11,016 INFO L87 Difference]: Start difference. First operand 11727 states and 17416 transitions. Second operand 6 states. [2019-10-13 21:24:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:12,508 INFO L93 Difference]: Finished difference Result 23775 states and 35310 transitions. [2019-10-13 21:24:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:12,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-13 21:24:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:12,536 INFO L225 Difference]: With dead ends: 23775 [2019-10-13 21:24:12,536 INFO L226 Difference]: Without dead ends: 12940 [2019-10-13 21:24:12,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2019-10-13 21:24:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 8396. [2019-10-13 21:24:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2019-10-13 21:24:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 12355 transitions. [2019-10-13 21:24:13,492 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 12355 transitions. Word has length 60 [2019-10-13 21:24:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:13,492 INFO L462 AbstractCegarLoop]: Abstraction has 8396 states and 12355 transitions. [2019-10-13 21:24:13,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 12355 transitions. [2019-10-13 21:24:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:13,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:13,499 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:13,499 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:13,500 INFO L82 PathProgramCache]: Analyzing trace with hash -976844717, now seen corresponding path program 1 times [2019-10-13 21:24:13,500 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:13,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092271575] [2019-10-13 21:24:13,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:13,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:13,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:13,578 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:24:13,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092271575] [2019-10-13 21:24:13,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:13,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:13,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853849255] [2019-10-13 21:24:13,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:13,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:13,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:13,580 INFO L87 Difference]: Start difference. First operand 8396 states and 12355 transitions. Second operand 6 states. [2019-10-13 21:24:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:15,027 INFO L93 Difference]: Finished difference Result 20131 states and 29816 transitions. [2019-10-13 21:24:15,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:15,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-13 21:24:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:15,043 INFO L225 Difference]: With dead ends: 20131 [2019-10-13 21:24:15,043 INFO L226 Difference]: Without dead ends: 12331 [2019-10-13 21:24:15,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12331 states. [2019-10-13 21:24:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12331 to 7655. [2019-10-13 21:24:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-10-13 21:24:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11188 transitions. [2019-10-13 21:24:15,887 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11188 transitions. Word has length 60 [2019-10-13 21:24:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:15,887 INFO L462 AbstractCegarLoop]: Abstraction has 7655 states and 11188 transitions. [2019-10-13 21:24:15,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11188 transitions. [2019-10-13 21:24:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:15,889 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:15,889 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:15,889 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1274910523, now seen corresponding path program 1 times [2019-10-13 21:24:15,890 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:15,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699924895] [2019-10-13 21:24:15,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:15,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:15,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:15,946 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:24:15,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699924895] [2019-10-13 21:24:15,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:15,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:15,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447949366] [2019-10-13 21:24:15,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:15,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:15,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:15,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:15,948 INFO L87 Difference]: Start difference. First operand 7655 states and 11188 transitions. Second operand 5 states. [2019-10-13 21:24:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:17,465 INFO L93 Difference]: Finished difference Result 18506 states and 26953 transitions. [2019-10-13 21:24:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:17,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-13 21:24:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:17,480 INFO L225 Difference]: With dead ends: 18506 [2019-10-13 21:24:17,480 INFO L226 Difference]: Without dead ends: 10932 [2019-10-13 21:24:17,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2019-10-13 21:24:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 7655. [2019-10-13 21:24:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-10-13 21:24:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11084 transitions. [2019-10-13 21:24:19,426 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11084 transitions. Word has length 60 [2019-10-13 21:24:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:19,426 INFO L462 AbstractCegarLoop]: Abstraction has 7655 states and 11084 transitions. [2019-10-13 21:24:19,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11084 transitions. [2019-10-13 21:24:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 21:24:19,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:19,428 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:19,428 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1286220475, now seen corresponding path program 1 times [2019-10-13 21:24:19,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:19,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362075593] [2019-10-13 21:24:19,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:19,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:19,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:19,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362075593] [2019-10-13 21:24:19,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:19,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:19,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958960879] [2019-10-13 21:24:19,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:19,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:19,495 INFO L87 Difference]: Start difference. First operand 7655 states and 11084 transitions. Second operand 5 states. [2019-10-13 21:24:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:21,542 INFO L93 Difference]: Finished difference Result 19872 states and 28987 transitions. [2019-10-13 21:24:21,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:21,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-13 21:24:21,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:21,559 INFO L225 Difference]: With dead ends: 19872 [2019-10-13 21:24:21,559 INFO L226 Difference]: Without dead ends: 15928 [2019-10-13 21:24:21,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15928 states. [2019-10-13 21:24:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15928 to 9395. [2019-10-13 21:24:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9395 states. [2019-10-13 21:24:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9395 states to 9395 states and 13659 transitions. [2019-10-13 21:24:22,852 INFO L78 Accepts]: Start accepts. Automaton has 9395 states and 13659 transitions. Word has length 61 [2019-10-13 21:24:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:22,852 INFO L462 AbstractCegarLoop]: Abstraction has 9395 states and 13659 transitions. [2019-10-13 21:24:22,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 9395 states and 13659 transitions. [2019-10-13 21:24:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 21:24:22,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:22,856 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:22,856 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:22,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 740645981, now seen corresponding path program 1 times [2019-10-13 21:24:22,858 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:22,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034992614] [2019-10-13 21:24:22,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:22,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:22,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:22,930 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:24:22,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034992614] [2019-10-13 21:24:22,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:22,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:22,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808362129] [2019-10-13 21:24:22,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:22,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:22,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:22,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:22,932 INFO L87 Difference]: Start difference. First operand 9395 states and 13659 transitions. Second operand 5 states. [2019-10-13 21:24:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:24,889 INFO L93 Difference]: Finished difference Result 21359 states and 31168 transitions. [2019-10-13 21:24:24,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:24,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-13 21:24:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:24,907 INFO L225 Difference]: With dead ends: 21359 [2019-10-13 21:24:24,907 INFO L226 Difference]: Without dead ends: 17415 [2019-10-13 21:24:24,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2019-10-13 21:24:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 11338. [2019-10-13 21:24:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11338 states. [2019-10-13 21:24:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 16529 transitions. [2019-10-13 21:24:26,391 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 16529 transitions. Word has length 61 [2019-10-13 21:24:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:26,391 INFO L462 AbstractCegarLoop]: Abstraction has 11338 states and 16529 transitions. [2019-10-13 21:24:26,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 16529 transitions. [2019-10-13 21:24:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 21:24:26,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:26,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:26,394 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:26,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:26,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1147863087, now seen corresponding path program 1 times [2019-10-13 21:24:26,394 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:26,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430720626] [2019-10-13 21:24:26,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:26,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:26,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:26,436 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:24:26,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430720626] [2019-10-13 21:24:26,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:26,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:26,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687640387] [2019-10-13 21:24:26,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:26,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:26,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:26,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:26,439 INFO L87 Difference]: Start difference. First operand 11338 states and 16529 transitions. Second operand 3 states. [2019-10-13 21:24:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:28,907 INFO L93 Difference]: Finished difference Result 27635 states and 40262 transitions. [2019-10-13 21:24:28,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:28,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-13 21:24:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:28,923 INFO L225 Difference]: With dead ends: 27635 [2019-10-13 21:24:28,923 INFO L226 Difference]: Without dead ends: 16793 [2019-10-13 21:24:28,934 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:24:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2019-10-13 21:24:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 13747. [2019-10-13 21:24:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13747 states. [2019-10-13 21:24:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13747 states to 13747 states and 19699 transitions. [2019-10-13 21:24:31,280 INFO L78 Accepts]: Start accepts. Automaton has 13747 states and 19699 transitions. Word has length 64 [2019-10-13 21:24:31,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:31,280 INFO L462 AbstractCegarLoop]: Abstraction has 13747 states and 19699 transitions. [2019-10-13 21:24:31,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 13747 states and 19699 transitions. [2019-10-13 21:24:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 21:24:31,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:31,283 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:31,283 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2093601519, now seen corresponding path program 1 times [2019-10-13 21:24:31,284 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:31,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134718109] [2019-10-13 21:24:31,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:31,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:31,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:31,355 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:24:31,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134718109] [2019-10-13 21:24:31,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:31,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:24:31,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671638403] [2019-10-13 21:24:31,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:24:31,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:31,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:24:31,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:31,357 INFO L87 Difference]: Start difference. First operand 13747 states and 19699 transitions. Second operand 7 states.