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+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:12,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:12,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:12,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:12,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:12,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:12,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:12,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:12,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:12,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:12,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:12,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:12,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:12,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:12,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:12,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:12,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:12,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:12,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:12,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:12,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:12,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:12,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:12,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:12,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:12,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:12,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:12,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:12,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:12,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:12,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:12,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:12,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:12,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:12,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:12,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:12,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:12,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:12,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:12,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:12,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:12,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:23:12,746 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:12,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:12,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:12,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:12,748 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:12,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:12,749 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:12,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:12,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:12,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:12,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:12,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:12,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:12,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:12,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:12,750 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:12,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:12,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:12,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:12,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:12,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:12,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:12,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:12,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:12,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:12,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:12,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:12,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:12,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:13,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:13,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:13,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:13,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:13,069 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:13,070 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+sep-reducer.c [2019-10-15 01:23:13,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637b5f4dd/fcce2bd0fd8b421b85506b7f27ae05b5/FLAGab1ab2358 [2019-10-15 01:23:13,943 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:13,945 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+sep-reducer.c [2019-10-15 01:23:13,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637b5f4dd/fcce2bd0fd8b421b85506b7f27ae05b5/FLAGab1ab2358 [2019-10-15 01:23:14,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637b5f4dd/fcce2bd0fd8b421b85506b7f27ae05b5 [2019-10-15 01:23:14,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:14,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:14,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:14,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:14,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:14,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235c31ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14, skipping insertion in model container [2019-10-15 01:23:14,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,070 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:14,220 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:15,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:15,317 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:15,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:15,694 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:15,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15 WrapperNode [2019-10-15 01:23:15,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:15,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:15,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:15,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:15,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:15,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:15,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:15,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:15,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:16,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:16,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:16,085 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:16,092 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:16,092 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:16,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:16,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:19,759 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:19,760 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:19,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:19 BoogieIcfgContainer [2019-10-15 01:23:19,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:19,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:19,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:19,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:19,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:14" (1/3) ... [2019-10-15 01:23:19,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640f1bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:19, skipping insertion in model container [2019-10-15 01:23:19,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (2/3) ... [2019-10-15 01:23:19,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640f1bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:19, skipping insertion in model container [2019-10-15 01:23:19,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:19" (3/3) ... [2019-10-15 01:23:19,784 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 01:23:19,798 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:19,828 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 01:23:19,841 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 01:23:19,890 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:19,891 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:19,891 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:19,891 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:19,891 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:19,891 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:19,892 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:19,892 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states. [2019-10-15 01:23:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:19,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:19,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:19,961 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1212138476, now seen corresponding path program 1 times [2019-10-15 01:23:19,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:19,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714425608] [2019-10-15 01:23:19,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:19,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:19,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:20,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714425608] [2019-10-15 01:23:20,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:20,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:20,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627124350] [2019-10-15 01:23:20,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:20,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:20,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:20,848 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand 6 states. [2019-10-15 01:23:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:22,739 INFO L93 Difference]: Finished difference Result 2390 states and 4093 transitions. [2019-10-15 01:23:22,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:22,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-15 01:23:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:22,771 INFO L225 Difference]: With dead ends: 2390 [2019-10-15 01:23:22,772 INFO L226 Difference]: Without dead ends: 1617 [2019-10-15 01:23:22,780 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-15 01:23:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-10-15 01:23:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1594. [2019-10-15 01:23:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-10-15 01:23:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2070 transitions. [2019-10-15 01:23:22,974 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2070 transitions. Word has length 56 [2019-10-15 01:23:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:22,974 INFO L462 AbstractCegarLoop]: Abstraction has 1594 states and 2070 transitions. [2019-10-15 01:23:22,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2070 transitions. [2019-10-15 01:23:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:22,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:22,983 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-15 01:23:22,983 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:22,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1633149148, now seen corresponding path program 1 times [2019-10-15 01:23:22,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:22,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089422551] [2019-10-15 01:23:22,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:23,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089422551] [2019-10-15 01:23:23,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:23,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:23,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541498256] [2019-10-15 01:23:23,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:23,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:23,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:23,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:23,244 INFO L87 Difference]: Start difference. First operand 1594 states and 2070 transitions. Second operand 6 states. [2019-10-15 01:23:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:24,459 INFO L93 Difference]: Finished difference Result 3490 states and 4654 transitions. [2019-10-15 01:23:24,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:24,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-15 01:23:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:24,472 INFO L225 Difference]: With dead ends: 3490 [2019-10-15 01:23:24,472 INFO L226 Difference]: Without dead ends: 2530 [2019-10-15 01:23:24,476 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-15 01:23:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-10-15 01:23:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2514. [2019-10-15 01:23:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-10-15 01:23:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3354 transitions. [2019-10-15 01:23:24,589 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3354 transitions. Word has length 56 [2019-10-15 01:23:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:24,590 INFO L462 AbstractCegarLoop]: Abstraction has 2514 states and 3354 transitions. [2019-10-15 01:23:24,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3354 transitions. [2019-10-15 01:23:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:24,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:24,594 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-15 01:23:24,594 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:24,595 INFO L82 PathProgramCache]: Analyzing trace with hash -755922083, now seen corresponding path program 1 times [2019-10-15 01:23:24,595 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:24,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821871036] [2019-10-15 01:23:24,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:24,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:24,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:24,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821871036] [2019-10-15 01:23:24,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:24,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:24,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564571954] [2019-10-15 01:23:24,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:24,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:24,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:24,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:24,756 INFO L87 Difference]: Start difference. First operand 2514 states and 3354 transitions. Second operand 5 states. [2019-10-15 01:23:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:26,314 INFO L93 Difference]: Finished difference Result 5219 states and 7042 transitions. [2019-10-15 01:23:26,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:26,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-15 01:23:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:26,346 INFO L225 Difference]: With dead ends: 5219 [2019-10-15 01:23:26,347 INFO L226 Difference]: Without dead ends: 3904 [2019-10-15 01:23:26,353 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-15 01:23:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2019-10-15 01:23:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3898. [2019-10-15 01:23:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-15 01:23:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5174 transitions. [2019-10-15 01:23:26,660 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5174 transitions. Word has length 56 [2019-10-15 01:23:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:26,663 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5174 transitions. [2019-10-15 01:23:26,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5174 transitions. [2019-10-15 01:23:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:26,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:26,670 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-15 01:23:26,671 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:26,672 INFO L82 PathProgramCache]: Analyzing trace with hash -418972447, now seen corresponding path program 1 times [2019-10-15 01:23:26,672 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:26,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598061775] [2019-10-15 01:23:26,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:26,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:26,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:27,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598061775] [2019-10-15 01:23:27,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:27,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:23:27,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969495710] [2019-10-15 01:23:27,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:23:27,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:27,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:23:27,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:27,233 INFO L87 Difference]: Start difference. First operand 3898 states and 5174 transitions. Second operand 8 states. [2019-10-15 01:23:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:30,081 INFO L93 Difference]: Finished difference Result 8917 states and 12719 transitions. [2019-10-15 01:23:30,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:23:30,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-15 01:23:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:30,126 INFO L225 Difference]: With dead ends: 8917 [2019-10-15 01:23:30,127 INFO L226 Difference]: Without dead ends: 7575 [2019-10-15 01:23:30,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:23:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7575 states. [2019-10-15 01:23:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7575 to 3898. [2019-10-15 01:23:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-15 01:23:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5173 transitions. [2019-10-15 01:23:30,432 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5173 transitions. Word has length 58 [2019-10-15 01:23:30,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:30,433 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5173 transitions. [2019-10-15 01:23:30,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:23:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5173 transitions. [2019-10-15 01:23:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:30,437 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:30,438 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:30,438 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:30,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1952539007, now seen corresponding path program 1 times [2019-10-15 01:23:30,439 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:30,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582369574] [2019-10-15 01:23:30,439 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,440 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:30,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582369574] [2019-10-15 01:23:30,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:30,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:30,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398883733] [2019-10-15 01:23:30,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:30,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:30,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:30,703 INFO L87 Difference]: Start difference. First operand 3898 states and 5173 transitions. Second operand 9 states. [2019-10-15 01:23:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:34,009 INFO L93 Difference]: Finished difference Result 8308 states and 11719 transitions. [2019-10-15 01:23:34,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:23:34,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-15 01:23:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:34,055 INFO L225 Difference]: With dead ends: 8308 [2019-10-15 01:23:34,055 INFO L226 Difference]: Without dead ends: 8302 [2019-10-15 01:23:34,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:23:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8302 states. [2019-10-15 01:23:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8302 to 3898. [2019-10-15 01:23:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-15 01:23:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5172 transitions. [2019-10-15 01:23:34,455 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5172 transitions. Word has length 58 [2019-10-15 01:23:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:34,455 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5172 transitions. [2019-10-15 01:23:34,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5172 transitions. [2019-10-15 01:23:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:34,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:34,460 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:34,460 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash -215970595, now seen corresponding path program 1 times [2019-10-15 01:23:34,461 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:34,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734405416] [2019-10-15 01:23:34,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:34,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:34,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:34,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734405416] [2019-10-15 01:23:34,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:34,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:34,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083272892] [2019-10-15 01:23:34,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:34,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:34,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:34,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:34,692 INFO L87 Difference]: Start difference. First operand 3898 states and 5172 transitions. Second operand 9 states. [2019-10-15 01:23:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:37,979 INFO L93 Difference]: Finished difference Result 10341 states and 14551 transitions. [2019-10-15 01:23:37,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:23:37,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-15 01:23:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:38,025 INFO L225 Difference]: With dead ends: 10341 [2019-10-15 01:23:38,026 INFO L226 Difference]: Without dead ends: 9285 [2019-10-15 01:23:38,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:23:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9285 states. [2019-10-15 01:23:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9285 to 3898. [2019-10-15 01:23:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-15 01:23:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5171 transitions. [2019-10-15 01:23:38,359 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5171 transitions. Word has length 58 [2019-10-15 01:23:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:38,360 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5171 transitions. [2019-10-15 01:23:38,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5171 transitions. [2019-10-15 01:23:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:38,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:38,367 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-15 01:23:38,368 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash 834918715, now seen corresponding path program 1 times [2019-10-15 01:23:38,368 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:38,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355734528] [2019-10-15 01:23:38,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:38,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355734528] [2019-10-15 01:23:38,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:38,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:38,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413115681] [2019-10-15 01:23:38,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:38,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:38,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:38,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:38,478 INFO L87 Difference]: Start difference. First operand 3898 states and 5171 transitions. Second operand 3 states. [2019-10-15 01:23:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:38,975 INFO L93 Difference]: Finished difference Result 5770 states and 8000 transitions. [2019-10-15 01:23:38,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:38,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 01:23:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:38,999 INFO L225 Difference]: With dead ends: 5770 [2019-10-15 01:23:38,999 INFO L226 Difference]: Without dead ends: 4287 [2019-10-15 01:23:39,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-10-15 01:23:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3971. [2019-10-15 01:23:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-10-15 01:23:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5314 transitions. [2019-10-15 01:23:39,411 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5314 transitions. Word has length 59 [2019-10-15 01:23:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:39,413 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 5314 transitions. [2019-10-15 01:23:39,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5314 transitions. [2019-10-15 01:23:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:39,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:39,417 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-15 01:23:39,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash 132280932, now seen corresponding path program 1 times [2019-10-15 01:23:39,418 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:39,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431664441] [2019-10-15 01:23:39,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:39,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:39,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:39,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431664441] [2019-10-15 01:23:39,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:39,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:39,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028207810] [2019-10-15 01:23:39,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:39,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:39,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:39,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:39,529 INFO L87 Difference]: Start difference. First operand 3971 states and 5314 transitions. Second operand 3 states. [2019-10-15 01:23:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:40,072 INFO L93 Difference]: Finished difference Result 6729 states and 9451 transitions. [2019-10-15 01:23:40,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:40,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 01:23:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:40,084 INFO L225 Difference]: With dead ends: 6729 [2019-10-15 01:23:40,085 INFO L226 Difference]: Without dead ends: 4943 [2019-10-15 01:23:40,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:40,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2019-10-15 01:23:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 4463. [2019-10-15 01:23:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4463 states. [2019-10-15 01:23:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 6066 transitions. [2019-10-15 01:23:40,551 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 6066 transitions. Word has length 59 [2019-10-15 01:23:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:40,552 INFO L462 AbstractCegarLoop]: Abstraction has 4463 states and 6066 transitions. [2019-10-15 01:23:40,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 6066 transitions. [2019-10-15 01:23:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:40,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:40,555 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-15 01:23:40,556 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1642469980, now seen corresponding path program 1 times [2019-10-15 01:23:40,556 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:40,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051754007] [2019-10-15 01:23:40,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:40,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:40,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:40,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051754007] [2019-10-15 01:23:40,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:40,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:40,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585353104] [2019-10-15 01:23:40,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:40,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:40,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:40,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:40,687 INFO L87 Difference]: Start difference. First operand 4463 states and 6066 transitions. Second operand 3 states. [2019-10-15 01:23:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:41,178 INFO L93 Difference]: Finished difference Result 8919 states and 12582 transitions. [2019-10-15 01:23:41,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:41,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 01:23:41,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:41,196 INFO L225 Difference]: With dead ends: 8919 [2019-10-15 01:23:41,196 INFO L226 Difference]: Without dead ends: 5699 [2019-10-15 01:23:41,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2019-10-15 01:23:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5697. [2019-10-15 01:23:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-10-15 01:23:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7848 transitions. [2019-10-15 01:23:41,807 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7848 transitions. Word has length 59 [2019-10-15 01:23:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:41,807 INFO L462 AbstractCegarLoop]: Abstraction has 5697 states and 7848 transitions. [2019-10-15 01:23:41,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7848 transitions. [2019-10-15 01:23:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:41,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:41,811 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-15 01:23:41,812 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:41,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:41,812 INFO L82 PathProgramCache]: Analyzing trace with hash 11887072, now seen corresponding path program 1 times [2019-10-15 01:23:41,812 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:41,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85025750] [2019-10-15 01:23:41,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:41,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:41,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:41,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85025750] [2019-10-15 01:23:41,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:41,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:41,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098172449] [2019-10-15 01:23:41,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:41,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:41,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:41,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:41,895 INFO L87 Difference]: Start difference. First operand 5697 states and 7848 transitions. Second operand 3 states. [2019-10-15 01:23:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:42,731 INFO L93 Difference]: Finished difference Result 13367 states and 18972 transitions. [2019-10-15 01:23:42,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:42,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:23:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:42,754 INFO L225 Difference]: With dead ends: 13367 [2019-10-15 01:23:42,754 INFO L226 Difference]: Without dead ends: 8543 [2019-10-15 01:23:42,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2019-10-15 01:23:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 6757. [2019-10-15 01:23:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-10-15 01:23:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 9505 transitions. [2019-10-15 01:23:43,376 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 9505 transitions. Word has length 60 [2019-10-15 01:23:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:43,377 INFO L462 AbstractCegarLoop]: Abstraction has 6757 states and 9505 transitions. [2019-10-15 01:23:43,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 9505 transitions. [2019-10-15 01:23:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:43,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:43,379 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-15 01:23:43,380 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:43,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2065078364, now seen corresponding path program 1 times [2019-10-15 01:23:43,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:43,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800977359] [2019-10-15 01:23:43,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:43,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800977359] [2019-10-15 01:23:43,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:43,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:43,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496651230] [2019-10-15 01:23:43,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:43,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:43,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:43,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:43,478 INFO L87 Difference]: Start difference. First operand 6757 states and 9505 transitions. Second operand 3 states.