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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:34,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:34,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:34,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:34,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:34,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:34,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:34,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:34,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:34,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:34,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:34,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:34,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:34,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:34,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:34,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:34,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:34,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:34,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:34,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:34,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:34,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:34,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:34,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:34,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:34,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:34,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:34,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:34,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:34,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:34,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:34,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:34,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:34,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:34,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:34,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:34,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:34,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:34,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:34,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:34,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:34,520 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 03:26:34,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:34,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:34,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:34,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:34,544 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:34,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:34,545 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:34,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:34,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:34,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:34,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:34,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:34,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:34,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:34,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:34,548 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:34,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:34,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:34,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:34,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:34,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:34,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:34,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:34,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:34,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:34,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:34,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:34,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:34,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:26:34,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:34,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:34,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:34,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:34,861 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:34,862 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 03:26:34,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de93ca128/7352f5ec0a9a441e8912b700a93a59fe/FLAGe93477e13 [2019-10-15 03:26:35,739 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:35,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 03:26:35,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de93ca128/7352f5ec0a9a441e8912b700a93a59fe/FLAGe93477e13 [2019-10-15 03:26:36,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de93ca128/7352f5ec0a9a441e8912b700a93a59fe [2019-10-15 03:26:36,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:36,267 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:36,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:36,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:36,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:36,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:36" (1/1) ... [2019-10-15 03:26:36,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4262f24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:36, skipping insertion in model container [2019-10-15 03:26:36,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:36" (1/1) ... [2019-10-15 03:26:36,288 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:36,431 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:37,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:37,476 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:37,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:37,831 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:37,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37 WrapperNode [2019-10-15 03:26:37,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:37,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:37,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:37,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:37,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37" (1/1) ... [2019-10-15 03:26:37,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37" (1/1) ... [2019-10-15 03:26:37,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37" (1/1) ... [2019-10-15 03:26:37,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37" (1/1) ... [2019-10-15 03:26:37,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37" (1/1) ... [2019-10-15 03:26:38,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37" (1/1) ... [2019-10-15 03:26:38,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37" (1/1) ... [2019-10-15 03:26:38,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:38,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:38,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:38,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:38,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37" (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 03:26:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 03:26:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:38,153 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:38,153 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:38,154 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:38,154 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:38,154 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:38,155 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:38,155 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:42,591 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:42,592 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:42,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:42 BoogieIcfgContainer [2019-10-15 03:26:42,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:42,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:42,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:42,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:42,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:36" (1/3) ... [2019-10-15 03:26:42,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bbcbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:42, skipping insertion in model container [2019-10-15 03:26:42,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:37" (2/3) ... [2019-10-15 03:26:42,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bbcbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:42, skipping insertion in model container [2019-10-15 03:26:42,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:42" (3/3) ... [2019-10-15 03:26:42,616 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 03:26:42,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:42,650 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 03:26:42,667 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 03:26:42,718 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:42,718 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:42,718 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:42,718 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:42,719 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:42,719 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:42,719 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:42,719 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states. [2019-10-15 03:26:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:42,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:42,832 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] [2019-10-15 03:26:42,835 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:42,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1364126483, now seen corresponding path program 1 times [2019-10-15 03:26:42,858 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:42,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046252189] [2019-10-15 03:26:42,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:43,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046252189] [2019-10-15 03:26:43,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:43,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:43,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457723715] [2019-10-15 03:26:43,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:43,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:43,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:43,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:43,454 INFO L87 Difference]: Start difference. First operand 1182 states. Second operand 5 states. [2019-10-15 03:26:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:45,556 INFO L93 Difference]: Finished difference Result 2270 states and 3974 transitions. [2019-10-15 03:26:45,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:45,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-15 03:26:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:45,582 INFO L225 Difference]: With dead ends: 2270 [2019-10-15 03:26:45,582 INFO L226 Difference]: Without dead ends: 1418 [2019-10-15 03:26:45,592 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 03:26:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-10-15 03:26:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1412. [2019-10-15 03:26:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-10-15 03:26:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1854 transitions. [2019-10-15 03:26:45,745 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1854 transitions. Word has length 54 [2019-10-15 03:26:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:45,746 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 1854 transitions. [2019-10-15 03:26:45,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1854 transitions. [2019-10-15 03:26:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:45,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:45,751 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-15 03:26:45,752 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash -672874759, now seen corresponding path program 1 times [2019-10-15 03:26:45,753 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:45,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016537820] [2019-10-15 03:26:45,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:45,925 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 03:26:45,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016537820] [2019-10-15 03:26:45,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:45,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:45,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11137262] [2019-10-15 03:26:45,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:45,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:45,929 INFO L87 Difference]: Start difference. First operand 1412 states and 1854 transitions. Second operand 6 states. [2019-10-15 03:26:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:47,188 INFO L93 Difference]: Finished difference Result 2943 states and 3905 transitions. [2019-10-15 03:26:47,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:47,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 03:26:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:47,200 INFO L225 Difference]: With dead ends: 2943 [2019-10-15 03:26:47,201 INFO L226 Difference]: Without dead ends: 1976 [2019-10-15 03:26:47,205 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 03:26:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2019-10-15 03:26:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1960. [2019-10-15 03:26:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-10-15 03:26:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2580 transitions. [2019-10-15 03:26:47,292 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2580 transitions. Word has length 55 [2019-10-15 03:26:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:47,292 INFO L462 AbstractCegarLoop]: Abstraction has 1960 states and 2580 transitions. [2019-10-15 03:26:47,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2580 transitions. [2019-10-15 03:26:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:47,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:47,297 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-15 03:26:47,297 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:47,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:47,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1781940792, now seen corresponding path program 1 times [2019-10-15 03:26:47,298 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:47,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756593637] [2019-10-15 03:26:47,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:47,421 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 03:26:47,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756593637] [2019-10-15 03:26:47,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:47,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:47,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766329857] [2019-10-15 03:26:47,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:47,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:47,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:47,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:47,425 INFO L87 Difference]: Start difference. First operand 1960 states and 2580 transitions. Second operand 6 states. [2019-10-15 03:26:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:48,627 INFO L93 Difference]: Finished difference Result 4894 states and 6440 transitions. [2019-10-15 03:26:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:48,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 03:26:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:48,644 INFO L225 Difference]: With dead ends: 4894 [2019-10-15 03:26:48,645 INFO L226 Difference]: Without dead ends: 3588 [2019-10-15 03:26:48,649 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 03:26:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2019-10-15 03:26:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3568. [2019-10-15 03:26:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-10-15 03:26:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4693 transitions. [2019-10-15 03:26:48,801 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4693 transitions. Word has length 55 [2019-10-15 03:26:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:48,802 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4693 transitions. [2019-10-15 03:26:48,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4693 transitions. [2019-10-15 03:26:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:48,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:48,807 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 03:26:48,807 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1568068960, now seen corresponding path program 1 times [2019-10-15 03:26:48,808 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:48,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624177700] [2019-10-15 03:26:48,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:49,010 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 03:26:49,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624177700] [2019-10-15 03:26:49,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:49,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:49,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000153217] [2019-10-15 03:26:49,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:49,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:49,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:49,013 INFO L87 Difference]: Start difference. First operand 3568 states and 4693 transitions. Second operand 9 states. [2019-10-15 03:26:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:52,156 INFO L93 Difference]: Finished difference Result 5331 states and 7146 transitions. [2019-10-15 03:26:52,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:26:52,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-15 03:26:52,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:52,184 INFO L225 Difference]: With dead ends: 5331 [2019-10-15 03:26:52,184 INFO L226 Difference]: Without dead ends: 5326 [2019-10-15 03:26:52,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-10-15 03:26:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5326 states. [2019-10-15 03:26:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5326 to 3568. [2019-10-15 03:26:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-10-15 03:26:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4692 transitions. [2019-10-15 03:26:52,412 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4692 transitions. Word has length 56 [2019-10-15 03:26:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:52,413 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4692 transitions. [2019-10-15 03:26:52,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4692 transitions. [2019-10-15 03:26:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:52,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:52,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] [2019-10-15 03:26:52,418 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash -634470005, now seen corresponding path program 1 times [2019-10-15 03:26:52,419 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:52,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086446768] [2019-10-15 03:26:52,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:52,592 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 03:26:52,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086446768] [2019-10-15 03:26:52,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:52,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:52,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222257499] [2019-10-15 03:26:52,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:52,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:52,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:52,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:52,595 INFO L87 Difference]: Start difference. First operand 3568 states and 4692 transitions. Second operand 9 states. [2019-10-15 03:26:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:56,149 INFO L93 Difference]: Finished difference Result 8465 states and 11375 transitions. [2019-10-15 03:26:56,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:26:56,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-15 03:26:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:56,189 INFO L225 Difference]: With dead ends: 8465 [2019-10-15 03:26:56,189 INFO L226 Difference]: Without dead ends: 8171 [2019-10-15 03:26:56,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:26:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2019-10-15 03:26:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 3568. [2019-10-15 03:26:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-10-15 03:26:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4691 transitions. [2019-10-15 03:26:56,460 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4691 transitions. Word has length 56 [2019-10-15 03:26:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:56,462 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4691 transitions. [2019-10-15 03:26:56,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4691 transitions. [2019-10-15 03:26:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:56,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:56,471 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 03:26:56,471 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2025706282, now seen corresponding path program 1 times [2019-10-15 03:26:56,472 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:56,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393097980] [2019-10-15 03:26:56,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:56,733 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 03:26:56,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393097980] [2019-10-15 03:26:56,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:56,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:26:56,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388669441] [2019-10-15 03:26:56,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:26:56,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:26:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:56,737 INFO L87 Difference]: Start difference. First operand 3568 states and 4691 transitions. Second operand 8 states. [2019-10-15 03:26:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:59,367 INFO L93 Difference]: Finished difference Result 7600 states and 10507 transitions. [2019-10-15 03:26:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:26:59,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-15 03:26:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:59,405 INFO L225 Difference]: With dead ends: 7600 [2019-10-15 03:26:59,405 INFO L226 Difference]: Without dead ends: 6700 [2019-10-15 03:26:59,411 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-15 03:26:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6700 states. [2019-10-15 03:26:59,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6700 to 3568. [2019-10-15 03:26:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-10-15 03:26:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4690 transitions. [2019-10-15 03:26:59,693 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4690 transitions. Word has length 56 [2019-10-15 03:26:59,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:59,693 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4690 transitions. [2019-10-15 03:26:59,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:26:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4690 transitions. [2019-10-15 03:26:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:26:59,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:59,698 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-15 03:26:59,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:59,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:59,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1601603689, now seen corresponding path program 1 times [2019-10-15 03:26:59,699 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:59,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768346212] [2019-10-15 03:26:59,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:59,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:59,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:59,770 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 03:26:59,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768346212] [2019-10-15 03:26:59,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:59,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:59,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70413960] [2019-10-15 03:26:59,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:59,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:59,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:59,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:59,773 INFO L87 Difference]: Start difference. First operand 3568 states and 4690 transitions. Second operand 3 states. [2019-10-15 03:27:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:00,169 INFO L93 Difference]: Finished difference Result 6320 states and 8431 transitions. [2019-10-15 03:27:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:00,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 03:27:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:00,213 INFO L225 Difference]: With dead ends: 6320 [2019-10-15 03:27:00,213 INFO L226 Difference]: Without dead ends: 4323 [2019-10-15 03:27:00,220 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 03:27:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2019-10-15 03:27:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 4317. [2019-10-15 03:27:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2019-10-15 03:27:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5609 transitions. [2019-10-15 03:27:00,444 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5609 transitions. Word has length 57 [2019-10-15 03:27:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:00,444 INFO L462 AbstractCegarLoop]: Abstraction has 4317 states and 5609 transitions. [2019-10-15 03:27:00,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5609 transitions. [2019-10-15 03:27:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:27:00,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:00,450 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-15 03:27:00,450 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash -466438381, now seen corresponding path program 1 times [2019-10-15 03:27:00,451 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:00,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457453756] [2019-10-15 03:27:00,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:00,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:00,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:00,518 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 03:27:00,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457453756] [2019-10-15 03:27:00,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:00,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:00,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108252290] [2019-10-15 03:27:00,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:00,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:00,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:00,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:00,520 INFO L87 Difference]: Start difference. First operand 4317 states and 5609 transitions. Second operand 3 states. [2019-10-15 03:27:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:01,111 INFO L93 Difference]: Finished difference Result 6378 states and 8567 transitions. [2019-10-15 03:27:01,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:01,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 03:27:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:01,123 INFO L225 Difference]: With dead ends: 6378 [2019-10-15 03:27:01,123 INFO L226 Difference]: Without dead ends: 4883 [2019-10-15 03:27:01,128 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 03:27:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-10-15 03:27:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4543. [2019-10-15 03:27:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4543 states. [2019-10-15 03:27:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4543 states to 4543 states and 5970 transitions. [2019-10-15 03:27:01,413 INFO L78 Accepts]: Start accepts. Automaton has 4543 states and 5970 transitions. Word has length 57 [2019-10-15 03:27:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:01,413 INFO L462 AbstractCegarLoop]: Abstraction has 4543 states and 5970 transitions. [2019-10-15 03:27:01,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4543 states and 5970 transitions. [2019-10-15 03:27:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:27:01,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:01,418 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-15 03:27:01,418 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1782949341, now seen corresponding path program 1 times [2019-10-15 03:27:01,419 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:01,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53433951] [2019-10-15 03:27:01,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:01,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:01,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:01,481 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 03:27:01,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53433951] [2019-10-15 03:27:01,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:01,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:01,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934315836] [2019-10-15 03:27:01,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:01,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:01,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:01,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:01,484 INFO L87 Difference]: Start difference. First operand 4543 states and 5970 transitions. Second operand 3 states. [2019-10-15 03:27:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:01,991 INFO L93 Difference]: Finished difference Result 7631 states and 10359 transitions. [2019-10-15 03:27:01,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:01,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 03:27:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:02,003 INFO L225 Difference]: With dead ends: 7631 [2019-10-15 03:27:02,004 INFO L226 Difference]: Without dead ends: 5552 [2019-10-15 03:27:02,010 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 03:27:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5552 states. [2019-10-15 03:27:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5552 to 5052. [2019-10-15 03:27:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5052 states. [2019-10-15 03:27:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 6682 transitions. [2019-10-15 03:27:02,453 INFO L78 Accepts]: Start accepts. Automaton has 5052 states and 6682 transitions. Word has length 57 [2019-10-15 03:27:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:02,453 INFO L462 AbstractCegarLoop]: Abstraction has 5052 states and 6682 transitions. [2019-10-15 03:27:02,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5052 states and 6682 transitions. [2019-10-15 03:27:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:27:02,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:02,458 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 03:27:02,458 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:02,459 INFO L82 PathProgramCache]: Analyzing trace with hash -794875623, now seen corresponding path program 1 times [2019-10-15 03:27:02,459 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:02,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281234702] [2019-10-15 03:27:02,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:02,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:02,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:02,511 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 03:27:02,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281234702] [2019-10-15 03:27:02,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:02,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:02,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825597396] [2019-10-15 03:27:02,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:02,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:02,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:02,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:02,514 INFO L87 Difference]: Start difference. First operand 5052 states and 6682 transitions. Second operand 3 states. [2019-10-15 03:27:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:03,357 INFO L93 Difference]: Finished difference Result 8594 states and 11344 transitions. [2019-10-15 03:27:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:03,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:27:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:03,367 INFO L225 Difference]: With dead ends: 8594 [2019-10-15 03:27:03,367 INFO L226 Difference]: Without dead ends: 4102 [2019-10-15 03:27:03,382 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 03:27:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-10-15 03:27:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3090. [2019-10-15 03:27:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-10-15 03:27:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4001 transitions. [2019-10-15 03:27:03,790 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4001 transitions. Word has length 58 [2019-10-15 03:27:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:03,791 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 4001 transitions. [2019-10-15 03:27:03,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4001 transitions. [2019-10-15 03:27:03,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:27:03,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:03,799 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 03:27:03,799 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:03,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1917578780, now seen corresponding path program 1 times [2019-10-15 03:27:03,800 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:03,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213078635] [2019-10-15 03:27:03,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:03,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:03,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:03,872 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 03:27:03,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213078635] [2019-10-15 03:27:03,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:03,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:03,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291215660] [2019-10-15 03:27:03,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:03,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:03,874 INFO L87 Difference]: Start difference. First operand 3090 states and 4001 transitions. Second operand 3 states. [2019-10-15 03:27:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:04,428 INFO L93 Difference]: Finished difference Result 5306 states and 7007 transitions. [2019-10-15 03:27:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:04,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:27:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:04,436 INFO L225 Difference]: With dead ends: 5306 [2019-10-15 03:27:04,437 INFO L226 Difference]: Without dead ends: 2974 [2019-10-15 03:27:04,444 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 03:27:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2019-10-15 03:27:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2364. [2019-10-15 03:27:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-10-15 03:27:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3039 transitions. [2019-10-15 03:27:04,889 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3039 transitions. Word has length 58 [2019-10-15 03:27:04,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:04,889 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 3039 transitions. [2019-10-15 03:27:04,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3039 transitions. [2019-10-15 03:27:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:27:04,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:04,892 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 03:27:04,892 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:04,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1724765725, now seen corresponding path program 1 times [2019-10-15 03:27:04,893 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:04,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633300550] [2019-10-15 03:27:04,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:04,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:04,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:04,966 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 03:27:04,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633300550] [2019-10-15 03:27:04,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:04,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:04,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130809392] [2019-10-15 03:27:04,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:04,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:04,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:04,971 INFO L87 Difference]: Start difference. First operand 2364 states and 3039 transitions. Second operand 3 states. [2019-10-15 03:27:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:05,526 INFO L93 Difference]: Finished difference Result 5185 states and 6877 transitions. [2019-10-15 03:27:05,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:05,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:27:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:05,535 INFO L225 Difference]: With dead ends: 5185 [2019-10-15 03:27:05,535 INFO L226 Difference]: Without dead ends: 3343 [2019-10-15 03:27:05,541 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 03:27:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2019-10-15 03:27:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 2699. [2019-10-15 03:27:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2019-10-15 03:27:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3550 transitions. [2019-10-15 03:27:05,911 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3550 transitions. Word has length 58 [2019-10-15 03:27:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:05,911 INFO L462 AbstractCegarLoop]: Abstraction has 2699 states and 3550 transitions. [2019-10-15 03:27:05,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3550 transitions. [2019-10-15 03:27:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:27:05,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:05,912 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 03:27:05,912 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:05,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:05,913 INFO L82 PathProgramCache]: Analyzing trace with hash 377672324, now seen corresponding path program 1 times [2019-10-15 03:27:05,913 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:05,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708952450] [2019-10-15 03:27:05,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:05,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:05,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:06,636 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 03:27:06,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708952450] [2019-10-15 03:27:06,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:06,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-15 03:27:06,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225523796] [2019-10-15 03:27:06,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 03:27:06,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 03:27:06,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:27:06,638 INFO L87 Difference]: Start difference. First operand 2699 states and 3550 transitions. Second operand 19 states. [2019-10-15 03:27:06,811 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-15 03:27:07,796 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-15 03:27:08,056 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-15 03:27:08,222 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47