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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:50,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:50,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:50,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:50,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:50,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:50,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:50,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:50,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:50,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:50,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:50,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:50,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:50,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:50,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:50,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:50,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:50,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:50,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:50,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:50,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:50,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:50,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:50,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:50,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:50,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:50,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:50,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:50,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:50,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:50,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:50,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:50,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:50,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:50,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:50,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:50,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:50,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:50,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:50,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:50,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:50,617 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:50,644 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:50,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:50,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:50,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:50,649 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:50,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:50,649 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:50,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:50,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:50,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:50,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:50,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:50,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:50,650 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:50,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:50,651 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:50,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:50,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:50,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:50,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:50,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:50,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:50,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:50,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:50,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:50,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:50,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:50,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:50,657 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:50,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:50,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:50,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:50,984 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:50,984 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:50,985 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 21:23:51,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09abb18e1/dbdb77926c734404989a0da183e98c34/FLAG067007e0f [2019-10-13 21:23:51,757 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:51,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 21:23:51,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09abb18e1/dbdb77926c734404989a0da183e98c34/FLAG067007e0f [2019-10-13 21:23:51,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09abb18e1/dbdb77926c734404989a0da183e98c34 [2019-10-13 21:23:51,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:51,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:51,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:51,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:51,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:51,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:51" (1/1) ... [2019-10-13 21:23:51,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1735b069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:51, skipping insertion in model container [2019-10-13 21:23:51,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:51" (1/1) ... [2019-10-13 21:23:51,910 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:52,060 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:53,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:53,213 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:53,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:53,788 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:53,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:53 WrapperNode [2019-10-13 21:23:53,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:53,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:53,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:53,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:53,807 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:53" (1/1) ... [2019-10-13 21:23:53,808 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:53" (1/1) ... [2019-10-13 21:23:53,884 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:53" (1/1) ... [2019-10-13 21:23:53,886 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:53" (1/1) ... [2019-10-13 21:23:53,980 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:53" (1/1) ... [2019-10-13 21:23:54,022 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:53" (1/1) ... [2019-10-13 21:23:54,044 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:53" (1/1) ... [2019-10-13 21:23:54,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:54,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:54,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:54,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:54,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:53" (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:54,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:23:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:57,535 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:57,536 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:57,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:57 BoogieIcfgContainer [2019-10-13 21:23:57,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:57,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:57,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:57,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:57,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:51" (1/3) ... [2019-10-13 21:23:57,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb76a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:57, skipping insertion in model container [2019-10-13 21:23:57,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:53" (2/3) ... [2019-10-13 21:23:57,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb76a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:57, skipping insertion in model container [2019-10-13 21:23:57,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:57" (3/3) ... [2019-10-13 21:23:57,546 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 21:23:57,556 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:57,567 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 21:23:57,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 21:23:57,616 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:57,616 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:57,616 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:57,616 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:57,617 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:57,617 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:57,617 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:57,617 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-10-13 21:23:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:23:57,679 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,680 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] [2019-10-13 21:23:57,682 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-10-13 21:23:57,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098381158] [2019-10-13 21:23:57,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:58,325 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,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098381158] [2019-10-13 21:23:58,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:58,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:23:58,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066558211] [2019-10-13 21:23:58,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:23:58,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:23:58,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:58,355 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-10-13 21:24:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:00,695 INFO L93 Difference]: Finished difference Result 2483 states and 4339 transitions. [2019-10-13 21:24:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:00,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-13 21:24:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:00,726 INFO L225 Difference]: With dead ends: 2483 [2019-10-13 21:24:00,726 INFO L226 Difference]: Without dead ends: 1562 [2019-10-13 21:24:00,735 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:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-10-13 21:24:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1556. [2019-10-13 21:24:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-10-13 21:24:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2098 transitions. [2019-10-13 21:24:00,931 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2098 transitions. Word has length 55 [2019-10-13 21:24:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:00,932 INFO L462 AbstractCegarLoop]: Abstraction has 1556 states and 2098 transitions. [2019-10-13 21:24:00,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2098 transitions. [2019-10-13 21:24:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:00,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:00,940 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:24:00,941 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:00,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:00,942 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-10-13 21:24:00,942 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:00,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875517604] [2019-10-13 21:24:00,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:01,249 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:01,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875517604] [2019-10-13 21:24:01,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:01,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:01,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026456966] [2019-10-13 21:24:01,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:01,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:01,255 INFO L87 Difference]: Start difference. First operand 1556 states and 2098 transitions. Second operand 6 states. [2019-10-13 21:24:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:02,820 INFO L93 Difference]: Finished difference Result 3394 states and 4672 transitions. [2019-10-13 21:24:02,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:02,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-13 21:24:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:02,835 INFO L225 Difference]: With dead ends: 3394 [2019-10-13 21:24:02,835 INFO L226 Difference]: Without dead ends: 2302 [2019-10-13 21:24:02,840 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:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-10-13 21:24:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2286. [2019-10-13 21:24:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2286 states. [2019-10-13 21:24:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3132 transitions. [2019-10-13 21:24:02,964 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3132 transitions. Word has length 56 [2019-10-13 21:24:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:02,964 INFO L462 AbstractCegarLoop]: Abstraction has 2286 states and 3132 transitions. [2019-10-13 21:24:02,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3132 transitions. [2019-10-13 21:24:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:02,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:02,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,974 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-10-13 21:24:02,975 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:02,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933124700] [2019-10-13 21:24:02,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:03,211 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:03,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933124700] [2019-10-13 21:24:03,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:03,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:03,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804916928] [2019-10-13 21:24:03,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:03,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:03,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:03,222 INFO L87 Difference]: Start difference. First operand 2286 states and 3132 transitions. Second operand 6 states. [2019-10-13 21:24:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:04,938 INFO L93 Difference]: Finished difference Result 5902 states and 8156 transitions. [2019-10-13 21:24:04,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:04,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-13 21:24:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:04,963 INFO L225 Difference]: With dead ends: 5902 [2019-10-13 21:24:04,963 INFO L226 Difference]: Without dead ends: 4341 [2019-10-13 21:24:04,968 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:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2019-10-13 21:24:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4321. [2019-10-13 21:24:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-13 21:24:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5977 transitions. [2019-10-13 21:24:05,185 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5977 transitions. Word has length 56 [2019-10-13 21:24:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:05,186 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5977 transitions. [2019-10-13 21:24:05,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5977 transitions. [2019-10-13 21:24:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:05,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:05,191 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:24:05,192 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:05,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-10-13 21:24:05,193 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:05,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830975192] [2019-10-13 21:24:05,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:05,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:05,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:05,432 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,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830975192] [2019-10-13 21:24:05,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:05,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:05,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760415160] [2019-10-13 21:24:05,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:05,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:05,435 INFO L87 Difference]: Start difference. First operand 4321 states and 5977 transitions. Second operand 9 states. [2019-10-13 21:24:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:09,434 INFO L93 Difference]: Finished difference Result 8366 states and 12155 transitions. [2019-10-13 21:24:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:24:09,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-13 21:24:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:09,491 INFO L225 Difference]: With dead ends: 8366 [2019-10-13 21:24:09,492 INFO L226 Difference]: Without dead ends: 8361 [2019-10-13 21:24:09,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:24:09,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8361 states. [2019-10-13 21:24:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8361 to 4321. [2019-10-13 21:24:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-13 21:24:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5976 transitions. [2019-10-13 21:24:09,825 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5976 transitions. Word has length 57 [2019-10-13 21:24:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:09,826 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5976 transitions. [2019-10-13 21:24:09,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5976 transitions. [2019-10-13 21:24:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:09,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:09,833 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:24:09,833 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:09,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:09,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-10-13 21:24:09,834 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:09,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185935764] [2019-10-13 21:24:09,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:09,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:09,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:10,064 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:10,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185935764] [2019-10-13 21:24:10,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:10,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:10,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973667922] [2019-10-13 21:24:10,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:10,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:10,069 INFO L87 Difference]: Start difference. First operand 4321 states and 5976 transitions. Second operand 9 states. [2019-10-13 21:24:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:14,125 INFO L93 Difference]: Finished difference Result 12184 states and 17666 transitions. [2019-10-13 21:24:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:24:14,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-13 21:24:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:14,192 INFO L225 Difference]: With dead ends: 12184 [2019-10-13 21:24:14,192 INFO L226 Difference]: Without dead ends: 11066 [2019-10-13 21:24:14,200 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-13 21:24:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-10-13 21:24:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4321. [2019-10-13 21:24:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-13 21:24:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5975 transitions. [2019-10-13 21:24:14,547 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5975 transitions. Word has length 57 [2019-10-13 21:24:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:14,547 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5975 transitions. [2019-10-13 21:24:14,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5975 transitions. [2019-10-13 21:24:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:14,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:14,552 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:24:14,553 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:14,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-10-13 21:24:14,553 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:14,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167731973] [2019-10-13 21:24:14,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:14,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:14,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:14,757 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:14,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167731973] [2019-10-13 21:24:14,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:14,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:24:14,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595273515] [2019-10-13 21:24:14,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:24:14,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:14,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:24:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:14,760 INFO L87 Difference]: Start difference. First operand 4321 states and 5975 transitions. Second operand 8 states. [2019-10-13 21:24:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:17,763 INFO L93 Difference]: Finished difference Result 9393 states and 13829 transitions. [2019-10-13 21:24:17,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:24:17,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-13 21:24:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:17,784 INFO L225 Difference]: With dead ends: 9393 [2019-10-13 21:24:17,784 INFO L226 Difference]: Without dead ends: 8067 [2019-10-13 21:24:17,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:24:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-10-13 21:24:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 4321. [2019-10-13 21:24:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-13 21:24:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5974 transitions. [2019-10-13 21:24:18,079 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5974 transitions. Word has length 57 [2019-10-13 21:24:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:18,079 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5974 transitions. [2019-10-13 21:24:18,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:24:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5974 transitions. [2019-10-13 21:24:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:18,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:18,085 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:18,086 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-10-13 21:24:18,086 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:18,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139606478] [2019-10-13 21:24:18,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:18,187 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:18,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139606478] [2019-10-13 21:24:18,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:18,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:18,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487090990] [2019-10-13 21:24:18,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:18,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:18,190 INFO L87 Difference]: Start difference. First operand 4321 states and 5974 transitions. Second operand 3 states. [2019-10-13 21:24:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:18,655 INFO L93 Difference]: Finished difference Result 8351 states and 11768 transitions. [2019-10-13 21:24:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:18,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 21:24:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:18,671 INFO L225 Difference]: With dead ends: 8351 [2019-10-13 21:24:18,671 INFO L226 Difference]: Without dead ends: 5831 [2019-10-13 21:24:18,678 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:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5831 states. [2019-10-13 21:24:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5831 to 5825. [2019-10-13 21:24:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-10-13 21:24:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 7963 transitions. [2019-10-13 21:24:19,090 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 7963 transitions. Word has length 58 [2019-10-13 21:24:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:19,091 INFO L462 AbstractCegarLoop]: Abstraction has 5825 states and 7963 transitions. [2019-10-13 21:24:19,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 7963 transitions. [2019-10-13 21:24:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:19,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:19,097 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:19,097 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-10-13 21:24:19,098 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:19,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728671537] [2019-10-13 21:24:19,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:19,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:19,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:19,169 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,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728671537] [2019-10-13 21:24:19,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:19,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:19,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282169184] [2019-10-13 21:24:19,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:19,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:19,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:19,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:19,171 INFO L87 Difference]: Start difference. First operand 5825 states and 7963 transitions. Second operand 3 states. [2019-10-13 21:24:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:19,689 INFO L93 Difference]: Finished difference Result 9254 states and 13261 transitions. [2019-10-13 21:24:19,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:19,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 21:24:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:19,704 INFO L225 Difference]: With dead ends: 9254 [2019-10-13 21:24:19,704 INFO L226 Difference]: Without dead ends: 6946 [2019-10-13 21:24:19,712 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:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-10-13 21:24:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6354. [2019-10-13 21:24:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6354 states. [2019-10-13 21:24:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 8829 transitions. [2019-10-13 21:24:20,081 INFO L78 Accepts]: Start accepts. Automaton has 6354 states and 8829 transitions. Word has length 58 [2019-10-13 21:24:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:20,081 INFO L462 AbstractCegarLoop]: Abstraction has 6354 states and 8829 transitions. [2019-10-13 21:24:20,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6354 states and 8829 transitions. [2019-10-13 21:24:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:20,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:20,087 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:20,087 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-10-13 21:24:20,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:20,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153363052] [2019-10-13 21:24:20,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:20,157 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:20,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153363052] [2019-10-13 21:24:20,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:20,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:20,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128152688] [2019-10-13 21:24:20,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:20,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:20,159 INFO L87 Difference]: Start difference. First operand 6354 states and 8829 transitions. Second operand 3 states. [2019-10-13 21:24:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:20,901 INFO L93 Difference]: Finished difference Result 11578 states and 16758 transitions. [2019-10-13 21:24:20,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:20,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 21:24:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:20,921 INFO L225 Difference]: With dead ends: 11578 [2019-10-13 21:24:20,921 INFO L226 Difference]: Without dead ends: 8287 [2019-10-13 21:24:20,931 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:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2019-10-13 21:24:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 7385. [2019-10-13 21:24:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7385 states. [2019-10-13 21:24:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 10353 transitions. [2019-10-13 21:24:21,500 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 10353 transitions. Word has length 58 [2019-10-13 21:24:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:21,500 INFO L462 AbstractCegarLoop]: Abstraction has 7385 states and 10353 transitions. [2019-10-13 21:24:21,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 10353 transitions. [2019-10-13 21:24:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:21,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:21,506 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:21,507 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:21,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-10-13 21:24:21,507 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:21,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262742080] [2019-10-13 21:24:21,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:21,588 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:21,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262742080] [2019-10-13 21:24:21,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:21,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:21,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776394026] [2019-10-13 21:24:21,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:21,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:21,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:21,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:21,591 INFO L87 Difference]: Start difference. First operand 7385 states and 10353 transitions. Second operand 3 states.