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.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:20,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:20,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:20,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:20,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:20,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:20,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:20,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:20,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:20,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:20,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:20,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:20,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:20,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:20,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:20,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:20,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:20,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:20,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:20,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:20,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:20,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:20,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:20,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:21,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:21,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:21,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:21,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:21,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:21,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:21,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:21,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:21,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:21,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:21,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:21,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:21,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:21,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:21,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:21,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:21,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:21,014 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:21,028 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:21,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:21,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:21,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:21,030 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:21,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:21,031 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:21,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:21,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:21,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:21,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:21,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:21,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:21,032 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:21,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:21,033 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:21,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:21,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:21,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:21,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:21,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:21,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:21,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:21,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:21,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:21,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:21,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:21,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:21,035 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:21,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:21,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:21,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:21,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:21,364 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:21,364 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 03:26:21,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d32e291/085a72892ae343d1b6357d910e5ddc86/FLAG568ac8b3f [2019-10-15 03:26:21,909 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:21,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 03:26:21,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d32e291/085a72892ae343d1b6357d910e5ddc86/FLAG568ac8b3f [2019-10-15 03:26:22,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d32e291/085a72892ae343d1b6357d910e5ddc86 [2019-10-15 03:26:22,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:22,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:22,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:22,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:22,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:22,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:22" (1/1) ... [2019-10-15 03:26:22,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6539ef0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:22, skipping insertion in model container [2019-10-15 03:26:22,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:22" (1/1) ... [2019-10-15 03:26:22,264 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:22,305 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:22,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:22,737 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:22,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:22,869 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:22,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:22 WrapperNode [2019-10-15 03:26:22,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:22,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:22,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:22,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:22,884 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:22" (1/1) ... [2019-10-15 03:26:22,884 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:22" (1/1) ... [2019-10-15 03:26:22,894 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:22" (1/1) ... [2019-10-15 03:26:22,895 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:22" (1/1) ... [2019-10-15 03:26:22,912 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:22" (1/1) ... [2019-10-15 03:26:22,923 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:22" (1/1) ... [2019-10-15 03:26:22,926 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:22" (1/1) ... [2019-10-15 03:26:22,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:22,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:22,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:22,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:22,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:22" (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:22,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:22,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:22,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:24,204 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:24,204 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:24,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:24 BoogieIcfgContainer [2019-10-15 03:26:24,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:24,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:24,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:24,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:24,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:22" (1/3) ... [2019-10-15 03:26:24,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d810863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:24, skipping insertion in model container [2019-10-15 03:26:24,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:22" (2/3) ... [2019-10-15 03:26:24,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d810863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:24, skipping insertion in model container [2019-10-15 03:26:24,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:24" (3/3) ... [2019-10-15 03:26:24,214 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 03:26:24,223 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:24,231 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:26:24,242 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:26:24,268 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:24,268 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:24,268 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:24,268 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:24,269 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:24,269 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:24,269 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:24,269 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-10-15 03:26:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 03:26:24,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:24,299 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] [2019-10-15 03:26:24,301 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:24,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:24,306 INFO L82 PathProgramCache]: Analyzing trace with hash -673173785, now seen corresponding path program 1 times [2019-10-15 03:26:24,315 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:24,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136004014] [2019-10-15 03:26:24,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:24,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:24,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:24,871 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:24,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136004014] [2019-10-15 03:26:24,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:24,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:24,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945201811] [2019-10-15 03:26:24,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:24,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:24,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:24,897 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 5 states. [2019-10-15 03:26:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:25,211 INFO L93 Difference]: Finished difference Result 309 states and 486 transitions. [2019-10-15 03:26:25,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:25,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-15 03:26:25,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:25,234 INFO L225 Difference]: With dead ends: 309 [2019-10-15 03:26:25,234 INFO L226 Difference]: Without dead ends: 225 [2019-10-15 03:26:25,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-15 03:26:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2019-10-15 03:26:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-15 03:26:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2019-10-15 03:26:25,318 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 46 [2019-10-15 03:26:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:25,318 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2019-10-15 03:26:25,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2019-10-15 03:26:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:26:25,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:25,321 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] [2019-10-15 03:26:25,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:25,322 INFO L82 PathProgramCache]: Analyzing trace with hash -182497987, now seen corresponding path program 1 times [2019-10-15 03:26:25,322 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:25,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397099072] [2019-10-15 03:26:25,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:25,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:25,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:25,442 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:25,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397099072] [2019-10-15 03:26:25,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:25,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:25,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015581365] [2019-10-15 03:26:25,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:25,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:25,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:25,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:25,446 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand 6 states. [2019-10-15 03:26:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:25,607 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2019-10-15 03:26:25,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:25,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-15 03:26:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:25,610 INFO L225 Difference]: With dead ends: 397 [2019-10-15 03:26:25,610 INFO L226 Difference]: Without dead ends: 221 [2019-10-15 03:26:25,635 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:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-15 03:26:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-10-15 03:26:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-15 03:26:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 281 transitions. [2019-10-15 03:26:25,679 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 281 transitions. Word has length 47 [2019-10-15 03:26:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:25,680 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 281 transitions. [2019-10-15 03:26:25,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 281 transitions. [2019-10-15 03:26:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:26:25,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:25,682 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] [2019-10-15 03:26:25,683 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1648415540, now seen corresponding path program 1 times [2019-10-15 03:26:25,683 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:25,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330842687] [2019-10-15 03:26:25,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:25,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:25,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:25,789 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:25,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330842687] [2019-10-15 03:26:25,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:25,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:25,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418382474] [2019-10-15 03:26:25,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:25,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:25,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:25,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:25,792 INFO L87 Difference]: Start difference. First operand 221 states and 281 transitions. Second operand 6 states. [2019-10-15 03:26:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:25,912 INFO L93 Difference]: Finished difference Result 372 states and 477 transitions. [2019-10-15 03:26:25,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:25,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-15 03:26:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:25,915 INFO L225 Difference]: With dead ends: 372 [2019-10-15 03:26:25,915 INFO L226 Difference]: Without dead ends: 221 [2019-10-15 03:26:25,917 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:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-15 03:26:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-10-15 03:26:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-15 03:26:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 271 transitions. [2019-10-15 03:26:25,952 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 271 transitions. Word has length 47 [2019-10-15 03:26:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:25,952 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 271 transitions. [2019-10-15 03:26:25,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 271 transitions. [2019-10-15 03:26:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:26:25,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:25,955 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] [2019-10-15 03:26:25,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:25,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:25,955 INFO L82 PathProgramCache]: Analyzing trace with hash -559064541, now seen corresponding path program 1 times [2019-10-15 03:26:25,956 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:25,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410986862] [2019-10-15 03:26:25,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:25,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:25,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:26,063 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:26,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410986862] [2019-10-15 03:26:26,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:26,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:26,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213566250] [2019-10-15 03:26:26,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:26,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:26,065 INFO L87 Difference]: Start difference. First operand 221 states and 271 transitions. Second operand 5 states. [2019-10-15 03:26:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:26,203 INFO L93 Difference]: Finished difference Result 358 states and 448 transitions. [2019-10-15 03:26:26,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:26,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-15 03:26:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:26,205 INFO L225 Difference]: With dead ends: 358 [2019-10-15 03:26:26,205 INFO L226 Difference]: Without dead ends: 221 [2019-10-15 03:26:26,206 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:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-15 03:26:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-10-15 03:26:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-15 03:26:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2019-10-15 03:26:26,223 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 48 [2019-10-15 03:26:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:26,223 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2019-10-15 03:26:26,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2019-10-15 03:26:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:26:26,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:26,225 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] [2019-10-15 03:26:26,225 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:26,226 INFO L82 PathProgramCache]: Analyzing trace with hash -852097956, now seen corresponding path program 1 times [2019-10-15 03:26:26,226 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:26,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076174518] [2019-10-15 03:26:26,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:26,447 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:26,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076174518] [2019-10-15 03:26:26,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:26,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:26:26,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425248675] [2019-10-15 03:26:26,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:26:26,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:26,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:26:26,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:26:26,450 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand 11 states. [2019-10-15 03:26:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:26,941 INFO L93 Difference]: Finished difference Result 405 states and 502 transitions. [2019-10-15 03:26:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:26:26,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-10-15 03:26:26,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:26,944 INFO L225 Difference]: With dead ends: 405 [2019-10-15 03:26:26,944 INFO L226 Difference]: Without dead ends: 348 [2019-10-15 03:26:26,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:26:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-10-15 03:26:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 281. [2019-10-15 03:26:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-15 03:26:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-10-15 03:26:26,968 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 48 [2019-10-15 03:26:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:26,969 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-10-15 03:26:26,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:26:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-10-15 03:26:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:26:26,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:26,971 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] [2019-10-15 03:26:26,971 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1927649468, now seen corresponding path program 1 times [2019-10-15 03:26:26,972 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:26,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092702905] [2019-10-15 03:26:26,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:27,166 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:27,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092702905] [2019-10-15 03:26:27,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:27,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:27,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628111207] [2019-10-15 03:26:27,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:27,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:27,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:27,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:27,172 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 10 states. [2019-10-15 03:26:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:27,677 INFO L93 Difference]: Finished difference Result 540 states and 663 transitions. [2019-10-15 03:26:27,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:26:27,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-10-15 03:26:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:27,684 INFO L225 Difference]: With dead ends: 540 [2019-10-15 03:26:27,685 INFO L226 Difference]: Without dead ends: 513 [2019-10-15 03:26:27,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:26:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-15 03:26:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 368. [2019-10-15 03:26:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-15 03:26:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 449 transitions. [2019-10-15 03:26:27,719 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 449 transitions. Word has length 48 [2019-10-15 03:26:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:27,719 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 449 transitions. [2019-10-15 03:26:27,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 449 transitions. [2019-10-15 03:26:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 03:26:27,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:27,721 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] [2019-10-15 03:26:27,721 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:27,721 INFO L82 PathProgramCache]: Analyzing trace with hash 162391591, now seen corresponding path program 1 times [2019-10-15 03:26:27,722 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:27,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943588498] [2019-10-15 03:26:27,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:27,917 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:27,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943588498] [2019-10-15 03:26:27,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:27,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:27,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241231403] [2019-10-15 03:26:27,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:27,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:27,920 INFO L87 Difference]: Start difference. First operand 368 states and 449 transitions. Second operand 10 states. [2019-10-15 03:26:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:28,873 INFO L93 Difference]: Finished difference Result 960 states and 1235 transitions. [2019-10-15 03:26:28,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:26:28,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-10-15 03:26:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:28,879 INFO L225 Difference]: With dead ends: 960 [2019-10-15 03:26:28,879 INFO L226 Difference]: Without dead ends: 866 [2019-10-15 03:26:28,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:26:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-10-15 03:26:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 635. [2019-10-15 03:26:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-15 03:26:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 797 transitions. [2019-10-15 03:26:28,940 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 797 transitions. Word has length 49 [2019-10-15 03:26:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:28,940 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 797 transitions. [2019-10-15 03:26:28,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 797 transitions. [2019-10-15 03:26:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:26:28,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:28,942 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] [2019-10-15 03:26:28,942 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:28,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1780212977, now seen corresponding path program 1 times [2019-10-15 03:26:28,942 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:28,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232083419] [2019-10-15 03:26:28,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:28,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:28,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:29,162 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:29,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232083419] [2019-10-15 03:26:29,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:29,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:26:29,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436081835] [2019-10-15 03:26:29,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:26:29,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:29,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:26:29,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:26:29,164 INFO L87 Difference]: Start difference. First operand 635 states and 797 transitions. Second operand 12 states. [2019-10-15 03:26:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:30,014 INFO L93 Difference]: Finished difference Result 988 states and 1245 transitions. [2019-10-15 03:26:30,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:26:30,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-10-15 03:26:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:30,020 INFO L225 Difference]: With dead ends: 988 [2019-10-15 03:26:30,020 INFO L226 Difference]: Without dead ends: 932 [2019-10-15 03:26:30,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-10-15 03:26:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-10-15 03:26:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 635. [2019-10-15 03:26:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-15 03:26:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 795 transitions. [2019-10-15 03:26:30,081 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 795 transitions. Word has length 50 [2019-10-15 03:26:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:30,081 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 795 transitions. [2019-10-15 03:26:30,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:26:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 795 transitions. [2019-10-15 03:26:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:26:30,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:30,083 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] [2019-10-15 03:26:30,083 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:30,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:30,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1032655972, now seen corresponding path program 1 times [2019-10-15 03:26:30,084 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:30,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946372874] [2019-10-15 03:26:30,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:30,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:30,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:30,300 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:30,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946372874] [2019-10-15 03:26:30,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:30,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:26:30,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699983887] [2019-10-15 03:26:30,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:26:30,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:30,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:26:30,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:26:30,302 INFO L87 Difference]: Start difference. First operand 635 states and 795 transitions. Second operand 12 states. [2019-10-15 03:26:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:30,940 INFO L93 Difference]: Finished difference Result 1925 states and 2481 transitions. [2019-10-15 03:26:30,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 03:26:30,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-15 03:26:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:30,952 INFO L225 Difference]: With dead ends: 1925 [2019-10-15 03:26:30,953 INFO L226 Difference]: Without dead ends: 1584 [2019-10-15 03:26:30,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-10-15 03:26:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-10-15 03:26:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1054. [2019-10-15 03:26:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-15 03:26:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1348 transitions. [2019-10-15 03:26:31,134 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1348 transitions. Word has length 51 [2019-10-15 03:26:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:31,134 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1348 transitions. [2019-10-15 03:26:31,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:26:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1348 transitions. [2019-10-15 03:26:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:26:31,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:31,135 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] [2019-10-15 03:26:31,136 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1747091452, now seen corresponding path program 1 times [2019-10-15 03:26:31,136 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:31,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936503593] [2019-10-15 03:26:31,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:31,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:31,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:31,404 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:31,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936503593] [2019-10-15 03:26:31,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:31,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:26:31,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970764681] [2019-10-15 03:26:31,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:26:31,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:31,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:26:31,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:26:31,406 INFO L87 Difference]: Start difference. First operand 1054 states and 1348 transitions. Second operand 12 states. [2019-10-15 03:26:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:32,250 INFO L93 Difference]: Finished difference Result 1574 states and 2014 transitions. [2019-10-15 03:26:32,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-15 03:26:32,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-15 03:26:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:32,279 INFO L225 Difference]: With dead ends: 1574 [2019-10-15 03:26:32,280 INFO L226 Difference]: Without dead ends: 1480 [2019-10-15 03:26:32,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-10-15 03:26:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-10-15 03:26:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1069. [2019-10-15 03:26:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-15 03:26:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1363 transitions. [2019-10-15 03:26:32,379 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1363 transitions. Word has length 51 [2019-10-15 03:26:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:32,380 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1363 transitions. [2019-10-15 03:26:32,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:26:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1363 transitions. [2019-10-15 03:26:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 03:26:32,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:32,381 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] [2019-10-15 03:26:32,381 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:32,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1583938470, now seen corresponding path program 1 times [2019-10-15 03:26:32,382 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:32,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184528186] [2019-10-15 03:26:32,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:32,420 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:32,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184528186] [2019-10-15 03:26:32,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:32,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:32,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734432036] [2019-10-15 03:26:32,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:32,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:32,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:32,422 INFO L87 Difference]: Start difference. First operand 1069 states and 1363 transitions. Second operand 3 states. [2019-10-15 03:26:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:32,575 INFO L93 Difference]: Finished difference Result 2403 states and 3130 transitions. [2019-10-15 03:26:32,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:32,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-15 03:26:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:32,583 INFO L225 Difference]: With dead ends: 2403 [2019-10-15 03:26:32,583 INFO L226 Difference]: Without dead ends: 1570 [2019-10-15 03:26:32,585 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:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-15 03:26:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1566. [2019-10-15 03:26:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-10-15 03:26:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2025 transitions. [2019-10-15 03:26:32,792 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2025 transitions. Word has length 52 [2019-10-15 03:26:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:32,793 INFO L462 AbstractCegarLoop]: Abstraction has 1566 states and 2025 transitions. [2019-10-15 03:26:32,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2025 transitions. [2019-10-15 03:26:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:26:32,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:32,795 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] [2019-10-15 03:26:32,795 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash 62651441, now seen corresponding path program 1 times [2019-10-15 03:26:32,796 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:32,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138538489] [2019-10-15 03:26:32,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:34,268 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-15 03:26:34,435 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-15 03:26:34,579 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-15 03:26:34,737 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-10-15 03:26:34,904 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-10-15 03:26:35,528 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:35,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138538489] [2019-10-15 03:26:35,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:35,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-10-15 03:26:35,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689706081] [2019-10-15 03:26:35,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 03:26:35,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:35,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 03:26:35,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:26:35,530 INFO L87 Difference]: Start difference. First operand 1566 states and 2025 transitions. Second operand 25 states. [2019-10-15 03:26:36,049 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-15 03:26:36,340 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-15 03:26:36,497 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-15 03:26:36,730 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-10-15 03:26:37,144 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-10-15 03:26:37,643 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-10-15 03:26:38,110 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-10-15 03:26:38,606 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2019-10-15 03:26:39,190 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-10-15 03:26:39,651 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-10-15 03:26:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:42,442 INFO L93 Difference]: Finished difference Result 3795 states and 4950 transitions. [2019-10-15 03:26:42,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-15 03:26:42,443 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2019-10-15 03:26:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:42,460 INFO L225 Difference]: With dead ends: 3795 [2019-10-15 03:26:42,461 INFO L226 Difference]: Without dead ends: 3617 [2019-10-15 03:26:42,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=474, Invalid=1166, Unknown=0, NotChecked=0, Total=1640 [2019-10-15 03:26:42,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2019-10-15 03:26:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 1563. [2019-10-15 03:26:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-10-15 03:26:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2022 transitions. [2019-10-15 03:26:42,726 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2022 transitions. Word has length 53 [2019-10-15 03:26:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:42,726 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 2022 transitions. [2019-10-15 03:26:42,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 03:26:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2022 transitions. [2019-10-15 03:26:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:42,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:42,728 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,728 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash -821953624, now seen corresponding path program 1 times [2019-10-15 03:26:42,729 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:42,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137502639] [2019-10-15 03:26:42,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:42,789 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,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137502639] [2019-10-15 03:26:42,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:42,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:42,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073217747] [2019-10-15 03:26:42,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:42,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:42,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:42,791 INFO L87 Difference]: Start difference. First operand 1563 states and 2022 transitions. Second operand 3 states. [2019-10-15 03:26:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:43,070 INFO L93 Difference]: Finished difference Result 3492 states and 4570 transitions. [2019-10-15 03:26:43,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:43,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 03:26:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:43,081 INFO L225 Difference]: With dead ends: 3492 [2019-10-15 03:26:43,081 INFO L226 Difference]: Without dead ends: 2348 [2019-10-15 03:26:43,084 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:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-10-15 03:26:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2170. [2019-10-15 03:26:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-15 03:26:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2829 transitions. [2019-10-15 03:26:43,427 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2829 transitions. Word has length 54 [2019-10-15 03:26:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:43,428 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2829 transitions. [2019-10-15 03:26:43,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2829 transitions. [2019-10-15 03:26:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:43,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:43,433 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:43,433 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1254473464, now seen corresponding path program 1 times [2019-10-15 03:26:43,433 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:43,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240903036] [2019-10-15 03:26:43,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:43,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:43,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:43,492 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,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240903036] [2019-10-15 03:26:43,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:43,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:43,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931929604] [2019-10-15 03:26:43,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:43,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:43,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:43,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:43,494 INFO L87 Difference]: Start difference. First operand 2170 states and 2829 transitions. Second operand 3 states. [2019-10-15 03:26:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:43,842 INFO L93 Difference]: Finished difference Result 4336 states and 5667 transitions. [2019-10-15 03:26:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:43,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:26:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:43,854 INFO L225 Difference]: With dead ends: 4336 [2019-10-15 03:26:43,854 INFO L226 Difference]: Without dead ends: 2729 [2019-10-15 03:26:43,858 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:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2019-10-15 03:26:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2505. [2019-10-15 03:26:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-10-15 03:26:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3241 transitions. [2019-10-15 03:26:44,261 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3241 transitions. Word has length 58 [2019-10-15 03:26:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:44,262 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 3241 transitions. [2019-10-15 03:26:44,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3241 transitions. [2019-10-15 03:26:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 03:26:44,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:44,264 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:44,264 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:44,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:44,264 INFO L82 PathProgramCache]: Analyzing trace with hash 822343230, now seen corresponding path program 1 times [2019-10-15 03:26:44,264 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:44,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598411291] [2019-10-15 03:26:44,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:44,320 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,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598411291] [2019-10-15 03:26:44,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:44,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:44,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84164524] [2019-10-15 03:26:44,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:44,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:44,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:44,322 INFO L87 Difference]: Start difference. First operand 2505 states and 3241 transitions. Second operand 3 states. [2019-10-15 03:26:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:44,635 INFO L93 Difference]: Finished difference Result 4792 states and 6213 transitions. [2019-10-15 03:26:44,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:44,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-15 03:26:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:44,646 INFO L225 Difference]: With dead ends: 4792 [2019-10-15 03:26:44,646 INFO L226 Difference]: Without dead ends: 3443 [2019-10-15 03:26:44,650 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:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2019-10-15 03:26:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3262. [2019-10-15 03:26:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-10-15 03:26:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4182 transitions. [2019-10-15 03:26:45,031 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4182 transitions. Word has length 61 [2019-10-15 03:26:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:45,032 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 4182 transitions. [2019-10-15 03:26:45,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4182 transitions. [2019-10-15 03:26:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 03:26:45,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:45,033 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:45,034 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1717854949, now seen corresponding path program 1 times [2019-10-15 03:26:45,034 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:45,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372593729] [2019-10-15 03:26:45,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:45,168 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,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372593729] [2019-10-15 03:26:45,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:45,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:45,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283951053] [2019-10-15 03:26:45,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:45,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:45,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:45,173 INFO L87 Difference]: Start difference. First operand 3262 states and 4182 transitions. Second operand 10 states. [2019-10-15 03:26:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:47,060 INFO L93 Difference]: Finished difference Result 9627 states and 12352 transitions. [2019-10-15 03:26:47,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:26:47,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-10-15 03:26:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:47,090 INFO L225 Difference]: With dead ends: 9627 [2019-10-15 03:26:47,090 INFO L226 Difference]: Without dead ends: 6920 [2019-10-15 03:26:47,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-10-15 03:26:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6920 states. [2019-10-15 03:26:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6920 to 4747. [2019-10-15 03:26:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4747 states. [2019-10-15 03:26:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 5993 transitions. [2019-10-15 03:26:47,652 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 5993 transitions. Word has length 63 [2019-10-15 03:26:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:47,653 INFO L462 AbstractCegarLoop]: Abstraction has 4747 states and 5993 transitions. [2019-10-15 03:26:47,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 5993 transitions. [2019-10-15 03:26:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:26:47,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:47,656 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:47,656 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash 180323707, now seen corresponding path program 1 times [2019-10-15 03:26:47,657 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:47,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087265525] [2019-10-15 03:26:47,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 03:26:47,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087265525] [2019-10-15 03:26:47,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:47,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:47,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973159740] [2019-10-15 03:26:47,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:47,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:47,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:47,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:47,717 INFO L87 Difference]: Start difference. First operand 4747 states and 5993 transitions. Second operand 3 states. [2019-10-15 03:26:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:48,330 INFO L93 Difference]: Finished difference Result 8017 states and 10142 transitions. [2019-10-15 03:26:48,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:48,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-15 03:26:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:48,347 INFO L225 Difference]: With dead ends: 8017 [2019-10-15 03:26:48,348 INFO L226 Difference]: Without dead ends: 4915 [2019-10-15 03:26:48,354 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:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2019-10-15 03:26:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4608. [2019-10-15 03:26:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4608 states. [2019-10-15 03:26:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 5764 transitions. [2019-10-15 03:26:48,891 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 5764 transitions. Word has length 73 [2019-10-15 03:26:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:48,892 INFO L462 AbstractCegarLoop]: Abstraction has 4608 states and 5764 transitions. [2019-10-15 03:26:48,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 5764 transitions. [2019-10-15 03:26:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 03:26:48,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:48,895 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,895 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1697580780, now seen corresponding path program 1 times [2019-10-15 03:26:48,896 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:48,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168839985] [2019-10-15 03:26:48,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:49,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168839985] [2019-10-15 03:26:49,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747337653] [2019-10-15 03:26:49,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:26:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:49,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-15 03:26:49,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:26:49,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:50,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:50,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:26:50,266 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:26:50,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:50,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:51,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:26:51,354 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:26:51,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18, 14] imperfect sequences [14] total 42 [2019-10-15 03:26:51,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263866755] [2019-10-15 03:26:51,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-15 03:26:51,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:51,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-15 03:26:51,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2019-10-15 03:26:51,357 INFO L87 Difference]: Start difference. First operand 4608 states and 5764 transitions. Second operand 30 states. [2019-10-15 03:26:52,151 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-10-15 03:26:52,380 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-10-15 03:26:53,019 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-15 03:26:53,190 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-10-15 03:26:53,666 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2019-10-15 03:26:53,860 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-10-15 03:26:54,394 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-10-15 03:26:55,016 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 41 [2019-10-15 03:26:55,569 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-10-15 03:26:55,966 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2019-10-15 03:26:56,182 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-10-15 03:26:56,330 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 36 [2019-10-15 03:26:56,604 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-10-15 03:26:56,977 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-10-15 03:26:57,208 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-10-15 03:26:57,762 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 73