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.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:34,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:34,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:34,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:34,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:34,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:34,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:34,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:34,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:34,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:34,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:34,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:34,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:34,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:34,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:34,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:34,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:34,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:34,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:34,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:34,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:34,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:34,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:34,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:34,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:34,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:34,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:34,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:34,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:34,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:34,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:34,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:34,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:34,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:34,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:34,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:34,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:34,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:34,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:34,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:34,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:34,260 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,285 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:34,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:34,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:34,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:34,289 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:34,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:34,289 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:34,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:34,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:34,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:34,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:34,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:34,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:34,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:34,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:34,291 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:34,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:34,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:34,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:34,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:34,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:34,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:34,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:34,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:34,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:34,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:34,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:34,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:34,293 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,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:34,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:34,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:34,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:34,586 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:34,587 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.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 03:26:34,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4299c9824/14ada88ec1cc4544bf3e272fe4966c03/FLAG6a852cb9a [2019-10-15 03:26:35,419 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:35,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 03:26:35,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4299c9824/14ada88ec1cc4544bf3e272fe4966c03/FLAG6a852cb9a [2019-10-15 03:26:35,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4299c9824/14ada88ec1cc4544bf3e272fe4966c03 [2019-10-15 03:26:35,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:35,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:35,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:35,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:35,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:35,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:35" (1/1) ... [2019-10-15 03:26:35,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0ede89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:35, skipping insertion in model container [2019-10-15 03:26:35,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:35" (1/1) ... [2019-10-15 03:26:35,630 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:35,793 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:36,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:36,972 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:37,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:37,378 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:37,379 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,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:37,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:37,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:37,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:37,396 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,397 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,462 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,462 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,553 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:37,588 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:37,609 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:37,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:37,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:37,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:37,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:37,634 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:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:37,736 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:37,736 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:37,736 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:37,737 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:37,737 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:37,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:37,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:37,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:41,917 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:41,918 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:41,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:41 BoogieIcfgContainer [2019-10-15 03:26:41,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:41,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:41,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:41,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:41,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:35" (1/3) ... [2019-10-15 03:26:41,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e865672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:41, skipping insertion in model container [2019-10-15 03:26:41,925 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:41,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e865672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:41, skipping insertion in model container [2019-10-15 03:26:41,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:41" (3/3) ... [2019-10-15 03:26:41,928 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 03:26:41,938 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:41,947 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 03:26:41,959 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 03:26:41,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:41,993 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:41,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:41,993 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:41,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:41,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:41,993 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:41,993 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:42,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states. [2019-10-15 03:26:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:42,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:42,056 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:42,058 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1049131971, now seen corresponding path program 1 times [2019-10-15 03:26:42,074 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:42,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762320345] [2019-10-15 03:26:42,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:42,675 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:42,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762320345] [2019-10-15 03:26:42,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:42,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:42,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982534165] [2019-10-15 03:26:42,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:42,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:42,699 INFO L87 Difference]: Start difference. First operand 1240 states. Second operand 5 states. [2019-10-15 03:26:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:44,830 INFO L93 Difference]: Finished difference Result 2377 states and 4076 transitions. [2019-10-15 03:26:44,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:44,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-15 03:26:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:44,859 INFO L225 Difference]: With dead ends: 2377 [2019-10-15 03:26:44,860 INFO L226 Difference]: Without dead ends: 1498 [2019-10-15 03:26:44,868 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:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2019-10-15 03:26:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1492. [2019-10-15 03:26:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2019-10-15 03:26:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1900 transitions. [2019-10-15 03:26:45,016 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1900 transitions. Word has length 55 [2019-10-15 03:26:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:45,017 INFO L462 AbstractCegarLoop]: Abstraction has 1492 states and 1900 transitions. [2019-10-15 03:26:45,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1900 transitions. [2019-10-15 03:26:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:45,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:45,024 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:45,024 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:45,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash -853550216, now seen corresponding path program 1 times [2019-10-15 03:26:45,026 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:45,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11447715] [2019-10-15 03:26:45,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:45,281 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,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11447715] [2019-10-15 03:26:45,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:45,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:45,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565444494] [2019-10-15 03:26:45,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:45,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:45,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:45,287 INFO L87 Difference]: Start difference. First operand 1492 states and 1900 transitions. Second operand 6 states. [2019-10-15 03:26:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:46,645 INFO L93 Difference]: Finished difference Result 3286 states and 4192 transitions. [2019-10-15 03:26:46,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:46,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-15 03:26:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:46,658 INFO L225 Difference]: With dead ends: 3286 [2019-10-15 03:26:46,659 INFO L226 Difference]: Without dead ends: 2368 [2019-10-15 03:26:46,661 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:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2019-10-15 03:26:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2345. [2019-10-15 03:26:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2345 states. [2019-10-15 03:26:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 2997 transitions. [2019-10-15 03:26:46,757 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 2997 transitions. Word has length 56 [2019-10-15 03:26:46,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:46,757 INFO L462 AbstractCegarLoop]: Abstraction has 2345 states and 2997 transitions. [2019-10-15 03:26:46,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2997 transitions. [2019-10-15 03:26:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:46,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:46,762 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:46,762 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash 618054128, now seen corresponding path program 1 times [2019-10-15 03:26:46,763 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:46,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608959140] [2019-10-15 03:26:46,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:46,939 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,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608959140] [2019-10-15 03:26:46,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:46,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:46,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394560414] [2019-10-15 03:26:46,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:46,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:46,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:46,943 INFO L87 Difference]: Start difference. First operand 2345 states and 2997 transitions. Second operand 6 states. [2019-10-15 03:26:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:48,304 INFO L93 Difference]: Finished difference Result 5347 states and 6862 transitions. [2019-10-15 03:26:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:48,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-15 03:26:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:48,329 INFO L225 Difference]: With dead ends: 5347 [2019-10-15 03:26:48,329 INFO L226 Difference]: Without dead ends: 3865 [2019-10-15 03:26:48,336 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,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2019-10-15 03:26:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3849. [2019-10-15 03:26:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2019-10-15 03:26:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4898 transitions. [2019-10-15 03:26:48,577 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4898 transitions. Word has length 56 [2019-10-15 03:26:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:48,579 INFO L462 AbstractCegarLoop]: Abstraction has 3849 states and 4898 transitions. [2019-10-15 03:26:48,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4898 transitions. [2019-10-15 03:26:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:48,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:48,584 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:48,584 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1627295014, now seen corresponding path program 1 times [2019-10-15 03:26:48,585 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:48,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103008849] [2019-10-15 03:26:48,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:48,886 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:48,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103008849] [2019-10-15 03:26:48,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:48,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:48,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721266346] [2019-10-15 03:26:48,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:48,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:48,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:48,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:48,889 INFO L87 Difference]: Start difference. First operand 3849 states and 4898 transitions. Second operand 9 states. [2019-10-15 03:26:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:52,738 INFO L93 Difference]: Finished difference Result 5687 states and 7418 transitions. [2019-10-15 03:26:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:26:52,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-15 03:26:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:52,782 INFO L225 Difference]: With dead ends: 5687 [2019-10-15 03:26:52,783 INFO L226 Difference]: Without dead ends: 5681 [2019-10-15 03:26:52,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-10-15 03:26:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-10-15 03:26:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 3849. [2019-10-15 03:26:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2019-10-15 03:26:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4897 transitions. [2019-10-15 03:26:53,146 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4897 transitions. Word has length 58 [2019-10-15 03:26:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:53,147 INFO L462 AbstractCegarLoop]: Abstraction has 3849 states and 4897 transitions. [2019-10-15 03:26:53,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4897 transitions. [2019-10-15 03:26:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:53,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:53,153 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:53,153 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:53,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1670672239, now seen corresponding path program 1 times [2019-10-15 03:26:53,154 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:53,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610007881] [2019-10-15 03:26:53,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:53,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:53,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:53,342 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:53,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610007881] [2019-10-15 03:26:53,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:53,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:53,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19389151] [2019-10-15 03:26:53,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:53,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:53,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:53,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:53,345 INFO L87 Difference]: Start difference. First operand 3849 states and 4897 transitions. Second operand 9 states. [2019-10-15 03:26:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:58,257 INFO L93 Difference]: Finished difference Result 9189 states and 12006 transitions. [2019-10-15 03:26:58,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:26:58,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-15 03:26:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:58,305 INFO L225 Difference]: With dead ends: 9189 [2019-10-15 03:26:58,306 INFO L226 Difference]: Without dead ends: 8864 [2019-10-15 03:26:58,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:26:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2019-10-15 03:26:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 3849. [2019-10-15 03:26:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2019-10-15 03:26:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4896 transitions. [2019-10-15 03:26:58,755 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4896 transitions. Word has length 58 [2019-10-15 03:26:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:58,757 INFO L462 AbstractCegarLoop]: Abstraction has 3849 states and 4896 transitions. [2019-10-15 03:26:58,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4896 transitions. [2019-10-15 03:26:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:58,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:58,765 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:58,766 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1060275482, now seen corresponding path program 1 times [2019-10-15 03:26:58,767 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:58,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608940215] [2019-10-15 03:26:58,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:58,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:58,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:59,053 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,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608940215] [2019-10-15 03:26:59,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:59,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:26:59,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727043380] [2019-10-15 03:26:59,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:26:59,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:59,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:26:59,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:59,057 INFO L87 Difference]: Start difference. First operand 3849 states and 4896 transitions. Second operand 8 states. [2019-10-15 03:27:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:01,752 INFO L93 Difference]: Finished difference Result 8269 states and 11100 transitions. [2019-10-15 03:27:01,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:27:01,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-15 03:27:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:01,793 INFO L225 Difference]: With dead ends: 8269 [2019-10-15 03:27:01,793 INFO L226 Difference]: Without dead ends: 7254 [2019-10-15 03:27:01,798 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:27:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2019-10-15 03:27:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 3849. [2019-10-15 03:27:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2019-10-15 03:27:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4895 transitions. [2019-10-15 03:27:02,070 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4895 transitions. Word has length 58 [2019-10-15 03:27:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:02,071 INFO L462 AbstractCegarLoop]: Abstraction has 3849 states and 4895 transitions. [2019-10-15 03:27:02,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:27:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4895 transitions. [2019-10-15 03:27:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:27:02,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:02,079 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:02,079 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1321462413, now seen corresponding path program 1 times [2019-10-15 03:27:02,080 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:02,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829033683] [2019-10-15 03:27:02,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:02,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:02,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:02,179 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,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829033683] [2019-10-15 03:27:02,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:02,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:02,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316335798] [2019-10-15 03:27:02,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:02,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:02,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:02,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:02,182 INFO L87 Difference]: Start difference. First operand 3849 states and 4895 transitions. Second operand 3 states. [2019-10-15 03:27:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:02,887 INFO L93 Difference]: Finished difference Result 6822 states and 8777 transitions. [2019-10-15 03:27:02,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:02,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 03:27:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:02,900 INFO L225 Difference]: With dead ends: 6822 [2019-10-15 03:27:02,900 INFO L226 Difference]: Without dead ends: 4669 [2019-10-15 03:27:02,907 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,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-10-15 03:27:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4663. [2019-10-15 03:27:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-10-15 03:27:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 5839 transitions. [2019-10-15 03:27:03,291 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 5839 transitions. Word has length 59 [2019-10-15 03:27:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:03,292 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 5839 transitions. [2019-10-15 03:27:03,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 5839 transitions. [2019-10-15 03:27:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:27:03,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:03,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, 1, 1, 1, 1] [2019-10-15 03:27:03,297 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1942209389, now seen corresponding path program 1 times [2019-10-15 03:27:03,298 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:03,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581025381] [2019-10-15 03:27:03,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:03,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:03,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:03,392 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,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581025381] [2019-10-15 03:27:03,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:03,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:03,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132039226] [2019-10-15 03:27:03,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:03,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:03,395 INFO L87 Difference]: Start difference. First operand 4663 states and 5839 transitions. Second operand 3 states. [2019-10-15 03:27:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:04,034 INFO L93 Difference]: Finished difference Result 6941 states and 9014 transitions. [2019-10-15 03:27:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:04,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 03:27:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:04,047 INFO L225 Difference]: With dead ends: 6941 [2019-10-15 03:27:04,047 INFO L226 Difference]: Without dead ends: 5280 [2019-10-15 03:27:04,053 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,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2019-10-15 03:27:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 4904. [2019-10-15 03:27:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4904 states. [2019-10-15 03:27:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 6223 transitions. [2019-10-15 03:27:04,550 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 6223 transitions. Word has length 59 [2019-10-15 03:27:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:04,550 INFO L462 AbstractCegarLoop]: Abstraction has 4904 states and 6223 transitions. [2019-10-15 03:27:04,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 6223 transitions. [2019-10-15 03:27:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:27:04,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:04,555 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:04,556 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:04,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:04,556 INFO L82 PathProgramCache]: Analyzing trace with hash -88721283, now seen corresponding path program 1 times [2019-10-15 03:27:04,556 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:04,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972934360] [2019-10-15 03:27:04,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:04,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:04,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:04,646 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,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972934360] [2019-10-15 03:27:04,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:04,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:04,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774683913] [2019-10-15 03:27:04,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:04,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:04,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:04,648 INFO L87 Difference]: Start difference. First operand 4904 states and 6223 transitions. Second operand 3 states. [2019-10-15 03:27:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:05,487 INFO L93 Difference]: Finished difference Result 8340 states and 10960 transitions. [2019-10-15 03:27:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:05,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 03:27:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:05,507 INFO L225 Difference]: With dead ends: 8340 [2019-10-15 03:27:05,507 INFO L226 Difference]: Without dead ends: 6034 [2019-10-15 03:27:05,516 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,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states.