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.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:33,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:33,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:33,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:33,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:33,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:33,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:33,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:33,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:33,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:33,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:33,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:33,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:33,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:33,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:33,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:33,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:33,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:33,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:33,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:33,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:33,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:33,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:33,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:33,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:33,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:33,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:33,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:33,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:33,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:33,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:33,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:33,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:33,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:33,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:33,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:33,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:33,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:33,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:33,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:33,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:33,055 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:33,069 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:33,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:33,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:33,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:33,073 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:33,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:33,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:33,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:33,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:33,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:33,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:33,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:33,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:33,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:33,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:33,075 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:33,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:33,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:33,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:33,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:33,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:33,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:33,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:33,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:33,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:33,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:33,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:33,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:33,079 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:33,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:33,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:33,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:33,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:33,421 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:33,422 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 03:26:33,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3a9dc0a/f91b7b30ffdf4d78b25aa91cd69387b6/FLAGa4dacf093 [2019-10-15 03:26:34,174 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:34,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 03:26:34,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3a9dc0a/f91b7b30ffdf4d78b25aa91cd69387b6/FLAGa4dacf093 [2019-10-15 03:26:34,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3a9dc0a/f91b7b30ffdf4d78b25aa91cd69387b6 [2019-10-15 03:26:34,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:34,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:34,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:34,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:34,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:34,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:34" (1/1) ... [2019-10-15 03:26:34,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795d070c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:34, skipping insertion in model container [2019-10-15 03:26:34,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:34" (1/1) ... [2019-10-15 03:26:34,350 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:34,501 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:35,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:35,627 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:35,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:36,014 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:36,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:36 WrapperNode [2019-10-15 03:26:36,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:36,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:36,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:36,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:36,036 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:36" (1/1) ... [2019-10-15 03:26:36,037 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:36" (1/1) ... [2019-10-15 03:26:36,095 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:36" (1/1) ... [2019-10-15 03:26:36,095 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:36" (1/1) ... [2019-10-15 03:26:36,181 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:36" (1/1) ... [2019-10-15 03:26:36,232 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:36" (1/1) ... [2019-10-15 03:26:36,252 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:36" (1/1) ... [2019-10-15 03:26:36,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:36,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:36,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:36,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:36,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:36" (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:36,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:36,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:36,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 03:26:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:40,090 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:40,091 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:40,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:40 BoogieIcfgContainer [2019-10-15 03:26:40,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:40,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:40,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:40,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:40,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:34" (1/3) ... [2019-10-15 03:26:40,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cccdada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:40, skipping insertion in model container [2019-10-15 03:26:40,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:36" (2/3) ... [2019-10-15 03:26:40,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cccdada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:40, skipping insertion in model container [2019-10-15 03:26:40,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:40" (3/3) ... [2019-10-15 03:26:40,109 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 03:26:40,124 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:40,140 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 03:26:40,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 03:26:40,216 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:40,217 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:40,217 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:40,217 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:40,217 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:40,218 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:40,218 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:40,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states. [2019-10-15 03:26:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:40,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:40,323 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:40,325 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:40,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1351038029, now seen corresponding path program 1 times [2019-10-15 03:26:40,348 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:40,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816913677] [2019-10-15 03:26:40,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:40,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:40,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:41,061 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:41,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816913677] [2019-10-15 03:26:41,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:41,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:41,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215738022] [2019-10-15 03:26:41,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:41,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:41,086 INFO L87 Difference]: Start difference. First operand 1059 states. Second operand 6 states. [2019-10-15 03:26:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:42,677 INFO L93 Difference]: Finished difference Result 1893 states and 3327 transitions. [2019-10-15 03:26:42,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:42,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-15 03:26:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:42,703 INFO L225 Difference]: With dead ends: 1893 [2019-10-15 03:26:42,703 INFO L226 Difference]: Without dead ends: 1259 [2019-10-15 03:26:42,710 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:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2019-10-15 03:26:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1243. [2019-10-15 03:26:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-10-15 03:26:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1619 transitions. [2019-10-15 03:26:42,828 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1619 transitions. Word has length 54 [2019-10-15 03:26:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:42,829 INFO L462 AbstractCegarLoop]: Abstraction has 1243 states and 1619 transitions. [2019-10-15 03:26:42,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1619 transitions. [2019-10-15 03:26:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:42,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:42,834 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,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:42,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1856787906, now seen corresponding path program 1 times [2019-10-15 03:26:42,835 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:42,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607867820] [2019-10-15 03:26:42,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:43,013 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,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607867820] [2019-10-15 03:26:43,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:43,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:43,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161187270] [2019-10-15 03:26:43,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:43,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:43,017 INFO L87 Difference]: Start difference. First operand 1243 states and 1619 transitions. Second operand 6 states. [2019-10-15 03:26:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:44,187 INFO L93 Difference]: Finished difference Result 2807 states and 3684 transitions. [2019-10-15 03:26:44,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:44,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-15 03:26:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:44,203 INFO L225 Difference]: With dead ends: 2807 [2019-10-15 03:26:44,204 INFO L226 Difference]: Without dead ends: 1946 [2019-10-15 03:26:44,207 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:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2019-10-15 03:26:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1926. [2019-10-15 03:26:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-10-15 03:26:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2520 transitions. [2019-10-15 03:26:44,288 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2520 transitions. Word has length 54 [2019-10-15 03:26:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:44,289 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 2520 transitions. [2019-10-15 03:26:44,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2520 transitions. [2019-10-15 03:26:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:44,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:44,293 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:44,293 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash -333312361, now seen corresponding path program 1 times [2019-10-15 03:26:44,294 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:44,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998353071] [2019-10-15 03:26:44,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:44,412 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:44,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998353071] [2019-10-15 03:26:44,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:44,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:44,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255298335] [2019-10-15 03:26:44,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:44,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:44,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:44,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:44,416 INFO L87 Difference]: Start difference. First operand 1926 states and 2520 transitions. Second operand 5 states. [2019-10-15 03:26:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:45,714 INFO L93 Difference]: Finished difference Result 3860 states and 5085 transitions. [2019-10-15 03:26:45,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:45,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-15 03:26:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:45,729 INFO L225 Difference]: With dead ends: 3860 [2019-10-15 03:26:45,729 INFO L226 Difference]: Without dead ends: 2906 [2019-10-15 03:26:45,732 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,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2019-10-15 03:26:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2900. [2019-10-15 03:26:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-10-15 03:26:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3760 transitions. [2019-10-15 03:26:45,866 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3760 transitions. Word has length 54 [2019-10-15 03:26:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:45,867 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3760 transitions. [2019-10-15 03:26:45,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3760 transitions. [2019-10-15 03:26:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:45,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:45,872 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,872 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1049417886, now seen corresponding path program 1 times [2019-10-15 03:26:45,874 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:45,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457212536] [2019-10-15 03:26:45,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:46,201 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:46,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457212536] [2019-10-15 03:26:46,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:46,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:46,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065670621] [2019-10-15 03:26:46,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:46,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:46,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:46,204 INFO L87 Difference]: Start difference. First operand 2900 states and 3760 transitions. Second operand 9 states. [2019-10-15 03:26:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:49,103 INFO L93 Difference]: Finished difference Result 4761 states and 6326 transitions. [2019-10-15 03:26:49,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:26:49,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 03:26:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:49,128 INFO L225 Difference]: With dead ends: 4761 [2019-10-15 03:26:49,128 INFO L226 Difference]: Without dead ends: 4756 [2019-10-15 03:26:49,130 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:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2019-10-15 03:26:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 2900. [2019-10-15 03:26:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-10-15 03:26:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3759 transitions. [2019-10-15 03:26:49,376 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3759 transitions. Word has length 55 [2019-10-15 03:26:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:49,377 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3759 transitions. [2019-10-15 03:26:49,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3759 transitions. [2019-10-15 03:26:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:49,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:49,382 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:49,382 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash -757116331, now seen corresponding path program 1 times [2019-10-15 03:26:49,383 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:49,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875738598] [2019-10-15 03:26:49,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:49,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:49,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:49,600 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,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875738598] [2019-10-15 03:26:49,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:49,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:49,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106177486] [2019-10-15 03:26:49,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:49,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:49,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:49,605 INFO L87 Difference]: Start difference. First operand 2900 states and 3759 transitions. Second operand 9 states. [2019-10-15 03:26:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:52,253 INFO L93 Difference]: Finished difference Result 6167 states and 8224 transitions. [2019-10-15 03:26:52,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:26:52,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 03:26:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:52,279 INFO L225 Difference]: With dead ends: 6167 [2019-10-15 03:26:52,279 INFO L226 Difference]: Without dead ends: 5918 [2019-10-15 03:26:52,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:26:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2019-10-15 03:26:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 2900. [2019-10-15 03:26:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-10-15 03:26:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3758 transitions. [2019-10-15 03:26:52,500 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3758 transitions. Word has length 55 [2019-10-15 03:26:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:52,502 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3758 transitions. [2019-10-15 03:26:52,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3758 transitions. [2019-10-15 03:26:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:52,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:52,509 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:52,509 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2078575284, now seen corresponding path program 1 times [2019-10-15 03:26:52,510 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:52,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992770393] [2019-10-15 03:26:52,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:52,705 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,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992770393] [2019-10-15 03:26:52,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:52,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:26:52,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218274817] [2019-10-15 03:26:52,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:26:52,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:26:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:52,709 INFO L87 Difference]: Start difference. First operand 2900 states and 3758 transitions. Second operand 8 states. [2019-10-15 03:26:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:54,716 INFO L93 Difference]: Finished difference Result 6530 states and 8937 transitions. [2019-10-15 03:26:54,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:26:54,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-10-15 03:26:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:54,745 INFO L225 Difference]: With dead ends: 6530 [2019-10-15 03:26:54,746 INFO L226 Difference]: Without dead ends: 5690 [2019-10-15 03:26:54,750 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:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2019-10-15 03:26:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 2900. [2019-10-15 03:26:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-10-15 03:26:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3757 transitions. [2019-10-15 03:26:55,015 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3757 transitions. Word has length 55 [2019-10-15 03:26:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:55,015 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3757 transitions. [2019-10-15 03:26:55,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:26:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3757 transitions. [2019-10-15 03:26:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:55,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:55,019 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:55,020 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash -146447767, now seen corresponding path program 1 times [2019-10-15 03:26:55,020 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:55,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857073368] [2019-10-15 03:26:55,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:55,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:55,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:55,094 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:55,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857073368] [2019-10-15 03:26:55,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:55,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:55,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168568234] [2019-10-15 03:26:55,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:55,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:55,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:55,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:55,096 INFO L87 Difference]: Start difference. First operand 2900 states and 3757 transitions. Second operand 3 states. [2019-10-15 03:26:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:55,472 INFO L93 Difference]: Finished difference Result 4060 states and 5396 transitions. [2019-10-15 03:26:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:55,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-15 03:26:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:55,486 INFO L225 Difference]: With dead ends: 4060 [2019-10-15 03:26:55,486 INFO L226 Difference]: Without dead ends: 3013 [2019-10-15 03:26:55,489 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:26:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2019-10-15 03:26:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 2845. [2019-10-15 03:26:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-10-15 03:26:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3674 transitions. [2019-10-15 03:26:55,795 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3674 transitions. Word has length 56 [2019-10-15 03:26:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:55,795 INFO L462 AbstractCegarLoop]: Abstraction has 2845 states and 3674 transitions. [2019-10-15 03:26:55,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3674 transitions. [2019-10-15 03:26:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:55,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:55,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] [2019-10-15 03:26:55,800 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -384770931, now seen corresponding path program 1 times [2019-10-15 03:26:55,800 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:55,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676320745] [2019-10-15 03:26:55,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:55,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:55,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:55,870 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:55,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676320745] [2019-10-15 03:26:55,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:55,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:55,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741006805] [2019-10-15 03:26:55,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:55,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:55,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:55,872 INFO L87 Difference]: Start difference. First operand 2845 states and 3674 transitions. Second operand 3 states. [2019-10-15 03:26:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:56,322 INFO L93 Difference]: Finished difference Result 4346 states and 5822 transitions. [2019-10-15 03:26:56,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:56,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-15 03:26:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:56,336 INFO L225 Difference]: With dead ends: 4346 [2019-10-15 03:26:56,337 INFO L226 Difference]: Without dead ends: 3289 [2019-10-15 03:26:56,339 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:26:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2019-10-15 03:26:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3043. [2019-10-15 03:26:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-10-15 03:26:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 3976 transitions. [2019-10-15 03:26:56,608 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 3976 transitions. Word has length 56 [2019-10-15 03:26:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:56,608 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 3976 transitions. [2019-10-15 03:26:56,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 3976 transitions. [2019-10-15 03:26:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:56,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:56,612 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,612 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:56,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1124901437, now seen corresponding path program 1 times [2019-10-15 03:26:56,613 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:56,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517748356] [2019-10-15 03:26:56,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:56,697 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,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517748356] [2019-10-15 03:26:56,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:56,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:56,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570026477] [2019-10-15 03:26:56,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:56,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:56,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:56,704 INFO L87 Difference]: Start difference. First operand 3043 states and 3976 transitions. Second operand 3 states. [2019-10-15 03:26:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:57,164 INFO L93 Difference]: Finished difference Result 4905 states and 6564 transitions. [2019-10-15 03:26:57,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:57,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-15 03:26:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:57,186 INFO L225 Difference]: With dead ends: 4905 [2019-10-15 03:26:57,186 INFO L226 Difference]: Without dead ends: 2925 [2019-10-15 03:26:57,191 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:26:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2019-10-15 03:26:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2923. [2019-10-15 03:26:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-10-15 03:26:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3768 transitions. [2019-10-15 03:26:57,535 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3768 transitions. Word has length 56 [2019-10-15 03:26:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:57,535 INFO L462 AbstractCegarLoop]: Abstraction has 2923 states and 3768 transitions. [2019-10-15 03:26:57,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3768 transitions. [2019-10-15 03:26:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:26:57,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:57,539 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:57,539 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash 56463115, now seen corresponding path program 1 times [2019-10-15 03:26:57,540 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:57,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281778231] [2019-10-15 03:26:57,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:57,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:57,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:57,594 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:57,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281778231] [2019-10-15 03:26:57,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:57,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:57,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253245594] [2019-10-15 03:26:57,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:57,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:57,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:57,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:57,597 INFO L87 Difference]: Start difference. First operand 2923 states and 3768 transitions. Second operand 3 states. [2019-10-15 03:26:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:58,043 INFO L93 Difference]: Finished difference Result 5048 states and 6640 transitions. [2019-10-15 03:26:58,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:58,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 03:26:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:58,049 INFO L225 Difference]: With dead ends: 5048 [2019-10-15 03:26:58,049 INFO L226 Difference]: Without dead ends: 2820 [2019-10-15 03:26:58,054 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:26:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2019-10-15 03:26:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2240. [2019-10-15 03:26:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2019-10-15 03:26:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2866 transitions. [2019-10-15 03:26:58,259 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2866 transitions. Word has length 57 [2019-10-15 03:26:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:58,259 INFO L462 AbstractCegarLoop]: Abstraction has 2240 states and 2866 transitions. [2019-10-15 03:26:58,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2866 transitions. [2019-10-15 03:26:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:26:58,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:58,262 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:58,262 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:58,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:58,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1071477093, now seen corresponding path program 1 times [2019-10-15 03:26:58,263 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:58,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762463333] [2019-10-15 03:26:58,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:58,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:58,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:58,316 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:58,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762463333] [2019-10-15 03:26:58,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:58,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:58,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931180606] [2019-10-15 03:26:58,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:58,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:58,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:58,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:58,318 INFO L87 Difference]: Start difference. First operand 2240 states and 2866 transitions. Second operand 3 states. [2019-10-15 03:26:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:58,874 INFO L93 Difference]: Finished difference Result 4951 states and 6544 transitions. [2019-10-15 03:26:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:58,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 03:26:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:58,881 INFO L225 Difference]: With dead ends: 4951 [2019-10-15 03:26:58,881 INFO L226 Difference]: Without dead ends: 3189 [2019-10-15 03:26:58,884 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:26:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-10-15 03:26:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2569. [2019-10-15 03:26:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-10-15 03:26:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3365 transitions. [2019-10-15 03:26:59,187 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3365 transitions. Word has length 57 [2019-10-15 03:26:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:59,187 INFO L462 AbstractCegarLoop]: Abstraction has 2569 states and 3365 transitions. [2019-10-15 03:26:59,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3365 transitions. [2019-10-15 03:26:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:59,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:59,190 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:26:59,190 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:59,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:59,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1030838178, now seen corresponding path program 1 times [2019-10-15 03:26:59,191 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:59,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476363353] [2019-10-15 03:26:59,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:59,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:59,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:59,827 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,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476363353] [2019-10-15 03:26:59,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:59,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-15 03:26:59,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771488040] [2019-10-15 03:26:59,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 03:26:59,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:59,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 03:26:59,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:26:59,829 INFO L87 Difference]: Start difference. First operand 2569 states and 3365 transitions. Second operand 19 states. [2019-10-15 03:27:00,012 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-15 03:27:00,949 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-15 03:27:01,199 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-15 03:27:01,361 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-15 03:27:01,984 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-10-15 03:27:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:06,417 INFO L93 Difference]: Finished difference Result 6341 states and 8481 transitions. [2019-10-15 03:27:06,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 03:27:06,419 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-10-15 03:27:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:06,431 INFO L225 Difference]: With dead ends: 6341 [2019-10-15 03:27:06,431 INFO L226 Difference]: Without dead ends: 6337 [2019-10-15 03:27:06,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=256, Invalid=1150, Unknown=0, NotChecked=0, Total=1406 [2019-10-15 03:27:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2019-10-15 03:27:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 2581. [2019-10-15 03:27:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2581 states. [2019-10-15 03:27:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3382 transitions. [2019-10-15 03:27:06,823 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3382 transitions. Word has length 58 [2019-10-15 03:27:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:06,824 INFO L462 AbstractCegarLoop]: Abstraction has 2581 states and 3382 transitions. [2019-10-15 03:27:06,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-15 03:27:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3382 transitions. [2019-10-15 03:27:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:27:06,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:06,826 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:06,826 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:06,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:06,827 INFO L82 PathProgramCache]: Analyzing trace with hash -405889394, now seen corresponding path program 1 times [2019-10-15 03:27:06,827 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:06,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230020949] [2019-10-15 03:27:06,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:06,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:06,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:07,503 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:07,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230020949] [2019-10-15 03:27:07,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:07,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-15 03:27:07,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622345121] [2019-10-15 03:27:07,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 03:27:07,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:07,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 03:27:07,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:27:07,505 INFO L87 Difference]: Start difference. First operand 2581 states and 3382 transitions. Second operand 19 states. [2019-10-15 03:27:07,719 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-10-15 03:27:07,941 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28