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_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:59,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:59,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:59,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:59,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:59,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:59,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:59,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:59,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:59,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:59,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:59,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:59,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:59,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:59,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:59,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:59,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:59,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:59,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:59,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:59,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:59,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:59,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:59,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:59,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:59,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:59,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:59,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:59,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:59,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:59,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:59,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:59,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:59,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:59,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:59,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:59,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:59,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:59,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:59,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:59,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:59,153 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:59,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:59,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:59,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:59,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:59,179 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:59,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:59,179 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:59,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:59,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:59,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:59,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:59,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:59,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:59,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:59,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:59,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:59,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:59,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:59,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:59,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:59,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:59,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:59,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:59,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:59,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:59,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:59,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:59,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:59,185 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:59,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:59,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:59,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:59,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:59,517 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:59,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 03:26:59,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61358ec17/6e0336ad2f6841b4b8cee6b12e905ee6/FLAG38f130739 [2019-10-15 03:27:00,094 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:27:00,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 03:27:00,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61358ec17/6e0336ad2f6841b4b8cee6b12e905ee6/FLAG38f130739 [2019-10-15 03:27:00,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61358ec17/6e0336ad2f6841b4b8cee6b12e905ee6 [2019-10-15 03:27:00,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:27:00,408 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:27:00,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:00,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:27:00,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:27:00,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:00" (1/1) ... [2019-10-15 03:27:00,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2fb7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:00, skipping insertion in model container [2019-10-15 03:27:00,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:00" (1/1) ... [2019-10-15 03:27:00,425 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:27:00,504 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:27:01,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:01,072 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:27:01,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:01,254 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:27:01,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01 WrapperNode [2019-10-15 03:27:01,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:01,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:27:01,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:27:01,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:27:01,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01" (1/1) ... [2019-10-15 03:27:01,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01" (1/1) ... [2019-10-15 03:27:01,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01" (1/1) ... [2019-10-15 03:27:01,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01" (1/1) ... [2019-10-15 03:27:01,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01" (1/1) ... [2019-10-15 03:27:01,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01" (1/1) ... [2019-10-15 03:27:01,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01" (1/1) ... [2019-10-15 03:27:01,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:27:01,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:27:01,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:27:01,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:27:01,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01" (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:27:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:27:01,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:27:01,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:27:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:27:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:27:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:27:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:27:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:27:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:27:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:27:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:27:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:27:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:27:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:27:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:27:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:27:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:27:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:27:03,896 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:27:03,896 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:27:03,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:03 BoogieIcfgContainer [2019-10-15 03:27:03,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:27:03,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:27:03,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:27:03,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:27:03,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:27:00" (1/3) ... [2019-10-15 03:27:03,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70aea8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:03, skipping insertion in model container [2019-10-15 03:27:03,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:01" (2/3) ... [2019-10-15 03:27:03,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70aea8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:03, skipping insertion in model container [2019-10-15 03:27:03,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:03" (3/3) ... [2019-10-15 03:27:03,923 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 03:27:03,935 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:27:03,948 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:27:03,959 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:27:03,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:27:03,995 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:27:03,996 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:27:03,996 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:27:03,996 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:27:03,996 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:27:03,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:27:03,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:27:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2019-10-15 03:27:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 03:27:04,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:04,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:04,054 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1725767074, now seen corresponding path program 1 times [2019-10-15 03:27:04,065 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:04,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870346305] [2019-10-15 03:27:04,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:04,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:04,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:05,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870346305] [2019-10-15 03:27:05,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:05,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:05,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287052661] [2019-10-15 03:27:05,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:05,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:05,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:05,233 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 5 states. [2019-10-15 03:27:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:05,433 INFO L93 Difference]: Finished difference Result 637 states and 1103 transitions. [2019-10-15 03:27:05,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:05,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 03:27:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:05,460 INFO L225 Difference]: With dead ends: 637 [2019-10-15 03:27:05,460 INFO L226 Difference]: Without dead ends: 436 [2019-10-15 03:27:05,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:27:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-15 03:27:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-10-15 03:27:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-10-15 03:27:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 599 transitions. [2019-10-15 03:27:05,577 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 599 transitions. Word has length 120 [2019-10-15 03:27:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:05,578 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 599 transitions. [2019-10-15 03:27:05,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 599 transitions. [2019-10-15 03:27:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 03:27:05,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:05,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:05,583 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1998448092, now seen corresponding path program 1 times [2019-10-15 03:27:05,583 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:05,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459478464] [2019-10-15 03:27:05,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:05,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:05,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:05,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459478464] [2019-10-15 03:27:05,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:05,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:05,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586808159] [2019-10-15 03:27:05,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:05,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:05,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:05,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:05,713 INFO L87 Difference]: Start difference. First operand 434 states and 599 transitions. Second operand 3 states. [2019-10-15 03:27:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:05,819 INFO L93 Difference]: Finished difference Result 1017 states and 1444 transitions. [2019-10-15 03:27:05,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:05,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-15 03:27:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:05,823 INFO L225 Difference]: With dead ends: 1017 [2019-10-15 03:27:05,824 INFO L226 Difference]: Without dead ends: 628 [2019-10-15 03:27:05,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-15 03:27:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 543. [2019-10-15 03:27:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-15 03:27:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 774 transitions. [2019-10-15 03:27:05,890 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 774 transitions. Word has length 122 [2019-10-15 03:27:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:05,894 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 774 transitions. [2019-10-15 03:27:05,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 774 transitions. [2019-10-15 03:27:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 03:27:05,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:05,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:05,907 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:05,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash 534945616, now seen corresponding path program 1 times [2019-10-15 03:27:05,907 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:05,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395530478] [2019-10-15 03:27:05,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:05,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:05,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:06,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395530478] [2019-10-15 03:27:06,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:06,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:06,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186758446] [2019-10-15 03:27:06,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:06,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:06,063 INFO L87 Difference]: Start difference. First operand 543 states and 774 transitions. Second operand 3 states. [2019-10-15 03:27:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:06,163 INFO L93 Difference]: Finished difference Result 1286 states and 1883 transitions. [2019-10-15 03:27:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:06,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-15 03:27:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:06,169 INFO L225 Difference]: With dead ends: 1286 [2019-10-15 03:27:06,169 INFO L226 Difference]: Without dead ends: 812 [2019-10-15 03:27:06,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-10-15 03:27:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 748. [2019-10-15 03:27:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-15 03:27:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1103 transitions. [2019-10-15 03:27:06,214 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1103 transitions. Word has length 122 [2019-10-15 03:27:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:06,215 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1103 transitions. [2019-10-15 03:27:06,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1103 transitions. [2019-10-15 03:27:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 03:27:06,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:06,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:06,217 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:06,218 INFO L82 PathProgramCache]: Analyzing trace with hash 220152516, now seen corresponding path program 1 times [2019-10-15 03:27:06,218 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:06,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173631755] [2019-10-15 03:27:06,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:06,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:06,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:06,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173631755] [2019-10-15 03:27:06,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:06,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:06,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901214873] [2019-10-15 03:27:06,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:06,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:06,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:06,396 INFO L87 Difference]: Start difference. First operand 748 states and 1103 transitions. Second operand 3 states. [2019-10-15 03:27:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:06,509 INFO L93 Difference]: Finished difference Result 1365 states and 2038 transitions. [2019-10-15 03:27:06,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:06,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-15 03:27:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:06,518 INFO L225 Difference]: With dead ends: 1365 [2019-10-15 03:27:06,518 INFO L226 Difference]: Without dead ends: 1081 [2019-10-15 03:27:06,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-10-15 03:27:06,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2019-10-15 03:27:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-10-15 03:27:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1587 transitions. [2019-10-15 03:27:06,592 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1587 transitions. Word has length 125 [2019-10-15 03:27:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:06,593 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1587 transitions. [2019-10-15 03:27:06,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1587 transitions. [2019-10-15 03:27:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 03:27:06,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:06,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:06,596 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:06,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:06,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1458354592, now seen corresponding path program 1 times [2019-10-15 03:27:06,597 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:06,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002652845] [2019-10-15 03:27:06,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:06,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:06,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:06,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002652845] [2019-10-15 03:27:06,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:06,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:06,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355892149] [2019-10-15 03:27:06,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:06,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:06,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:06,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:06,809 INFO L87 Difference]: Start difference. First operand 1079 states and 1587 transitions. Second operand 5 states. [2019-10-15 03:27:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:07,141 INFO L93 Difference]: Finished difference Result 2115 states and 3128 transitions. [2019-10-15 03:27:07,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:07,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-10-15 03:27:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:07,151 INFO L225 Difference]: With dead ends: 2115 [2019-10-15 03:27:07,152 INFO L226 Difference]: Without dead ends: 1079 [2019-10-15 03:27:07,155 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:27:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-10-15 03:27:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-10-15 03:27:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-10-15 03:27:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1570 transitions. [2019-10-15 03:27:07,349 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1570 transitions. Word has length 125 [2019-10-15 03:27:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:07,350 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1570 transitions. [2019-10-15 03:27:07,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1570 transitions. [2019-10-15 03:27:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 03:27:07,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:07,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:07,354 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2129906597, now seen corresponding path program 1 times [2019-10-15 03:27:07,356 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:07,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658493581] [2019-10-15 03:27:07,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:07,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:07,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:07,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658493581] [2019-10-15 03:27:07,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:07,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:07,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282221450] [2019-10-15 03:27:07,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:07,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:07,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:07,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:07,961 INFO L87 Difference]: Start difference. First operand 1079 states and 1570 transitions. Second operand 5 states. [2019-10-15 03:27:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:08,164 INFO L93 Difference]: Finished difference Result 2970 states and 4352 transitions. [2019-10-15 03:27:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:08,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-10-15 03:27:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:08,181 INFO L225 Difference]: With dead ends: 2970 [2019-10-15 03:27:08,181 INFO L226 Difference]: Without dead ends: 1999 [2019-10-15 03:27:08,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:27:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-10-15 03:27:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1997. [2019-10-15 03:27:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-10-15 03:27:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2898 transitions. [2019-10-15 03:27:08,386 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2898 transitions. Word has length 125 [2019-10-15 03:27:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:08,387 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 2898 transitions. [2019-10-15 03:27:08,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2898 transitions. [2019-10-15 03:27:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 03:27:08,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:08,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:08,390 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1808965899, now seen corresponding path program 1 times [2019-10-15 03:27:08,391 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:08,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220660428] [2019-10-15 03:27:08,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:08,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:08,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:08,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220660428] [2019-10-15 03:27:08,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:08,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:08,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053672604] [2019-10-15 03:27:08,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:08,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:08,477 INFO L87 Difference]: Start difference. First operand 1997 states and 2898 transitions. Second operand 3 states. [2019-10-15 03:27:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:08,857 INFO L93 Difference]: Finished difference Result 5028 states and 7435 transitions. [2019-10-15 03:27:08,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:08,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-15 03:27:08,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:08,881 INFO L225 Difference]: With dead ends: 5028 [2019-10-15 03:27:08,881 INFO L226 Difference]: Without dead ends: 3181 [2019-10-15 03:27:08,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-10-15 03:27:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3071. [2019-10-15 03:27:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-10-15 03:27:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4574 transitions. [2019-10-15 03:27:09,322 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4574 transitions. Word has length 127 [2019-10-15 03:27:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:09,323 INFO L462 AbstractCegarLoop]: Abstraction has 3071 states and 4574 transitions. [2019-10-15 03:27:09,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4574 transitions. [2019-10-15 03:27:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 03:27:09,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:09,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:09,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:09,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2023233197, now seen corresponding path program 1 times [2019-10-15 03:27:09,329 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:09,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491375761] [2019-10-15 03:27:09,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:09,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:09,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:09,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491375761] [2019-10-15 03:27:09,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:09,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:09,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390819461] [2019-10-15 03:27:09,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:09,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:09,588 INFO L87 Difference]: Start difference. First operand 3071 states and 4574 transitions. Second operand 5 states. [2019-10-15 03:27:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:10,060 INFO L93 Difference]: Finished difference Result 6004 states and 8972 transitions. [2019-10-15 03:27:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:10,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-15 03:27:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:10,079 INFO L225 Difference]: With dead ends: 6004 [2019-10-15 03:27:10,079 INFO L226 Difference]: Without dead ends: 3071 [2019-10-15 03:27:10,088 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:27:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2019-10-15 03:27:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2019-10-15 03:27:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-10-15 03:27:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4520 transitions. [2019-10-15 03:27:10,422 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4520 transitions. Word has length 130 [2019-10-15 03:27:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:10,422 INFO L462 AbstractCegarLoop]: Abstraction has 3071 states and 4520 transitions. [2019-10-15 03:27:10,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4520 transitions. [2019-10-15 03:27:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 03:27:10,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:10,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:10,426 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash -282064210, now seen corresponding path program 1 times [2019-10-15 03:27:10,427 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:10,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859097530] [2019-10-15 03:27:10,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:10,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:10,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:10,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859097530] [2019-10-15 03:27:10,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:10,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:10,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341212750] [2019-10-15 03:27:10,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:10,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:10,857 INFO L87 Difference]: Start difference. First operand 3071 states and 4520 transitions. Second operand 5 states. [2019-10-15 03:27:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:11,216 INFO L93 Difference]: Finished difference Result 4045 states and 5966 transitions. [2019-10-15 03:27:11,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:11,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-15 03:27:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:11,232 INFO L225 Difference]: With dead ends: 4045 [2019-10-15 03:27:11,232 INFO L226 Difference]: Without dead ends: 3078 [2019-10-15 03:27:11,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2019-10-15 03:27:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 3067. [2019-10-15 03:27:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2019-10-15 03:27:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4515 transitions. [2019-10-15 03:27:11,451 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4515 transitions. Word has length 130 [2019-10-15 03:27:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:11,452 INFO L462 AbstractCegarLoop]: Abstraction has 3067 states and 4515 transitions. [2019-10-15 03:27:11,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4515 transitions. [2019-10-15 03:27:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 03:27:11,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:11,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:11,456 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:11,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1109472631, now seen corresponding path program 1 times [2019-10-15 03:27:11,456 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:11,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754532794] [2019-10-15 03:27:11,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:11,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:11,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:11,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754532794] [2019-10-15 03:27:11,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:11,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:27:11,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126440480] [2019-10-15 03:27:11,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:27:11,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:27:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:27:11,927 INFO L87 Difference]: Start difference. First operand 3067 states and 4515 transitions. Second operand 6 states. [2019-10-15 03:27:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:12,663 INFO L93 Difference]: Finished difference Result 8269 states and 12198 transitions. [2019-10-15 03:27:12,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:12,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-15 03:27:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:12,691 INFO L225 Difference]: With dead ends: 8269 [2019-10-15 03:27:12,691 INFO L226 Difference]: Without dead ends: 5366 [2019-10-15 03:27:12,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5366 states. [2019-10-15 03:27:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5366 to 5364. [2019-10-15 03:27:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5364 states. [2019-10-15 03:27:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 5364 states and 7820 transitions. [2019-10-15 03:27:13,184 INFO L78 Accepts]: Start accepts. Automaton has 5364 states and 7820 transitions. Word has length 130 [2019-10-15 03:27:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:13,185 INFO L462 AbstractCegarLoop]: Abstraction has 5364 states and 7820 transitions. [2019-10-15 03:27:13,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:27:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5364 states and 7820 transitions. [2019-10-15 03:27:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 03:27:13,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:13,190 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:13,190 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:13,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:13,191 INFO L82 PathProgramCache]: Analyzing trace with hash 737658540, now seen corresponding path program 1 times [2019-10-15 03:27:13,191 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:13,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198429793] [2019-10-15 03:27:13,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,880 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-10-15 03:27:15,020 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-10-15 03:27:15,167 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-15 03:27:15,392 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-10-15 03:27:15,549 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-10-15 03:27:15,750 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-10-15 03:27:16,017 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-10-15 03:27:16,226 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-10-15 03:27:16,462 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2019-10-15 03:27:16,710 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-15 03:27:16,945 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-15 03:27:17,151 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-10-15 03:27:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:17,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198429793] [2019-10-15 03:27:17,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:17,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-15 03:27:17,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437484098] [2019-10-15 03:27:17,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-15 03:27:17,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:17,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-15 03:27:17,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-10-15 03:27:17,711 INFO L87 Difference]: Start difference. First operand 5364 states and 7820 transitions. Second operand 28 states. [2019-10-15 03:27:18,188 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-10-15 03:27:18,460 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-15 03:27:18,756 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-10-15 03:27:19,102 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-15 03:27:19,414 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-15 03:27:19,914 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-10-15 03:27:20,404 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-10-15 03:27:20,843 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-10-15 03:27:21,264 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2019-10-15 03:27:21,864 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2019-10-15 03:27:22,317 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-10-15 03:27:23,043 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 122 [2019-10-15 03:27:23,697 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2019-10-15 03:27:24,132 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-10-15 03:27:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:26,859 INFO L93 Difference]: Finished difference Result 7779 states and 11186 transitions. [2019-10-15 03:27:26,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-15 03:27:26,859 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 135 [2019-10-15 03:27:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:26,918 INFO L225 Difference]: With dead ends: 7779 [2019-10-15 03:27:26,918 INFO L226 Difference]: Without dead ends: 6109 [2019-10-15 03:27:26,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=400, Invalid=1322, Unknown=0, NotChecked=0, Total=1722 [2019-10-15 03:27:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2019-10-15 03:27:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 5457. [2019-10-15 03:27:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5457 states. [2019-10-15 03:27:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 7933 transitions. [2019-10-15 03:27:27,403 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 7933 transitions. Word has length 135 [2019-10-15 03:27:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:27,403 INFO L462 AbstractCegarLoop]: Abstraction has 5457 states and 7933 transitions. [2019-10-15 03:27:27,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-15 03:27:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 7933 transitions. [2019-10-15 03:27:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 03:27:27,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:27,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:27,412 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1899059121, now seen corresponding path program 1 times [2019-10-15 03:27:27,412 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:27,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057219389] [2019-10-15 03:27:27,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:27,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:27,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:27,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057219389] [2019-10-15 03:27:27,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:27,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:27,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220088882] [2019-10-15 03:27:27,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:27,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:27,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:27,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:27,545 INFO L87 Difference]: Start difference. First operand 5457 states and 7933 transitions. Second operand 5 states. [2019-10-15 03:27:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:28,096 INFO L93 Difference]: Finished difference Result 10729 states and 15636 transitions. [2019-10-15 03:27:28,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:28,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 03:27:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:28,110 INFO L225 Difference]: With dead ends: 10729 [2019-10-15 03:27:28,110 INFO L226 Difference]: Without dead ends: 5457 [2019-10-15 03:27:28,120 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:27:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2019-10-15 03:27:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 5457. [2019-10-15 03:27:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5457 states. [2019-10-15 03:27:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 7829 transitions. [2019-10-15 03:27:28,575 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 7829 transitions. Word has length 135 [2019-10-15 03:27:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:28,576 INFO L462 AbstractCegarLoop]: Abstraction has 5457 states and 7829 transitions. [2019-10-15 03:27:28,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 7829 transitions. [2019-10-15 03:27:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 03:27:28,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:28,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:28,582 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:28,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:28,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1203308834, now seen corresponding path program 1 times [2019-10-15 03:27:28,582 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:28,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182343123] [2019-10-15 03:27:28,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:28,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:28,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:29,785 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-10-15 03:27:30,193 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-10-15 03:27:30,462 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-10-15 03:27:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:30,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182343123] [2019-10-15 03:27:30,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:30,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-15 03:27:30,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45541955] [2019-10-15 03:27:30,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-15 03:27:30,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:30,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-15 03:27:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-10-15 03:27:30,709 INFO L87 Difference]: Start difference. First operand 5457 states and 7829 transitions. Second operand 21 states. [2019-10-15 03:27:31,147 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-10-15 03:27:31,951 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-15 03:27:32,201 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-10-15 03:27:32,626 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-10-15 03:27:33,046 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-10-15 03:27:33,416 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-10-15 03:27:33,699 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70