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-f4eb214f-m [2019-10-13 23:22:18,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:18,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:18,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:18,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:18,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:18,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:18,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:18,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:18,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:18,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:18,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:18,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:18,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:18,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:18,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:18,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:18,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:18,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:18,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:18,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:18,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:18,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:18,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:18,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:18,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:18,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:18,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:18,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:18,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:18,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:18,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:18,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:18,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:18,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:18,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:18,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:18,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:18,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:18,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:18,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:18,093 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-13 23:22:18,122 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:18,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:18,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:18,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:18,124 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:18,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:18,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:18,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:18,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:18,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:18,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:18,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:18,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:18,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:18,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:18,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:18,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:18,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:18,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:18,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:18,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:18,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:18,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:18,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:18,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:18,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:18,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:18,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:18,129 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-13 23:22:18,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:18,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:18,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:18,432 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:18,432 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:18,433 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-13 23:22:18,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15af6c10e/8225cdb52b884ff39c36ee0f1e1f04e3/FLAGa3841bb93 [2019-10-13 23:22:19,080 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:19,081 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-13 23:22:19,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15af6c10e/8225cdb52b884ff39c36ee0f1e1f04e3/FLAGa3841bb93 [2019-10-13 23:22:19,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15af6c10e/8225cdb52b884ff39c36ee0f1e1f04e3 [2019-10-13 23:22:19,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:19,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:19,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:19,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:19,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:19,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:19" (1/1) ... [2019-10-13 23:22:19,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470e4ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:19, skipping insertion in model container [2019-10-13 23:22:19,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:19" (1/1) ... [2019-10-13 23:22:19,388 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:19,457 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:20,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:20,027 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:20,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:20,484 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:20,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20 WrapperNode [2019-10-13 23:22:20,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:20,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:20,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:20,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:20,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20" (1/1) ... [2019-10-13 23:22:20,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20" (1/1) ... [2019-10-13 23:22:20,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20" (1/1) ... [2019-10-13 23:22:20,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20" (1/1) ... [2019-10-13 23:22:20,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20" (1/1) ... [2019-10-13 23:22:20,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20" (1/1) ... [2019-10-13 23:22:20,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20" (1/1) ... [2019-10-13 23:22:20,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:20,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:20,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:20,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:20,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20" (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-13 23:22:20,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:20,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:20,666 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:20,667 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:22:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:22:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:22:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:20,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:23,320 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:23,321 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:22:23,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:23 BoogieIcfgContainer [2019-10-13 23:22:23,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:23,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:23,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:23,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:23,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:19" (1/3) ... [2019-10-13 23:22:23,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698d8cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:23, skipping insertion in model container [2019-10-13 23:22:23,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20" (2/3) ... [2019-10-13 23:22:23,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698d8cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:23, skipping insertion in model container [2019-10-13 23:22:23,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:23" (3/3) ... [2019-10-13 23:22:23,333 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 23:22:23,345 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:23,358 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:22:23,374 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:22:23,409 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:23,409 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:23,409 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:23,409 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:23,409 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:23,409 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:23,410 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:23,410 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2019-10-13 23:22:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 23:22:23,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:23,476 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-13 23:22:23,478 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:23,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:23,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1725767074, now seen corresponding path program 1 times [2019-10-13 23:22:23,497 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:23,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410846268] [2019-10-13 23:22:23,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:24,803 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-13 23:22:24,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410846268] [2019-10-13 23:22:24,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:24,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:24,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485032564] [2019-10-13 23:22:24,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:24,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:24,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:24,834 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 5 states. [2019-10-13 23:22:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:25,088 INFO L93 Difference]: Finished difference Result 637 states and 1103 transitions. [2019-10-13 23:22:25,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:25,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-13 23:22:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:25,123 INFO L225 Difference]: With dead ends: 637 [2019-10-13 23:22:25,123 INFO L226 Difference]: Without dead ends: 436 [2019-10-13 23:22:25,130 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-13 23:22:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-13 23:22:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-10-13 23:22:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-10-13 23:22:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 599 transitions. [2019-10-13 23:22:25,255 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 599 transitions. Word has length 120 [2019-10-13 23:22:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:25,256 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 599 transitions. [2019-10-13 23:22:25,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 599 transitions. [2019-10-13 23:22:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 23:22:25,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:25,267 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-13 23:22:25,267 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:25,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1998448092, now seen corresponding path program 1 times [2019-10-13 23:22:25,269 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:25,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872419063] [2019-10-13 23:22:25,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:25,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:25,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:25,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-13 23:22:25,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872419063] [2019-10-13 23:22:25,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:25,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:25,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157516481] [2019-10-13 23:22:25,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:25,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:25,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:25,399 INFO L87 Difference]: Start difference. First operand 434 states and 599 transitions. Second operand 3 states. [2019-10-13 23:22:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:25,509 INFO L93 Difference]: Finished difference Result 1017 states and 1444 transitions. [2019-10-13 23:22:25,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:25,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-13 23:22:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:25,513 INFO L225 Difference]: With dead ends: 1017 [2019-10-13 23:22:25,514 INFO L226 Difference]: Without dead ends: 628 [2019-10-13 23:22:25,517 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-13 23:22:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-13 23:22:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 543. [2019-10-13 23:22:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-13 23:22:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 774 transitions. [2019-10-13 23:22:25,544 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 774 transitions. Word has length 122 [2019-10-13 23:22:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:25,544 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 774 transitions. [2019-10-13 23:22:25,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 774 transitions. [2019-10-13 23:22:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 23:22:25,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:25,546 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-13 23:22:25,547 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:25,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:25,547 INFO L82 PathProgramCache]: Analyzing trace with hash 534945616, now seen corresponding path program 1 times [2019-10-13 23:22:25,547 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:25,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74312539] [2019-10-13 23:22:25,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:25,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:25,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:25,702 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-13 23:22:25,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74312539] [2019-10-13 23:22:25,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:25,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:25,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93445783] [2019-10-13 23:22:25,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:25,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:25,709 INFO L87 Difference]: Start difference. First operand 543 states and 774 transitions. Second operand 3 states. [2019-10-13 23:22:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:25,809 INFO L93 Difference]: Finished difference Result 1286 states and 1883 transitions. [2019-10-13 23:22:25,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:25,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-13 23:22:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:25,816 INFO L225 Difference]: With dead ends: 1286 [2019-10-13 23:22:25,816 INFO L226 Difference]: Without dead ends: 812 [2019-10-13 23:22:25,818 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-13 23:22:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-10-13 23:22:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 748. [2019-10-13 23:22:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-13 23:22:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1103 transitions. [2019-10-13 23:22:25,859 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1103 transitions. Word has length 122 [2019-10-13 23:22:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:25,860 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1103 transitions. [2019-10-13 23:22:25,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1103 transitions. [2019-10-13 23:22:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 23:22:25,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:25,867 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-13 23:22:25,870 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash 220152516, now seen corresponding path program 1 times [2019-10-13 23:22:25,871 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:25,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819507261] [2019-10-13 23:22:25,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:25,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:25,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:26,003 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-13 23:22:26,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819507261] [2019-10-13 23:22:26,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:26,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:26,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972793399] [2019-10-13 23:22:26,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:26,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:26,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:26,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:26,007 INFO L87 Difference]: Start difference. First operand 748 states and 1103 transitions. Second operand 3 states. [2019-10-13 23:22:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:26,091 INFO L93 Difference]: Finished difference Result 1365 states and 2038 transitions. [2019-10-13 23:22:26,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:26,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-13 23:22:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:26,102 INFO L225 Difference]: With dead ends: 1365 [2019-10-13 23:22:26,102 INFO L226 Difference]: Without dead ends: 1081 [2019-10-13 23:22:26,104 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-13 23:22:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-10-13 23:22:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2019-10-13 23:22:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-10-13 23:22:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1587 transitions. [2019-10-13 23:22:26,172 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1587 transitions. Word has length 125 [2019-10-13 23:22:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:26,173 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1587 transitions. [2019-10-13 23:22:26,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1587 transitions. [2019-10-13 23:22:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 23:22:26,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:26,179 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-13 23:22:26,179 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1458354592, now seen corresponding path program 1 times [2019-10-13 23:22:26,180 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:26,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131286844] [2019-10-13 23:22:26,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:26,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-13 23:22:26,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131286844] [2019-10-13 23:22:26,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:26,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:26,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958311117] [2019-10-13 23:22:26,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:26,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:26,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:26,398 INFO L87 Difference]: Start difference. First operand 1079 states and 1587 transitions. Second operand 5 states. [2019-10-13 23:22:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:26,817 INFO L93 Difference]: Finished difference Result 2115 states and 3128 transitions. [2019-10-13 23:22:26,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:26,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-10-13 23:22:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:26,824 INFO L225 Difference]: With dead ends: 2115 [2019-10-13 23:22:26,824 INFO L226 Difference]: Without dead ends: 1079 [2019-10-13 23:22:26,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-10-13 23:22:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-10-13 23:22:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-10-13 23:22:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1570 transitions. [2019-10-13 23:22:26,896 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1570 transitions. Word has length 125 [2019-10-13 23:22:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:26,896 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1570 transitions. [2019-10-13 23:22:26,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1570 transitions. [2019-10-13 23:22:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 23:22:26,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:26,899 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-13 23:22:26,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:26,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:26,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2129906597, now seen corresponding path program 1 times [2019-10-13 23:22:26,900 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:26,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980568925] [2019-10-13 23:22:26,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:27,262 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-13 23:22:27,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980568925] [2019-10-13 23:22:27,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:27,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:27,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774313032] [2019-10-13 23:22:27,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:27,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:27,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:27,264 INFO L87 Difference]: Start difference. First operand 1079 states and 1570 transitions. Second operand 5 states. [2019-10-13 23:22:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:27,501 INFO L93 Difference]: Finished difference Result 2970 states and 4352 transitions. [2019-10-13 23:22:27,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:27,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-10-13 23:22:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:27,511 INFO L225 Difference]: With dead ends: 2970 [2019-10-13 23:22:27,512 INFO L226 Difference]: Without dead ends: 1999 [2019-10-13 23:22:27,515 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-13 23:22:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-10-13 23:22:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1997. [2019-10-13 23:22:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-10-13 23:22:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2898 transitions. [2019-10-13 23:22:27,683 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2898 transitions. Word has length 125 [2019-10-13 23:22:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:27,684 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 2898 transitions. [2019-10-13 23:22:27,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2898 transitions. [2019-10-13 23:22:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 23:22:27,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:27,688 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-13 23:22:27,688 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:27,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1808965899, now seen corresponding path program 1 times [2019-10-13 23:22:27,688 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:27,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141680609] [2019-10-13 23:22:27,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:27,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:27,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:27,788 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-13 23:22:27,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141680609] [2019-10-13 23:22:27,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:27,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:27,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641737700] [2019-10-13 23:22:27,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:27,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:27,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:27,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:27,791 INFO L87 Difference]: Start difference. First operand 1997 states and 2898 transitions. Second operand 3 states. [2019-10-13 23:22:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:28,065 INFO L93 Difference]: Finished difference Result 5028 states and 7435 transitions. [2019-10-13 23:22:28,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:28,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-13 23:22:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:28,082 INFO L225 Difference]: With dead ends: 5028 [2019-10-13 23:22:28,083 INFO L226 Difference]: Without dead ends: 3181 [2019-10-13 23:22:28,087 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-13 23:22:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-10-13 23:22:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3071. [2019-10-13 23:22:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-10-13 23:22:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4574 transitions. [2019-10-13 23:22:28,384 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4574 transitions. Word has length 127 [2019-10-13 23:22:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:28,385 INFO L462 AbstractCegarLoop]: Abstraction has 3071 states and 4574 transitions. [2019-10-13 23:22:28,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4574 transitions. [2019-10-13 23:22:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 23:22:28,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:28,388 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-13 23:22:28,389 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2023233197, now seen corresponding path program 1 times [2019-10-13 23:22:28,390 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:28,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923768449] [2019-10-13 23:22:28,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:28,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:28,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:28,544 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-13 23:22:28,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923768449] [2019-10-13 23:22:28,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:28,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:28,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304939647] [2019-10-13 23:22:28,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:28,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:28,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:28,546 INFO L87 Difference]: Start difference. First operand 3071 states and 4574 transitions. Second operand 5 states. [2019-10-13 23:22:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:28,932 INFO L93 Difference]: Finished difference Result 6004 states and 8972 transitions. [2019-10-13 23:22:28,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:28,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-13 23:22:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:28,948 INFO L225 Difference]: With dead ends: 6004 [2019-10-13 23:22:28,948 INFO L226 Difference]: Without dead ends: 3071 [2019-10-13 23:22:28,957 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-13 23:22:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2019-10-13 23:22:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2019-10-13 23:22:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-10-13 23:22:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4520 transitions. [2019-10-13 23:22:29,216 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4520 transitions. Word has length 130 [2019-10-13 23:22:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:29,216 INFO L462 AbstractCegarLoop]: Abstraction has 3071 states and 4520 transitions. [2019-10-13 23:22:29,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:29,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4520 transitions. [2019-10-13 23:22:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 23:22:29,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:29,219 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-13 23:22:29,220 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash -282064210, now seen corresponding path program 1 times [2019-10-13 23:22:29,220 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:29,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061012767] [2019-10-13 23:22:29,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:29,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:29,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:29,670 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-13 23:22:29,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061012767] [2019-10-13 23:22:29,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:29,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:29,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810450196] [2019-10-13 23:22:29,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:29,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:29,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:29,676 INFO L87 Difference]: Start difference. First operand 3071 states and 4520 transitions. Second operand 5 states. [2019-10-13 23:22:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:29,974 INFO L93 Difference]: Finished difference Result 4045 states and 5966 transitions. [2019-10-13 23:22:29,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:29,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-13 23:22:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:29,989 INFO L225 Difference]: With dead ends: 4045 [2019-10-13 23:22:29,989 INFO L226 Difference]: Without dead ends: 3078 [2019-10-13 23:22:29,993 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-13 23:22:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2019-10-13 23:22:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 3067. [2019-10-13 23:22:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2019-10-13 23:22:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4515 transitions. [2019-10-13 23:22:30,278 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4515 transitions. Word has length 130 [2019-10-13 23:22:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:30,278 INFO L462 AbstractCegarLoop]: Abstraction has 3067 states and 4515 transitions. [2019-10-13 23:22:30,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4515 transitions. [2019-10-13 23:22:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 23:22:30,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:30,282 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-13 23:22:30,282 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:30,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1109472631, now seen corresponding path program 1 times [2019-10-13 23:22:30,284 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:30,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334791192] [2019-10-13 23:22:30,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:30,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:30,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:30,722 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-13 23:22:30,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334791192] [2019-10-13 23:22:30,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:30,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:30,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320131540] [2019-10-13 23:22:30,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:30,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:30,725 INFO L87 Difference]: Start difference. First operand 3067 states and 4515 transitions. Second operand 6 states. [2019-10-13 23:22:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:31,160 INFO L93 Difference]: Finished difference Result 8269 states and 12198 transitions. [2019-10-13 23:22:31,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:31,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-13 23:22:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:31,186 INFO L225 Difference]: With dead ends: 8269 [2019-10-13 23:22:31,186 INFO L226 Difference]: Without dead ends: 5366 [2019-10-13 23:22:31,194 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-13 23:22:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5366 states. [2019-10-13 23:22:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5366 to 5364. [2019-10-13 23:22:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5364 states. [2019-10-13 23:22:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 5364 states and 7820 transitions. [2019-10-13 23:22:31,616 INFO L78 Accepts]: Start accepts. Automaton has 5364 states and 7820 transitions. Word has length 130 [2019-10-13 23:22:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:31,616 INFO L462 AbstractCegarLoop]: Abstraction has 5364 states and 7820 transitions. [2019-10-13 23:22:31,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5364 states and 7820 transitions. [2019-10-13 23:22:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 23:22:31,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:31,621 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-13 23:22:31,621 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:31,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash 737658540, now seen corresponding path program 1 times [2019-10-13 23:22:31,622 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:31,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293973080] [2019-10-13 23:22:31,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:31,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:31,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:32,923 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-10-13 23:22:33,065 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-13 23:22:33,275 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-10-13 23:22:33,560 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-13 23:22:33,758 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-10-13 23:22:33,960 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-10-13 23:22:34,119 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-10-13 23:22:34,296 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-10-13 23:22:34,500 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-10-13 23:22:34,756 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2019-10-13 23:22:34,985 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-13 23:22:35,211 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-13 23:22:35,414 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-10-13 23:22:35,576 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2019-10-13 23:22:36,023 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-13 23:22:36,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293973080] [2019-10-13 23:22:36,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:36,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-13 23:22:36,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518351365] [2019-10-13 23:22:36,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 23:22:36,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 23:22:36,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:22:36,026 INFO L87 Difference]: Start difference. First operand 5364 states and 7820 transitions. Second operand 28 states. [2019-10-13 23:22:36,471 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-10-13 23:22:36,705 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-13 23:22:36,959 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-10-13 23:22:37,316 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-13 23:22:37,597 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-13 23:22:38,100 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-10-13 23:22:38,586 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-10-13 23:22:39,049 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-10-13 23:22:39,448 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2019-10-13 23:22:40,067 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2019-10-13 23:22:40,556 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-10-13 23:22:41,218 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 122 [2019-10-13 23:22:41,839 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2019-10-13 23:22:42,261 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-10-13 23:22:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:44,787 INFO L93 Difference]: Finished difference Result 7779 states and 11186 transitions. [2019-10-13 23:22:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 23:22:44,787 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 135 [2019-10-13 23:22:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:44,817 INFO L225 Difference]: With dead ends: 7779 [2019-10-13 23:22:44,817 INFO L226 Difference]: Without dead ends: 6109 [2019-10-13 23:22:44,822 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-13 23:22:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2019-10-13 23:22:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 5457. [2019-10-13 23:22:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5457 states. [2019-10-13 23:22:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 7933 transitions. [2019-10-13 23:22:45,198 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 7933 transitions. Word has length 135 [2019-10-13 23:22:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:45,198 INFO L462 AbstractCegarLoop]: Abstraction has 5457 states and 7933 transitions. [2019-10-13 23:22:45,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 23:22:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 7933 transitions. [2019-10-13 23:22:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 23:22:45,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:45,203 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-13 23:22:45,203 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:45,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1899059121, now seen corresponding path program 1 times [2019-10-13 23:22:45,204 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:45,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435702656] [2019-10-13 23:22:45,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,327 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-13 23:22:45,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435702656] [2019-10-13 23:22:45,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:45,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:45,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54317040] [2019-10-13 23:22:45,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:45,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:45,331 INFO L87 Difference]: Start difference. First operand 5457 states and 7933 transitions. Second operand 5 states. [2019-10-13 23:22:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:45,948 INFO L93 Difference]: Finished difference Result 10729 states and 15636 transitions. [2019-10-13 23:22:45,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:45,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-13 23:22:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:45,964 INFO L225 Difference]: With dead ends: 10729 [2019-10-13 23:22:45,965 INFO L226 Difference]: Without dead ends: 5457 [2019-10-13 23:22:45,977 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-13 23:22:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2019-10-13 23:22:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 5457. [2019-10-13 23:22:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5457 states. [2019-10-13 23:22:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 7829 transitions. [2019-10-13 23:22:46,468 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 7829 transitions. Word has length 135 [2019-10-13 23:22:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:46,468 INFO L462 AbstractCegarLoop]: Abstraction has 5457 states and 7829 transitions. [2019-10-13 23:22:46,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 7829 transitions. [2019-10-13 23:22:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 23:22:46,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:46,475 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-13 23:22:46,476 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:46,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1203308834, now seen corresponding path program 1 times [2019-10-13 23:22:46,476 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:46,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306947944] [2019-10-13 23:22:46,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:46,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:46,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:47,714 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-10-13 23:22:48,122 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-10-13 23:22:48,514 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-13 23:22:48,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306947944] [2019-10-13 23:22:48,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:48,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-13 23:22:48,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654684274] [2019-10-13 23:22:48,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 23:22:48,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:48,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 23:22:48,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-10-13 23:22:48,516 INFO L87 Difference]: Start difference. First operand 5457 states and 7829 transitions. Second operand 21 states. [2019-10-13 23:22:48,944 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-10-13 23:22:49,488 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-10-13 23:22:49,743 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-13 23:22:49,994 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-10-13 23:22:50,360 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-10-13 23:22:50,770 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-10-13 23:22:51,124 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-10-13 23:22:51,392 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-10-13 23:22:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:53,342 INFO L93 Difference]: Finished difference Result 7736 states and 11003 transitions. [2019-10-13 23:22:53,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 23:22:53,343 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 135 [2019-10-13 23:22:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:53,360 INFO L225 Difference]: With dead ends: 7736 [2019-10-13 23:22:53,361 INFO L226 Difference]: Without dead ends: 6066 [2019-10-13 23:22:53,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 23:22:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2019-10-13 23:22:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 5628. [2019-10-13 23:22:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-10-13 23:22:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 8034 transitions. [2019-10-13 23:22:53,744 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 8034 transitions. Word has length 135 [2019-10-13 23:22:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:53,745 INFO L462 AbstractCegarLoop]: Abstraction has 5628 states and 8034 transitions. [2019-10-13 23:22:53,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 23:22:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 8034 transitions. [2019-10-13 23:22:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 23:22:53,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:53,750 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-13 23:22:53,750 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 575334980, now seen corresponding path program 1 times [2019-10-13 23:22:53,751 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:53,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289060781] [2019-10-13 23:22:53,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:53,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:53,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat