/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.05.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:06:22,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:06:22,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:06:22,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:06:22,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:06:22,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:06:22,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:06:22,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:06:22,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:06:22,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:06:22,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:06:22,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:06:22,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:06:22,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:06:22,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:06:22,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:06:22,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:06:22,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:06:22,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:06:22,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:06:22,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:06:22,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:06:22,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:06:22,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:06:22,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:06:22,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:06:22,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:06:22,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:06:22,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:06:22,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:06:22,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:06:22,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:06:22,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:06:22,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:06:22,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:06:22,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:06:22,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:06:22,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:06:22,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:06:22,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:06:22,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:06:22,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 06:06:22,129 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:06:22,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:06:22,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:06:22,130 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:06:22,132 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:06:22,132 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:06:22,133 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:06:22,133 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:06:22,133 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:06:22,133 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:06:22,133 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:06:22,134 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:06:22,135 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:06:22,135 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:06:22,135 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:06:22,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:06:22,136 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:06:22,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:06:22,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:06:22,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:06:22,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:06:22,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:06:22,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:06:22,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:06:22,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:06:22,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:06:22,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:06:22,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:06:22,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:06:22,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:06:22,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:06:22,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:06:22,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:06:22,140 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:06:22,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:06:22,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:06:22,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:06:22,141 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:06:22,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:06:22,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:06:22,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:06:22,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:06:22,501 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:06:22,502 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.05.cil.c [2019-11-24 06:06:22,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75dc43195/d690a92a6c614429bcd7304ce65cb34b/FLAG1adac6913 [2019-11-24 06:06:23,057 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:06:23,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.05.cil.c [2019-11-24 06:06:23,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75dc43195/d690a92a6c614429bcd7304ce65cb34b/FLAG1adac6913 [2019-11-24 06:06:23,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75dc43195/d690a92a6c614429bcd7304ce65cb34b [2019-11-24 06:06:23,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:06:23,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:06:23,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:06:23,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:06:23,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:06:23,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:23,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddf204a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23, skipping insertion in model container [2019-11-24 06:06:23,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:23,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:06:23,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:06:23,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:06:23,726 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:06:23,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:06:23,913 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:06:23,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23 WrapperNode [2019-11-24 06:06:23,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:06:23,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:06:23,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:06:23,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:06:23,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:23,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:24,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:06:24,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:06:24,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:06:24,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:06:24,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:24,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:24,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:24,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:24,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:24,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:24,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (1/1) ... [2019-11-24 06:06:24,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:06:24,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:06:24,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:06:24,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:06:24,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (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-11-24 06:06:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:06:24,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:06:26,854 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:06:26,854 INFO L284 CfgBuilder]: Removed 181 assume(true) statements. [2019-11-24 06:06:26,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:06:26 BoogieIcfgContainer [2019-11-24 06:06:26,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:06:26,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:06:26,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:06:26,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:06:26,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:06:23" (1/3) ... [2019-11-24 06:06:26,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eba3a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:06:26, skipping insertion in model container [2019-11-24 06:06:26,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:23" (2/3) ... [2019-11-24 06:06:26,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eba3a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:06:26, skipping insertion in model container [2019-11-24 06:06:26,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:06:26" (3/3) ... [2019-11-24 06:06:26,863 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.05.cil.c [2019-11-24 06:06:26,873 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:06:26,880 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:06:26,891 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:06:26,918 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:06:26,919 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:06:26,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:06:26,919 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:06:26,919 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:06:26,920 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:06:26,920 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:06:26,920 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:06:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states. [2019-11-24 06:06:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 06:06:26,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:26,949 INFO L410 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] [2019-11-24 06:06:26,950 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:26,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:26,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1578767305, now seen corresponding path program 1 times [2019-11-24 06:06:26,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:26,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386921600] [2019-11-24 06:06:26,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:27,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386921600] [2019-11-24 06:06:27,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:27,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:27,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086520450] [2019-11-24 06:06:27,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:27,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:27,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:27,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:27,171 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 3 states. [2019-11-24 06:06:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:27,349 INFO L93 Difference]: Finished difference Result 670 states and 1027 transitions. [2019-11-24 06:06:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:27,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 06:06:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:27,369 INFO L225 Difference]: With dead ends: 670 [2019-11-24 06:06:27,369 INFO L226 Difference]: Without dead ends: 433 [2019-11-24 06:06:27,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-24 06:06:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 408. [2019-11-24 06:06:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-24 06:06:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 612 transitions. [2019-11-24 06:06:27,446 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 612 transitions. Word has length 32 [2019-11-24 06:06:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:27,446 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 612 transitions. [2019-11-24 06:06:27,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 612 transitions. [2019-11-24 06:06:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 06:06:27,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:27,449 INFO L410 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] [2019-11-24 06:06:27,449 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:27,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash 944729016, now seen corresponding path program 1 times [2019-11-24 06:06:27,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:27,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199956293] [2019-11-24 06:06:27,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:27,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199956293] [2019-11-24 06:06:27,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:27,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:27,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029255822] [2019-11-24 06:06:27,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:27,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:27,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:27,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:27,508 INFO L87 Difference]: Start difference. First operand 408 states and 612 transitions. Second operand 3 states. [2019-11-24 06:06:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:27,584 INFO L93 Difference]: Finished difference Result 1136 states and 1703 transitions. [2019-11-24 06:06:27,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:27,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 06:06:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:27,589 INFO L225 Difference]: With dead ends: 1136 [2019-11-24 06:06:27,589 INFO L226 Difference]: Without dead ends: 733 [2019-11-24 06:06:27,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-11-24 06:06:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 729. [2019-11-24 06:06:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-11-24 06:06:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1080 transitions. [2019-11-24 06:06:27,629 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1080 transitions. Word has length 32 [2019-11-24 06:06:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:27,629 INFO L462 AbstractCegarLoop]: Abstraction has 729 states and 1080 transitions. [2019-11-24 06:06:27,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1080 transitions. [2019-11-24 06:06:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 06:06:27,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:27,631 INFO L410 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] [2019-11-24 06:06:27,632 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:27,632 INFO L82 PathProgramCache]: Analyzing trace with hash 636290007, now seen corresponding path program 1 times [2019-11-24 06:06:27,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:27,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395253463] [2019-11-24 06:06:27,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:27,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395253463] [2019-11-24 06:06:27,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:27,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:27,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610576512] [2019-11-24 06:06:27,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:27,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:27,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:27,736 INFO L87 Difference]: Start difference. First operand 729 states and 1080 transitions. Second operand 3 states. [2019-11-24 06:06:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:27,849 INFO L93 Difference]: Finished difference Result 2039 states and 3020 transitions. [2019-11-24 06:06:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:27,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 06:06:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:27,861 INFO L225 Difference]: With dead ends: 2039 [2019-11-24 06:06:27,862 INFO L226 Difference]: Without dead ends: 1322 [2019-11-24 06:06:27,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-24 06:06:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1316. [2019-11-24 06:06:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-11-24 06:06:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1925 transitions. [2019-11-24 06:06:27,915 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1925 transitions. Word has length 32 [2019-11-24 06:06:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:27,916 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 1925 transitions. [2019-11-24 06:06:27,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1925 transitions. [2019-11-24 06:06:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 06:06:27,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:27,924 INFO L410 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] [2019-11-24 06:06:27,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash 522903350, now seen corresponding path program 1 times [2019-11-24 06:06:27,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:27,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529444153] [2019-11-24 06:06:27,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:28,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529444153] [2019-11-24 06:06:28,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:28,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:28,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700399954] [2019-11-24 06:06:28,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:28,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:28,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:28,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:28,038 INFO L87 Difference]: Start difference. First operand 1316 states and 1925 transitions. Second operand 3 states. [2019-11-24 06:06:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:28,148 INFO L93 Difference]: Finished difference Result 3852 states and 5616 transitions. [2019-11-24 06:06:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:28,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 06:06:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:28,163 INFO L225 Difference]: With dead ends: 3852 [2019-11-24 06:06:28,163 INFO L226 Difference]: Without dead ends: 2555 [2019-11-24 06:06:28,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-11-24 06:06:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2547. [2019-11-24 06:06:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2547 states. [2019-11-24 06:06:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 3654 transitions. [2019-11-24 06:06:28,296 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 3654 transitions. Word has length 32 [2019-11-24 06:06:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:28,297 INFO L462 AbstractCegarLoop]: Abstraction has 2547 states and 3654 transitions. [2019-11-24 06:06:28,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3654 transitions. [2019-11-24 06:06:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:06:28,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:28,300 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:28,300 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1540547899, now seen corresponding path program 1 times [2019-11-24 06:06:28,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:28,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359936423] [2019-11-24 06:06:28,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:28,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359936423] [2019-11-24 06:06:28,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:28,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:28,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522315106] [2019-11-24 06:06:28,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:28,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:28,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:28,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:28,400 INFO L87 Difference]: Start difference. First operand 2547 states and 3654 transitions. Second operand 4 states. [2019-11-24 06:06:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:28,648 INFO L93 Difference]: Finished difference Result 8181 states and 11819 transitions. [2019-11-24 06:06:28,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:28,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-24 06:06:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:28,677 INFO L225 Difference]: With dead ends: 8181 [2019-11-24 06:06:28,678 INFO L226 Difference]: Without dead ends: 5655 [2019-11-24 06:06:28,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2019-11-24 06:06:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 2955. [2019-11-24 06:06:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2955 states. [2019-11-24 06:06:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 4366 transitions. [2019-11-24 06:06:28,838 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 4366 transitions. Word has length 43 [2019-11-24 06:06:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:28,838 INFO L462 AbstractCegarLoop]: Abstraction has 2955 states and 4366 transitions. [2019-11-24 06:06:28,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4366 transitions. [2019-11-24 06:06:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 06:06:28,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:28,844 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:28,844 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash -531056605, now seen corresponding path program 1 times [2019-11-24 06:06:28,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:28,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260012928] [2019-11-24 06:06:28,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:28,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260012928] [2019-11-24 06:06:28,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:28,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:28,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604023688] [2019-11-24 06:06:28,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:28,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:28,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:28,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:28,942 INFO L87 Difference]: Start difference. First operand 2955 states and 4366 transitions. Second operand 3 states. [2019-11-24 06:06:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:29,193 INFO L93 Difference]: Finished difference Result 7747 states and 11548 transitions. [2019-11-24 06:06:29,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:29,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-24 06:06:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:29,215 INFO L225 Difference]: With dead ends: 7747 [2019-11-24 06:06:29,215 INFO L226 Difference]: Without dead ends: 4813 [2019-11-24 06:06:29,220 INFO L630 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-11-24 06:06:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2019-11-24 06:06:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 3691. [2019-11-24 06:06:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3691 states. [2019-11-24 06:06:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5630 transitions. [2019-11-24 06:06:29,375 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 5630 transitions. Word has length 65 [2019-11-24 06:06:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:29,375 INFO L462 AbstractCegarLoop]: Abstraction has 3691 states and 5630 transitions. [2019-11-24 06:06:29,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 5630 transitions. [2019-11-24 06:06:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 06:06:29,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:29,381 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:29,381 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:29,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1696936589, now seen corresponding path program 1 times [2019-11-24 06:06:29,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:29,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547330651] [2019-11-24 06:06:29,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:29,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547330651] [2019-11-24 06:06:29,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:29,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:29,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352713402] [2019-11-24 06:06:29,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:29,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:29,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:29,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:29,433 INFO L87 Difference]: Start difference. First operand 3691 states and 5630 transitions. Second operand 3 states. [2019-11-24 06:06:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:29,661 INFO L93 Difference]: Finished difference Result 9403 states and 14516 transitions. [2019-11-24 06:06:29,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:29,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-24 06:06:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:29,689 INFO L225 Difference]: With dead ends: 9403 [2019-11-24 06:06:29,690 INFO L226 Difference]: Without dead ends: 5733 [2019-11-24 06:06:29,747 INFO L630 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-11-24 06:06:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2019-11-24 06:06:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 5035. [2019-11-24 06:06:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5035 states. [2019-11-24 06:06:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 7902 transitions. [2019-11-24 06:06:30,041 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 7902 transitions. Word has length 65 [2019-11-24 06:06:30,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:30,042 INFO L462 AbstractCegarLoop]: Abstraction has 5035 states and 7902 transitions. [2019-11-24 06:06:30,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 7902 transitions. [2019-11-24 06:06:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 06:06:30,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:30,058 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:30,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:30,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1173651806, now seen corresponding path program 1 times [2019-11-24 06:06:30,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:30,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588857585] [2019-11-24 06:06:30,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:30,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588857585] [2019-11-24 06:06:30,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:30,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:30,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182049824] [2019-11-24 06:06:30,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:30,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:30,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:30,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:30,144 INFO L87 Difference]: Start difference. First operand 5035 states and 7902 transitions. Second operand 3 states. [2019-11-24 06:06:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:30,506 INFO L93 Difference]: Finished difference Result 12923 states and 20572 transitions. [2019-11-24 06:06:30,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:30,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-24 06:06:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:30,629 INFO L225 Difference]: With dead ends: 12923 [2019-11-24 06:06:30,629 INFO L226 Difference]: Without dead ends: 7909 [2019-11-24 06:06:30,637 INFO L630 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-11-24 06:06:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7909 states. [2019-11-24 06:06:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7909 to 7659. [2019-11-24 06:06:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7659 states. [2019-11-24 06:06:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7659 states to 7659 states and 12254 transitions. [2019-11-24 06:06:30,987 INFO L78 Accepts]: Start accepts. Automaton has 7659 states and 12254 transitions. Word has length 65 [2019-11-24 06:06:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:30,988 INFO L462 AbstractCegarLoop]: Abstraction has 7659 states and 12254 transitions. [2019-11-24 06:06:30,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 7659 states and 12254 transitions. [2019-11-24 06:06:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 06:06:31,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:31,003 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:31,003 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:31,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1784450205, now seen corresponding path program 1 times [2019-11-24 06:06:31,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:31,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027373838] [2019-11-24 06:06:31,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 06:06:31,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027373838] [2019-11-24 06:06:31,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:31,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:31,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400914625] [2019-11-24 06:06:31,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:31,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:31,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:31,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:31,082 INFO L87 Difference]: Start difference. First operand 7659 states and 12254 transitions. Second operand 3 states. [2019-11-24 06:06:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:31,637 INFO L93 Difference]: Finished difference Result 22388 states and 35837 transitions. [2019-11-24 06:06:31,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:31,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-24 06:06:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:31,675 INFO L225 Difference]: With dead ends: 22388 [2019-11-24 06:06:31,676 INFO L226 Difference]: Without dead ends: 14744 [2019-11-24 06:06:31,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14744 states. [2019-11-24 06:06:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14744 to 14614. [2019-11-24 06:06:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14614 states. [2019-11-24 06:06:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14614 states to 14614 states and 23271 transitions. [2019-11-24 06:06:32,288 INFO L78 Accepts]: Start accepts. Automaton has 14614 states and 23271 transitions. Word has length 66 [2019-11-24 06:06:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:32,289 INFO L462 AbstractCegarLoop]: Abstraction has 14614 states and 23271 transitions. [2019-11-24 06:06:32,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 14614 states and 23271 transitions. [2019-11-24 06:06:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 06:06:32,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:32,308 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:32,309 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:32,309 INFO L82 PathProgramCache]: Analyzing trace with hash -720382068, now seen corresponding path program 1 times [2019-11-24 06:06:32,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:32,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202310763] [2019-11-24 06:06:32,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 06:06:32,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202310763] [2019-11-24 06:06:32,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:32,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:32,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407059500] [2019-11-24 06:06:32,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:32,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:32,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:32,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:32,366 INFO L87 Difference]: Start difference. First operand 14614 states and 23271 transitions. Second operand 3 states. [2019-11-24 06:06:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:33,180 INFO L93 Difference]: Finished difference Result 42741 states and 68100 transitions. [2019-11-24 06:06:33,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:33,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-24 06:06:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:33,252 INFO L225 Difference]: With dead ends: 42741 [2019-11-24 06:06:33,252 INFO L226 Difference]: Without dead ends: 28135 [2019-11-24 06:06:33,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28135 states. [2019-11-24 06:06:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28135 to 27877. [2019-11-24 06:06:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27877 states. [2019-11-24 06:06:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27877 states to 27877 states and 44196 transitions. [2019-11-24 06:06:35,003 INFO L78 Accepts]: Start accepts. Automaton has 27877 states and 44196 transitions. Word has length 66 [2019-11-24 06:06:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:35,004 INFO L462 AbstractCegarLoop]: Abstraction has 27877 states and 44196 transitions. [2019-11-24 06:06:35,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 27877 states and 44196 transitions. [2019-11-24 06:06:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 06:06:35,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:35,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:35,029 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash 190607565, now seen corresponding path program 1 times [2019-11-24 06:06:35,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:35,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120164919] [2019-11-24 06:06:35,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:35,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120164919] [2019-11-24 06:06:35,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:35,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:35,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867851919] [2019-11-24 06:06:35,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:35,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:35,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:35,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:35,077 INFO L87 Difference]: Start difference. First operand 27877 states and 44196 transitions. Second operand 3 states. [2019-11-24 06:06:35,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:35,788 INFO L93 Difference]: Finished difference Result 42135 states and 67013 transitions. [2019-11-24 06:06:35,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:35,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-24 06:06:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:35,848 INFO L225 Difference]: With dead ends: 42135 [2019-11-24 06:06:35,849 INFO L226 Difference]: Without dead ends: 27877 [2019-11-24 06:06:35,872 INFO L630 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-11-24 06:06:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27877 states. [2019-11-24 06:06:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27877 to 27367. [2019-11-24 06:06:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27367 states. [2019-11-24 06:06:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27367 states to 27367 states and 43030 transitions. [2019-11-24 06:06:36,707 INFO L78 Accepts]: Start accepts. Automaton has 27367 states and 43030 transitions. Word has length 66 [2019-11-24 06:06:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:36,707 INFO L462 AbstractCegarLoop]: Abstraction has 27367 states and 43030 transitions. [2019-11-24 06:06:36,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 27367 states and 43030 transitions. [2019-11-24 06:06:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 06:06:36,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:36,731 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:36,731 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:36,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1469932300, now seen corresponding path program 1 times [2019-11-24 06:06:36,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:36,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664529621] [2019-11-24 06:06:36,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:36,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664529621] [2019-11-24 06:06:36,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:36,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:36,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679612839] [2019-11-24 06:06:36,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:36,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:36,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:36,781 INFO L87 Difference]: Start difference. First operand 27367 states and 43030 transitions. Second operand 3 states. [2019-11-24 06:06:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:37,438 INFO L93 Difference]: Finished difference Result 40859 states and 64425 transitions. [2019-11-24 06:06:37,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:37,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-24 06:06:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:37,488 INFO L225 Difference]: With dead ends: 40859 [2019-11-24 06:06:37,488 INFO L226 Difference]: Without dead ends: 27367 [2019-11-24 06:06:37,509 INFO L630 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-11-24 06:06:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27367 states. [2019-11-24 06:06:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27367 to 27367. [2019-11-24 06:06:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27367 states. [2019-11-24 06:06:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27367 states to 27367 states and 42902 transitions. [2019-11-24 06:06:38,953 INFO L78 Accepts]: Start accepts. Automaton has 27367 states and 42902 transitions. Word has length 66 [2019-11-24 06:06:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:38,954 INFO L462 AbstractCegarLoop]: Abstraction has 27367 states and 42902 transitions. [2019-11-24 06:06:38,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 27367 states and 42902 transitions. [2019-11-24 06:06:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 06:06:38,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:38,971 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:38,971 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:38,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:38,972 INFO L82 PathProgramCache]: Analyzing trace with hash -798399759, now seen corresponding path program 1 times [2019-11-24 06:06:38,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:38,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611054171] [2019-11-24 06:06:38,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:39,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611054171] [2019-11-24 06:06:39,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:39,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:06:39,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395855355] [2019-11-24 06:06:39,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:06:39,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:39,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:06:39,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:06:39,036 INFO L87 Difference]: Start difference. First operand 27367 states and 42902 transitions. Second operand 5 states. [2019-11-24 06:06:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:40,321 INFO L93 Difference]: Finished difference Result 55803 states and 86121 transitions. [2019-11-24 06:06:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:06:40,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-24 06:06:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:40,362 INFO L225 Difference]: With dead ends: 55803 [2019-11-24 06:06:40,362 INFO L226 Difference]: Without dead ends: 42311 [2019-11-24 06:06:40,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:06:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42311 states. [2019-11-24 06:06:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42311 to 29263. [2019-11-24 06:06:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29263 states. [2019-11-24 06:06:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29263 states to 29263 states and 45222 transitions. [2019-11-24 06:06:41,300 INFO L78 Accepts]: Start accepts. Automaton has 29263 states and 45222 transitions. Word has length 67 [2019-11-24 06:06:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:41,300 INFO L462 AbstractCegarLoop]: Abstraction has 29263 states and 45222 transitions. [2019-11-24 06:06:41,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:06:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 29263 states and 45222 transitions. [2019-11-24 06:06:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-24 06:06:41,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:41,322 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:41,322 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1526111410, now seen corresponding path program 1 times [2019-11-24 06:06:41,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:41,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291722203] [2019-11-24 06:06:41,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:41,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291722203] [2019-11-24 06:06:41,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:41,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:41,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996204195] [2019-11-24 06:06:41,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:41,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:41,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:41,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:41,379 INFO L87 Difference]: Start difference. First operand 29263 states and 45222 transitions. Second operand 3 states. [2019-11-24 06:06:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:41,994 INFO L93 Difference]: Finished difference Result 48027 states and 74457 transitions. [2019-11-24 06:06:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:41,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-24 06:06:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:42,023 INFO L225 Difference]: With dead ends: 48027 [2019-11-24 06:06:42,023 INFO L226 Difference]: Without dead ends: 29263 [2019-11-24 06:06:42,039 INFO L630 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-11-24 06:06:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29263 states. [2019-11-24 06:06:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29263 to 29263. [2019-11-24 06:06:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29263 states. [2019-11-24 06:06:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29263 states to 29263 states and 45006 transitions. [2019-11-24 06:06:43,501 INFO L78 Accepts]: Start accepts. Automaton has 29263 states and 45006 transitions. Word has length 92 [2019-11-24 06:06:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:43,501 INFO L462 AbstractCegarLoop]: Abstraction has 29263 states and 45006 transitions. [2019-11-24 06:06:43,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 29263 states and 45006 transitions. [2019-11-24 06:06:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-24 06:06:43,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:43,517 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:43,518 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:43,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1811927503, now seen corresponding path program 1 times [2019-11-24 06:06:43,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:43,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759545814] [2019-11-24 06:06:43,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:43,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759545814] [2019-11-24 06:06:43,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:43,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:43,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168423550] [2019-11-24 06:06:43,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:43,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:43,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:43,563 INFO L87 Difference]: Start difference. First operand 29263 states and 45006 transitions. Second operand 3 states. [2019-11-24 06:06:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:44,436 INFO L93 Difference]: Finished difference Result 47947 states and 73945 transitions. [2019-11-24 06:06:44,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:44,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-24 06:06:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:44,462 INFO L225 Difference]: With dead ends: 47947 [2019-11-24 06:06:44,462 INFO L226 Difference]: Without dead ends: 29183 [2019-11-24 06:06:44,477 INFO L630 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-11-24 06:06:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29183 states. [2019-11-24 06:06:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29183 to 28607. [2019-11-24 06:06:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28607 states. [2019-11-24 06:06:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28607 states to 28607 states and 43470 transitions. [2019-11-24 06:06:45,130 INFO L78 Accepts]: Start accepts. Automaton has 28607 states and 43470 transitions. Word has length 92 [2019-11-24 06:06:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:45,131 INFO L462 AbstractCegarLoop]: Abstraction has 28607 states and 43470 transitions. [2019-11-24 06:06:45,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 28607 states and 43470 transitions. [2019-11-24 06:06:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-24 06:06:45,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:45,149 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:45,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:45,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1503343060, now seen corresponding path program 1 times [2019-11-24 06:06:45,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:45,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321318950] [2019-11-24 06:06:45,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 06:06:45,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321318950] [2019-11-24 06:06:45,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:45,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:45,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351703696] [2019-11-24 06:06:45,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:45,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:45,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:45,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:45,210 INFO L87 Difference]: Start difference. First operand 28607 states and 43470 transitions. Second operand 3 states. [2019-11-24 06:06:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:46,544 INFO L93 Difference]: Finished difference Result 70715 states and 108052 transitions. [2019-11-24 06:06:46,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:46,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-24 06:06:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:46,605 INFO L225 Difference]: With dead ends: 70715 [2019-11-24 06:06:46,605 INFO L226 Difference]: Without dead ends: 55499 [2019-11-24 06:06:46,631 INFO L630 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-11-24 06:06:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55499 states. [2019-11-24 06:06:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55499 to 55495. [2019-11-24 06:06:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55495 states. [2019-11-24 06:06:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55495 states to 55495 states and 84738 transitions. [2019-11-24 06:06:49,008 INFO L78 Accepts]: Start accepts. Automaton has 55495 states and 84738 transitions. Word has length 94 [2019-11-24 06:06:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:49,008 INFO L462 AbstractCegarLoop]: Abstraction has 55495 states and 84738 transitions. [2019-11-24 06:06:49,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55495 states and 84738 transitions. [2019-11-24 06:06:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-24 06:06:49,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:49,040 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:49,040 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:49,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash 734020205, now seen corresponding path program 1 times [2019-11-24 06:06:49,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:49,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497058935] [2019-11-24 06:06:49,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:49,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497058935] [2019-11-24 06:06:49,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:49,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:49,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46695993] [2019-11-24 06:06:49,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:49,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:49,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:49,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:49,107 INFO L87 Difference]: Start difference. First operand 55495 states and 84738 transitions. Second operand 3 states. [2019-11-24 06:06:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:50,471 INFO L93 Difference]: Finished difference Result 84899 states and 129520 transitions. [2019-11-24 06:06:50,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:50,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-24 06:06:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:50,528 INFO L225 Difference]: With dead ends: 84899 [2019-11-24 06:06:50,528 INFO L226 Difference]: Without dead ends: 55339 [2019-11-24 06:06:50,553 INFO L630 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-11-24 06:06:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55339 states. [2019-11-24 06:06:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55339 to 55255. [2019-11-24 06:06:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55255 states. [2019-11-24 06:06:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55255 states to 55255 states and 83066 transitions. [2019-11-24 06:06:52,235 INFO L78 Accepts]: Start accepts. Automaton has 55255 states and 83066 transitions. Word has length 94 [2019-11-24 06:06:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:52,236 INFO L462 AbstractCegarLoop]: Abstraction has 55255 states and 83066 transitions. [2019-11-24 06:06:52,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 55255 states and 83066 transitions. [2019-11-24 06:06:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-24 06:06:52,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:52,260 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:52,260 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:52,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1048246064, now seen corresponding path program 1 times [2019-11-24 06:06:52,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:52,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506561539] [2019-11-24 06:06:52,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:52,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506561539] [2019-11-24 06:06:52,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:52,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:52,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815622101] [2019-11-24 06:06:52,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:52,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:52,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:52,328 INFO L87 Difference]: Start difference. First operand 55255 states and 83066 transitions. Second operand 4 states. [2019-11-24 06:06:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:56,541 INFO L93 Difference]: Finished difference Result 171219 states and 259787 transitions. [2019-11-24 06:06:56,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:56,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-24 06:06:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:56,660 INFO L225 Difference]: With dead ends: 171219 [2019-11-24 06:06:56,660 INFO L226 Difference]: Without dead ends: 115983 [2019-11-24 06:06:56,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115983 states. [2019-11-24 06:06:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115983 to 88023. [2019-11-24 06:06:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88023 states. [2019-11-24 06:06:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88023 states to 88023 states and 133754 transitions. [2019-11-24 06:06:59,524 INFO L78 Accepts]: Start accepts. Automaton has 88023 states and 133754 transitions. Word has length 95 [2019-11-24 06:06:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:59,524 INFO L462 AbstractCegarLoop]: Abstraction has 88023 states and 133754 transitions. [2019-11-24 06:06:59,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 88023 states and 133754 transitions. [2019-11-24 06:06:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-24 06:06:59,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:59,560 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:59,560 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1289768911, now seen corresponding path program 1 times [2019-11-24 06:06:59,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:59,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956808237] [2019-11-24 06:06:59,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-24 06:06:59,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956808237] [2019-11-24 06:06:59,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:59,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:59,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895148962] [2019-11-24 06:06:59,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:59,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:59,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:59,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:59,675 INFO L87 Difference]: Start difference. First operand 88023 states and 133754 transitions. Second operand 3 states. [2019-11-24 06:07:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:04,691 INFO L93 Difference]: Finished difference Result 212139 states and 321464 transitions. [2019-11-24 06:07:04,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:07:04,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-24 06:07:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:04,819 INFO L225 Difference]: With dead ends: 212139 [2019-11-24 06:07:04,820 INFO L226 Difference]: Without dead ends: 124135 [2019-11-24 06:07:04,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124135 states. [2019-11-24 06:07:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124135 to 124131. [2019-11-24 06:07:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124131 states. [2019-11-24 06:07:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124131 states to 124131 states and 183630 transitions. [2019-11-24 06:07:11,843 INFO L78 Accepts]: Start accepts. Automaton has 124131 states and 183630 transitions. Word has length 95 [2019-11-24 06:07:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:11,843 INFO L462 AbstractCegarLoop]: Abstraction has 124131 states and 183630 transitions. [2019-11-24 06:07:11,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:07:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 124131 states and 183630 transitions. [2019-11-24 06:07:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-24 06:07:11,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:11,891 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:07:11,891 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:11,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:11,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1793863741, now seen corresponding path program 1 times [2019-11-24 06:07:11,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:11,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803607730] [2019-11-24 06:07:11,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:07:11,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803607730] [2019-11-24 06:07:11,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:11,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:07:11,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636588451] [2019-11-24 06:07:11,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:07:11,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:11,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:07:11,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:07:11,938 INFO L87 Difference]: Start difference. First operand 124131 states and 183630 transitions. Second operand 4 states. [2019-11-24 06:07:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:17,374 INFO L93 Difference]: Finished difference Result 244655 states and 365165 transitions. [2019-11-24 06:07:17,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:07:17,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-24 06:07:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:17,542 INFO L225 Difference]: With dead ends: 244655 [2019-11-24 06:07:17,543 INFO L226 Difference]: Without dead ends: 162507 [2019-11-24 06:07:17,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:07:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162507 states. [2019-11-24 06:07:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162507 to 129527. [2019-11-24 06:07:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129527 states. [2019-11-24 06:07:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129527 states to 129527 states and 190430 transitions. [2019-11-24 06:07:25,233 INFO L78 Accepts]: Start accepts. Automaton has 129527 states and 190430 transitions. Word has length 96 [2019-11-24 06:07:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:25,234 INFO L462 AbstractCegarLoop]: Abstraction has 129527 states and 190430 transitions. [2019-11-24 06:07:25,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:07:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 129527 states and 190430 transitions. [2019-11-24 06:07:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-24 06:07:25,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:25,286 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:07:25,287 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 253976275, now seen corresponding path program 1 times [2019-11-24 06:07:25,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:25,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366456528] [2019-11-24 06:07:25,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 06:07:25,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366456528] [2019-11-24 06:07:25,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:25,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:07:25,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919563685] [2019-11-24 06:07:25,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:07:25,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:25,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:07:25,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:25,365 INFO L87 Difference]: Start difference. First operand 129527 states and 190430 transitions. Second operand 3 states. [2019-11-24 06:07:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:29,478 INFO L93 Difference]: Finished difference Result 252727 states and 370011 transitions. [2019-11-24 06:07:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:07:29,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-24 06:07:29,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:29,614 INFO L225 Difference]: With dead ends: 252727 [2019-11-24 06:07:29,614 INFO L226 Difference]: Without dead ends: 123219 [2019-11-24 06:07:29,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123219 states. [2019-11-24 06:07:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123219 to 123215. [2019-11-24 06:07:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123215 states. [2019-11-24 06:07:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123215 states to 123215 states and 176525 transitions. [2019-11-24 06:07:36,806 INFO L78 Accepts]: Start accepts. Automaton has 123215 states and 176525 transitions. Word has length 97 [2019-11-24 06:07:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:36,807 INFO L462 AbstractCegarLoop]: Abstraction has 123215 states and 176525 transitions. [2019-11-24 06:07:36,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:07:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 123215 states and 176525 transitions. [2019-11-24 06:07:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-24 06:07:36,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:36,859 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:07:36,859 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1319358533, now seen corresponding path program 1 times [2019-11-24 06:07:36,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:36,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754823991] [2019-11-24 06:07:36,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:07:36,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754823991] [2019-11-24 06:07:36,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:36,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:07:36,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271790080] [2019-11-24 06:07:36,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:07:36,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:36,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:07:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:07:36,954 INFO L87 Difference]: Start difference. First operand 123215 states and 176525 transitions. Second operand 5 states.