/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/product-lines/elevator_spec9_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:47:26,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:47:26,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:47:26,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:47:26,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:47:26,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:47:26,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:47:26,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:47:26,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:47:26,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:47:26,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:47:26,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:47:26,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:47:26,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:47:26,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:47:26,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:47:26,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:47:26,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:47:26,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:47:26,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:47:26,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:47:26,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:47:26,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:47:26,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:47:26,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:47:26,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:47:26,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:47:26,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:47:26,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:47:26,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:47:26,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:47:26,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:47:26,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:47:26,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:47:26,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:47:26,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:47:26,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:47:26,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:47:26,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:47:26,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:47:26,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:47:26,532 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 04:47:26,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:47:26,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:47:26,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:47:26,568 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:47:26,569 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:47:26,571 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:47:26,571 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:47:26,571 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:47:26,571 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:47:26,572 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:47:26,572 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:47:26,572 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:47:26,572 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:47:26,572 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:47:26,572 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:47:26,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:47:26,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:47:26,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:47:26,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:47:26,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:47:26,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:47:26,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:47:26,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:47:26,576 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:47:26,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:47:26,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:47:26,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:47:26,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:47:26,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:47:26,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:47:26,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:47:26,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:47:26,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:47:26,578 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:47:26,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:47:26,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:47:26,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:47:26,579 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:47:26,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:47:26,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:47:26,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:47:26,866 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:47:26,867 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:47:26,867 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-11-24 04:47:26,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8207fa3c9/79b18dbd9f5644dda254a196fb13c718/FLAG84b500b78 [2019-11-24 04:47:27,597 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:47:27,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-11-24 04:47:27,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8207fa3c9/79b18dbd9f5644dda254a196fb13c718/FLAG84b500b78 [2019-11-24 04:47:27,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8207fa3c9/79b18dbd9f5644dda254a196fb13c718 [2019-11-24 04:47:27,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:47:27,796 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:47:27,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:47:27,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:47:27,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:47:27,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:47:27" (1/1) ... [2019-11-24 04:47:27,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3364723e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:27, skipping insertion in model container [2019-11-24 04:47:27,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:47:27" (1/1) ... [2019-11-24 04:47:27,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:47:27,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:47:28,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:47:28,613 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:47:28,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:47:28,847 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:47:28,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28 WrapperNode [2019-11-24 04:47:28,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:47:28,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:47:28,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:47:28,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:47:28,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (1/1) ... [2019-11-24 04:47:28,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (1/1) ... [2019-11-24 04:47:29,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:47:29,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:47:29,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:47:29,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:47:29,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (1/1) ... [2019-11-24 04:47:29,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (1/1) ... [2019-11-24 04:47:29,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (1/1) ... [2019-11-24 04:47:29,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (1/1) ... [2019-11-24 04:47:29,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (1/1) ... [2019-11-24 04:47:29,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (1/1) ... [2019-11-24 04:47:29,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (1/1) ... [2019-11-24 04:47:29,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:47:29,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:47:29,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:47:29,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:47:29,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (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 04:47:29,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:47:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:47:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:47:29,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:48:04,083 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:48:04,083 INFO L284 CfgBuilder]: Removed 589 assume(true) statements. [2019-11-24 04:48:04,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:48:04 BoogieIcfgContainer [2019-11-24 04:48:04,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:48:04,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:48:04,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:48:04,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:48:04,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:47:27" (1/3) ... [2019-11-24 04:48:04,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d70940b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:48:04, skipping insertion in model container [2019-11-24 04:48:04,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:28" (2/3) ... [2019-11-24 04:48:04,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d70940b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:48:04, skipping insertion in model container [2019-11-24 04:48:04,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:48:04" (3/3) ... [2019-11-24 04:48:04,092 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2019-11-24 04:48:04,101 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:48:04,109 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:48:04,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:48:04,153 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:48:04,154 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:48:04,154 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:48:04,154 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:48:04,154 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:48:04,154 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:48:04,155 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:48:04,155 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:48:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states. [2019-11-24 04:48:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:48:04,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:04,196 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:04,197 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:04,203 INFO L82 PathProgramCache]: Analyzing trace with hash -469925775, now seen corresponding path program 1 times [2019-11-24 04:48:04,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:04,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632423386] [2019-11-24 04:48:04,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:04,669 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 04:48:04,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632423386] [2019-11-24 04:48:04,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:04,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:04,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912633977] [2019-11-24 04:48:04,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:48:04,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:04,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:48:04,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:48:04,694 INFO L87 Difference]: Start difference. First operand 737 states. Second operand 4 states. [2019-11-24 04:48:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:04,922 INFO L93 Difference]: Finished difference Result 1827 states and 3486 transitions. [2019-11-24 04:48:04,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:48:04,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-24 04:48:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:04,957 INFO L225 Difference]: With dead ends: 1827 [2019-11-24 04:48:04,958 INFO L226 Difference]: Without dead ends: 1339 [2019-11-24 04:48:04,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-11-24 04:48:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 960. [2019-11-24 04:48:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-11-24 04:48:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1839 transitions. [2019-11-24 04:48:05,092 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1839 transitions. Word has length 13 [2019-11-24 04:48:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:05,092 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 1839 transitions. [2019-11-24 04:48:05,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:48:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1839 transitions. [2019-11-24 04:48:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:48:05,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:05,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:05,099 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:05,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:05,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1682730382, now seen corresponding path program 1 times [2019-11-24 04:48:05,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:05,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405973499] [2019-11-24 04:48:05,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:05,274 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 04:48:05,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405973499] [2019-11-24 04:48:05,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:05,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:05,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284362183] [2019-11-24 04:48:05,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:48:05,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:05,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:48:05,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:48:05,280 INFO L87 Difference]: Start difference. First operand 960 states and 1839 transitions. Second operand 4 states. [2019-11-24 04:48:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:05,523 INFO L93 Difference]: Finished difference Result 1700 states and 3196 transitions. [2019-11-24 04:48:05,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:48:05,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-24 04:48:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:05,532 INFO L225 Difference]: With dead ends: 1700 [2019-11-24 04:48:05,532 INFO L226 Difference]: Without dead ends: 1311 [2019-11-24 04:48:05,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-11-24 04:48:05,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 964. [2019-11-24 04:48:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-24 04:48:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1843 transitions. [2019-11-24 04:48:05,573 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1843 transitions. Word has length 14 [2019-11-24 04:48:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:05,574 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1843 transitions. [2019-11-24 04:48:05,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:48:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1843 transitions. [2019-11-24 04:48:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:48:05,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:05,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:05,577 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash -515764414, now seen corresponding path program 1 times [2019-11-24 04:48:05,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:05,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204712390] [2019-11-24 04:48:05,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:05,672 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 04:48:05,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204712390] [2019-11-24 04:48:05,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:05,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:05,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77100208] [2019-11-24 04:48:05,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:05,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:05,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:05,678 INFO L87 Difference]: Start difference. First operand 964 states and 1843 transitions. Second operand 3 states. [2019-11-24 04:48:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:05,926 INFO L93 Difference]: Finished difference Result 1581 states and 3014 transitions. [2019-11-24 04:48:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:05,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:48:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:05,933 INFO L225 Difference]: With dead ends: 1581 [2019-11-24 04:48:05,934 INFO L226 Difference]: Without dead ends: 1202 [2019-11-24 04:48:05,935 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 04:48:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-11-24 04:48:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1128. [2019-11-24 04:48:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-11-24 04:48:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2150 transitions. [2019-11-24 04:48:05,975 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2150 transitions. Word has length 17 [2019-11-24 04:48:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:05,975 INFO L462 AbstractCegarLoop]: Abstraction has 1128 states and 2150 transitions. [2019-11-24 04:48:05,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2150 transitions. [2019-11-24 04:48:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:48:05,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:05,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:05,977 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:05,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1191190356, now seen corresponding path program 1 times [2019-11-24 04:48:05,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:05,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909852039] [2019-11-24 04:48:05,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:06,059 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 04:48:06,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909852039] [2019-11-24 04:48:06,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:06,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:06,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828079599] [2019-11-24 04:48:06,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:06,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:06,061 INFO L87 Difference]: Start difference. First operand 1128 states and 2150 transitions. Second operand 3 states. [2019-11-24 04:48:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:06,351 INFO L93 Difference]: Finished difference Result 2194 states and 4174 transitions. [2019-11-24 04:48:06,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:06,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 04:48:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:06,360 INFO L225 Difference]: With dead ends: 2194 [2019-11-24 04:48:06,361 INFO L226 Difference]: Without dead ends: 1673 [2019-11-24 04:48:06,362 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 04:48:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-11-24 04:48:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1449. [2019-11-24 04:48:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-11-24 04:48:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2750 transitions. [2019-11-24 04:48:06,410 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2750 transitions. Word has length 18 [2019-11-24 04:48:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:06,410 INFO L462 AbstractCegarLoop]: Abstraction has 1449 states and 2750 transitions. [2019-11-24 04:48:06,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2750 transitions. [2019-11-24 04:48:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:48:06,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:06,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:06,412 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:06,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:06,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1727786613, now seen corresponding path program 1 times [2019-11-24 04:48:06,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:06,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584659358] [2019-11-24 04:48:06,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:06,665 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 04:48:06,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584659358] [2019-11-24 04:48:06,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:06,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:06,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82849297] [2019-11-24 04:48:06,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:06,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:06,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:06,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:06,668 INFO L87 Difference]: Start difference. First operand 1449 states and 2750 transitions. Second operand 3 states. [2019-11-24 04:48:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:06,930 INFO L93 Difference]: Finished difference Result 2536 states and 4810 transitions. [2019-11-24 04:48:06,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:06,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:48:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:06,939 INFO L225 Difference]: With dead ends: 2536 [2019-11-24 04:48:06,939 INFO L226 Difference]: Without dead ends: 1447 [2019-11-24 04:48:06,941 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 04:48:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2019-11-24 04:48:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2019-11-24 04:48:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-11-24 04:48:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2735 transitions. [2019-11-24 04:48:06,995 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2735 transitions. Word has length 19 [2019-11-24 04:48:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:06,995 INFO L462 AbstractCegarLoop]: Abstraction has 1447 states and 2735 transitions. [2019-11-24 04:48:06,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2735 transitions. [2019-11-24 04:48:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:48:06,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:06,998 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] [2019-11-24 04:48:06,998 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2021759427, now seen corresponding path program 1 times [2019-11-24 04:48:06,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:07,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482485358] [2019-11-24 04:48:07,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:07,095 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 04:48:07,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482485358] [2019-11-24 04:48:07,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:07,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:07,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107680038] [2019-11-24 04:48:07,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:07,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:07,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:07,098 INFO L87 Difference]: Start difference. First operand 1447 states and 2735 transitions. Second operand 3 states. [2019-11-24 04:48:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:07,483 INFO L93 Difference]: Finished difference Result 3163 states and 5975 transitions. [2019-11-24 04:48:07,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:07,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:48:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:07,497 INFO L225 Difference]: With dead ends: 3163 [2019-11-24 04:48:07,497 INFO L226 Difference]: Without dead ends: 2359 [2019-11-24 04:48:07,500 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 04:48:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-11-24 04:48:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2059. [2019-11-24 04:48:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-11-24 04:48:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 3869 transitions. [2019-11-24 04:48:07,584 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 3869 transitions. Word has length 20 [2019-11-24 04:48:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:07,585 INFO L462 AbstractCegarLoop]: Abstraction has 2059 states and 3869 transitions. [2019-11-24 04:48:07,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 3869 transitions. [2019-11-24 04:48:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:48:07,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:07,590 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] [2019-11-24 04:48:07,591 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:07,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-11-24 04:48:07,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:07,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134083506] [2019-11-24 04:48:07,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:07,687 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 04:48:07,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134083506] [2019-11-24 04:48:07,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:07,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:07,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461683645] [2019-11-24 04:48:07,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:07,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:07,689 INFO L87 Difference]: Start difference. First operand 2059 states and 3869 transitions. Second operand 3 states. [2019-11-24 04:48:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:08,014 INFO L93 Difference]: Finished difference Result 2059 states and 3869 transitions. [2019-11-24 04:48:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:08,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:48:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:08,032 INFO L225 Difference]: With dead ends: 2059 [2019-11-24 04:48:08,032 INFO L226 Difference]: Without dead ends: 2052 [2019-11-24 04:48:08,033 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 04:48:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2019-11-24 04:48:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2052. [2019-11-24 04:48:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-11-24 04:48:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3854 transitions. [2019-11-24 04:48:08,149 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3854 transitions. Word has length 21 [2019-11-24 04:48:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:08,149 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 3854 transitions. [2019-11-24 04:48:08,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3854 transitions. [2019-11-24 04:48:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:48:08,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:08,152 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] [2019-11-24 04:48:08,153 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1367063911, now seen corresponding path program 1 times [2019-11-24 04:48:08,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:08,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595195042] [2019-11-24 04:48:08,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:08,380 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 04:48:08,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595195042] [2019-11-24 04:48:08,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:08,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:08,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411637519] [2019-11-24 04:48:08,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:08,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:08,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:08,383 INFO L87 Difference]: Start difference. First operand 2052 states and 3854 transitions. Second operand 3 states. [2019-11-24 04:48:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:09,649 INFO L93 Difference]: Finished difference Result 5173 states and 9653 transitions. [2019-11-24 04:48:09,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:09,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 04:48:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:09,667 INFO L225 Difference]: With dead ends: 5173 [2019-11-24 04:48:09,667 INFO L226 Difference]: Without dead ends: 3283 [2019-11-24 04:48:09,671 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 04:48:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2019-11-24 04:48:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 1992. [2019-11-24 04:48:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2019-11-24 04:48:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 3704 transitions. [2019-11-24 04:48:09,775 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 3704 transitions. Word has length 29 [2019-11-24 04:48:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:09,775 INFO L462 AbstractCegarLoop]: Abstraction has 1992 states and 3704 transitions. [2019-11-24 04:48:09,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 3704 transitions. [2019-11-24 04:48:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:48:09,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:09,778 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] [2019-11-24 04:48:09,778 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash -918450648, now seen corresponding path program 1 times [2019-11-24 04:48:09,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:09,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409505776] [2019-11-24 04:48:09,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:09,974 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 04:48:09,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409505776] [2019-11-24 04:48:09,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:09,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:09,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008465925] [2019-11-24 04:48:09,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:09,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:09,977 INFO L87 Difference]: Start difference. First operand 1992 states and 3704 transitions. Second operand 3 states. [2019-11-24 04:48:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:11,132 INFO L93 Difference]: Finished difference Result 5043 states and 9348 transitions. [2019-11-24 04:48:11,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:11,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-24 04:48:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:11,150 INFO L225 Difference]: With dead ends: 5043 [2019-11-24 04:48:11,150 INFO L226 Difference]: Without dead ends: 3235 [2019-11-24 04:48:11,154 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 04:48:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2019-11-24 04:48:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 1947. [2019-11-24 04:48:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-11-24 04:48:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 3569 transitions. [2019-11-24 04:48:11,272 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 3569 transitions. Word has length 30 [2019-11-24 04:48:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:11,272 INFO L462 AbstractCegarLoop]: Abstraction has 1947 states and 3569 transitions. [2019-11-24 04:48:11,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 3569 transitions. [2019-11-24 04:48:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:48:11,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:11,280 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 04:48:11,280 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash -780982707, now seen corresponding path program 1 times [2019-11-24 04:48:11,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:11,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934832327] [2019-11-24 04:48:11,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:11,607 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 04:48:11,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934832327] [2019-11-24 04:48:11,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:11,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:11,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518354392] [2019-11-24 04:48:11,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:11,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:11,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:11,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:11,613 INFO L87 Difference]: Start difference. First operand 1947 states and 3569 transitions. Second operand 3 states. [2019-11-24 04:48:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:12,491 INFO L93 Difference]: Finished difference Result 4938 states and 9068 transitions. [2019-11-24 04:48:12,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:12,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 04:48:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:12,508 INFO L225 Difference]: With dead ends: 4938 [2019-11-24 04:48:12,508 INFO L226 Difference]: Without dead ends: 3202 [2019-11-24 04:48:12,512 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 04:48:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2019-11-24 04:48:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 1917. [2019-11-24 04:48:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1917 states. [2019-11-24 04:48:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 3449 transitions. [2019-11-24 04:48:12,611 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 3449 transitions. Word has length 32 [2019-11-24 04:48:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:12,611 INFO L462 AbstractCegarLoop]: Abstraction has 1917 states and 3449 transitions. [2019-11-24 04:48:12,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 3449 transitions. [2019-11-24 04:48:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:48:12,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:12,613 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, 1, 1, 1] [2019-11-24 04:48:12,613 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash 500940089, now seen corresponding path program 1 times [2019-11-24 04:48:12,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:12,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542897638] [2019-11-24 04:48:12,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:12,845 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 04:48:12,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542897638] [2019-11-24 04:48:12,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:12,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:12,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419953598] [2019-11-24 04:48:12,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:12,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:12,848 INFO L87 Difference]: Start difference. First operand 1917 states and 3449 transitions. Second operand 3 states. [2019-11-24 04:48:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:13,827 INFO L93 Difference]: Finished difference Result 4858 states and 8813 transitions. [2019-11-24 04:48:13,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:13,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:48:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:13,845 INFO L225 Difference]: With dead ends: 4858 [2019-11-24 04:48:13,846 INFO L226 Difference]: Without dead ends: 3184 [2019-11-24 04:48:13,850 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 04:48:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-11-24 04:48:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 1902. [2019-11-24 04:48:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-11-24 04:48:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 3344 transitions. [2019-11-24 04:48:14,068 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 3344 transitions. Word has length 35 [2019-11-24 04:48:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:14,068 INFO L462 AbstractCegarLoop]: Abstraction has 1902 states and 3344 transitions. [2019-11-24 04:48:14,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3344 transitions. [2019-11-24 04:48:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:48:14,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:14,071 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:14,072 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash 447547523, now seen corresponding path program 1 times [2019-11-24 04:48:14,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:14,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506835565] [2019-11-24 04:48:14,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:14,295 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 04:48:14,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506835565] [2019-11-24 04:48:14,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:14,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:14,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576298518] [2019-11-24 04:48:14,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:14,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:14,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:14,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:14,299 INFO L87 Difference]: Start difference. First operand 1902 states and 3344 transitions. Second operand 3 states. [2019-11-24 04:48:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:15,049 INFO L93 Difference]: Finished difference Result 3668 states and 6491 transitions. [2019-11-24 04:48:15,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:15,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:48:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:15,056 INFO L225 Difference]: With dead ends: 3668 [2019-11-24 04:48:15,056 INFO L226 Difference]: Without dead ends: 2046 [2019-11-24 04:48:15,060 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 04:48:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2019-11-24 04:48:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1902. [2019-11-24 04:48:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-11-24 04:48:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 3254 transitions. [2019-11-24 04:48:15,154 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 3254 transitions. Word has length 39 [2019-11-24 04:48:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:15,155 INFO L462 AbstractCegarLoop]: Abstraction has 1902 states and 3254 transitions. [2019-11-24 04:48:15,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3254 transitions. [2019-11-24 04:48:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:48:15,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:15,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:15,157 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1894435614, now seen corresponding path program 1 times [2019-11-24 04:48:15,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:15,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018306522] [2019-11-24 04:48:15,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:15,489 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 04:48:15,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018306522] [2019-11-24 04:48:15,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:15,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:15,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63807720] [2019-11-24 04:48:15,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:15,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:15,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:15,494 INFO L87 Difference]: Start difference. First operand 1902 states and 3254 transitions. Second operand 5 states. [2019-11-24 04:48:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:16,828 INFO L93 Difference]: Finished difference Result 6740 states and 12148 transitions. [2019-11-24 04:48:16,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:48:16,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-24 04:48:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:16,844 INFO L225 Difference]: With dead ends: 6740 [2019-11-24 04:48:16,844 INFO L226 Difference]: Without dead ends: 4853 [2019-11-24 04:48:16,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:48:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4853 states. [2019-11-24 04:48:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4853 to 2024. [2019-11-24 04:48:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-11-24 04:48:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 3454 transitions. [2019-11-24 04:48:17,001 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 3454 transitions. Word has length 43 [2019-11-24 04:48:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:17,001 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 3454 transitions. [2019-11-24 04:48:17,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 3454 transitions. [2019-11-24 04:48:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:48:17,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:17,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:17,003 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2000240910, now seen corresponding path program 1 times [2019-11-24 04:48:17,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:17,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057787212] [2019-11-24 04:48:17,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:17,353 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 04:48:17,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057787212] [2019-11-24 04:48:17,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:17,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:17,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231562310] [2019-11-24 04:48:17,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:48:17,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:17,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:48:17,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:48:17,356 INFO L87 Difference]: Start difference. First operand 2024 states and 3454 transitions. Second operand 4 states. [2019-11-24 04:48:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:17,601 INFO L93 Difference]: Finished difference Result 5448 states and 9409 transitions. [2019-11-24 04:48:17,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:48:17,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-24 04:48:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:17,609 INFO L225 Difference]: With dead ends: 5448 [2019-11-24 04:48:17,610 INFO L226 Difference]: Without dead ends: 3577 [2019-11-24 04:48:17,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2019-11-24 04:48:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 2027. [2019-11-24 04:48:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-11-24 04:48:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 3456 transitions. [2019-11-24 04:48:17,745 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 3456 transitions. Word has length 44 [2019-11-24 04:48:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:17,745 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 3456 transitions. [2019-11-24 04:48:17,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:48:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 3456 transitions. [2019-11-24 04:48:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:48:17,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:17,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:17,747 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:17,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:17,748 INFO L82 PathProgramCache]: Analyzing trace with hash 65459597, now seen corresponding path program 1 times [2019-11-24 04:48:17,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:17,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745327337] [2019-11-24 04:48:17,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:17,980 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 04:48:17,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745327337] [2019-11-24 04:48:17,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:17,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:17,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583048073] [2019-11-24 04:48:17,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:17,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:17,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:17,983 INFO L87 Difference]: Start difference. First operand 2027 states and 3456 transitions. Second operand 5 states. [2019-11-24 04:48:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:18,298 INFO L93 Difference]: Finished difference Result 3050 states and 5026 transitions. [2019-11-24 04:48:18,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:48:18,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-24 04:48:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:18,305 INFO L225 Difference]: With dead ends: 3050 [2019-11-24 04:48:18,306 INFO L226 Difference]: Without dead ends: 3032 [2019-11-24 04:48:18,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:48:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2019-11-24 04:48:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2041. [2019-11-24 04:48:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2019-11-24 04:48:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 3470 transitions. [2019-11-24 04:48:18,502 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 3470 transitions. Word has length 47 [2019-11-24 04:48:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:18,502 INFO L462 AbstractCegarLoop]: Abstraction has 2041 states and 3470 transitions. [2019-11-24 04:48:18,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 3470 transitions. [2019-11-24 04:48:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:48:18,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:18,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:18,505 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:18,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1146789368, now seen corresponding path program 1 times [2019-11-24 04:48:18,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:18,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13019342] [2019-11-24 04:48:18,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:18,729 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 04:48:18,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13019342] [2019-11-24 04:48:18,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:18,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:18,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719810876] [2019-11-24 04:48:18,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:18,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:18,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:18,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:18,731 INFO L87 Difference]: Start difference. First operand 2041 states and 3470 transitions. Second operand 3 states. [2019-11-24 04:48:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:18,900 INFO L93 Difference]: Finished difference Result 2063 states and 3493 transitions. [2019-11-24 04:48:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:18,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-24 04:48:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:18,908 INFO L225 Difference]: With dead ends: 2063 [2019-11-24 04:48:18,908 INFO L226 Difference]: Without dead ends: 2045 [2019-11-24 04:48:18,909 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 04:48:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2019-11-24 04:48:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 2041. [2019-11-24 04:48:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2019-11-24 04:48:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 3456 transitions. [2019-11-24 04:48:19,134 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 3456 transitions. Word has length 48 [2019-11-24 04:48:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:19,135 INFO L462 AbstractCegarLoop]: Abstraction has 2041 states and 3456 transitions. [2019-11-24 04:48:19,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 3456 transitions. [2019-11-24 04:48:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:48:19,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:19,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:19,138 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1601419340, now seen corresponding path program 1 times [2019-11-24 04:48:19,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:19,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064101447] [2019-11-24 04:48:19,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:20,085 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 04:48:20,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064101447] [2019-11-24 04:48:20,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:20,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:48:20,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811620121] [2019-11-24 04:48:20,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:48:20,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:20,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:48:20,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:48:20,087 INFO L87 Difference]: Start difference. First operand 2041 states and 3456 transitions. Second operand 21 states. [2019-11-24 04:48:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:23,243 INFO L93 Difference]: Finished difference Result 6131 states and 10632 transitions. [2019-11-24 04:48:23,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:23,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-11-24 04:48:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:23,258 INFO L225 Difference]: With dead ends: 6131 [2019-11-24 04:48:23,258 INFO L226 Difference]: Without dead ends: 4248 [2019-11-24 04:48:23,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:48:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2019-11-24 04:48:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 2007. [2019-11-24 04:48:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-11-24 04:48:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3386 transitions. [2019-11-24 04:48:23,478 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3386 transitions. Word has length 49 [2019-11-24 04:48:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:23,478 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 3386 transitions. [2019-11-24 04:48:23,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:48:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3386 transitions. [2019-11-24 04:48:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:48:23,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:23,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:23,480 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1365117283, now seen corresponding path program 1 times [2019-11-24 04:48:23,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:23,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034963472] [2019-11-24 04:48:23,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:24,239 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 04:48:24,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034963472] [2019-11-24 04:48:24,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:24,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:48:24,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002524067] [2019-11-24 04:48:24,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:48:24,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:48:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:48:24,242 INFO L87 Difference]: Start difference. First operand 2007 states and 3386 transitions. Second operand 21 states. [2019-11-24 04:48:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:26,697 INFO L93 Difference]: Finished difference Result 6229 states and 10724 transitions. [2019-11-24 04:48:26,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:26,698 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2019-11-24 04:48:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:26,706 INFO L225 Difference]: With dead ends: 6229 [2019-11-24 04:48:26,707 INFO L226 Difference]: Without dead ends: 4361 [2019-11-24 04:48:26,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:48:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2019-11-24 04:48:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 2169. [2019-11-24 04:48:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-11-24 04:48:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3572 transitions. [2019-11-24 04:48:26,998 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3572 transitions. Word has length 51 [2019-11-24 04:48:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:26,998 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 3572 transitions. [2019-11-24 04:48:26,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:48:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3572 transitions. [2019-11-24 04:48:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 04:48:27,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:27,001 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, 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 04:48:27,001 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:27,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:27,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1867723015, now seen corresponding path program 1 times [2019-11-24 04:48:27,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:27,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618872929] [2019-11-24 04:48:27,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:27,238 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 04:48:27,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618872929] [2019-11-24 04:48:27,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:27,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:27,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929044668] [2019-11-24 04:48:27,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:48:27,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:27,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:48:27,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:48:27,242 INFO L87 Difference]: Start difference. First operand 2169 states and 3572 transitions. Second operand 4 states. [2019-11-24 04:48:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:28,456 INFO L93 Difference]: Finished difference Result 5465 states and 8952 transitions. [2019-11-24 04:48:28,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:48:28,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-24 04:48:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:28,460 INFO L225 Difference]: With dead ends: 5465 [2019-11-24 04:48:28,461 INFO L226 Difference]: Without dead ends: 3407 [2019-11-24 04:48:28,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2019-11-24 04:48:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 2176. [2019-11-24 04:48:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-11-24 04:48:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3569 transitions. [2019-11-24 04:48:28,955 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3569 transitions. Word has length 54 [2019-11-24 04:48:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:28,955 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3569 transitions. [2019-11-24 04:48:28,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:48:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3569 transitions. [2019-11-24 04:48:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 04:48:28,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:28,957 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, 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 04:48:28,957 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:28,958 INFO L82 PathProgramCache]: Analyzing trace with hash -784916478, now seen corresponding path program 1 times [2019-11-24 04:48:28,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:28,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941236579] [2019-11-24 04:48:28,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:29,733 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 04:48:29,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941236579] [2019-11-24 04:48:29,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:29,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:48:29,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157410528] [2019-11-24 04:48:29,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:48:29,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:29,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:48:29,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:48:29,735 INFO L87 Difference]: Start difference. First operand 2176 states and 3569 transitions. Second operand 21 states. [2019-11-24 04:48:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:32,315 INFO L93 Difference]: Finished difference Result 6067 states and 10062 transitions. [2019-11-24 04:48:32,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:32,315 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-11-24 04:48:32,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:32,319 INFO L225 Difference]: With dead ends: 6067 [2019-11-24 04:48:32,319 INFO L226 Difference]: Without dead ends: 4132 [2019-11-24 04:48:32,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:48:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4132 states. [2019-11-24 04:48:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4132 to 2539. [2019-11-24 04:48:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2539 states. [2019-11-24 04:48:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 4097 transitions. [2019-11-24 04:48:32,674 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 4097 transitions. Word has length 55 [2019-11-24 04:48:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:32,675 INFO L462 AbstractCegarLoop]: Abstraction has 2539 states and 4097 transitions. [2019-11-24 04:48:32,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:48:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 4097 transitions. [2019-11-24 04:48:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 04:48:32,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:32,678 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:48:32,678 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:32,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash 644781226, now seen corresponding path program 1 times [2019-11-24 04:48:32,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:32,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388313386] [2019-11-24 04:48:32,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:32,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388313386] [2019-11-24 04:48:32,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:32,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:32,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370301084] [2019-11-24 04:48:32,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:32,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:32,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:32,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:32,844 INFO L87 Difference]: Start difference. First operand 2539 states and 4097 transitions. Second operand 5 states. [2019-11-24 04:48:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:34,293 INFO L93 Difference]: Finished difference Result 6519 states and 10864 transitions. [2019-11-24 04:48:34,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:34,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-24 04:48:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:34,299 INFO L225 Difference]: With dead ends: 6519 [2019-11-24 04:48:34,300 INFO L226 Difference]: Without dead ends: 4188 [2019-11-24 04:48:34,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:48:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2019-11-24 04:48:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 2620. [2019-11-24 04:48:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2620 states. [2019-11-24 04:48:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 4178 transitions. [2019-11-24 04:48:34,561 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 4178 transitions. Word has length 63 [2019-11-24 04:48:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:34,561 INFO L462 AbstractCegarLoop]: Abstraction has 2620 states and 4178 transitions. [2019-11-24 04:48:34,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 4178 transitions. [2019-11-24 04:48:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 04:48:34,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:34,564 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:34,564 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash 513773454, now seen corresponding path program 1 times [2019-11-24 04:48:34,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:34,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809411197] [2019-11-24 04:48:34,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:34,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809411197] [2019-11-24 04:48:34,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:34,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:34,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157482443] [2019-11-24 04:48:34,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:34,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:34,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:34,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:34,716 INFO L87 Difference]: Start difference. First operand 2620 states and 4178 transitions. Second operand 5 states. [2019-11-24 04:48:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:35,941 INFO L93 Difference]: Finished difference Result 6600 states and 10905 transitions. [2019-11-24 04:48:35,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:35,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-24 04:48:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:35,948 INFO L225 Difference]: With dead ends: 6600 [2019-11-24 04:48:35,948 INFO L226 Difference]: Without dead ends: 4188 [2019-11-24 04:48:35,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:48:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2019-11-24 04:48:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 2620. [2019-11-24 04:48:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2620 states. [2019-11-24 04:48:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 4138 transitions. [2019-11-24 04:48:36,428 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 4138 transitions. Word has length 65 [2019-11-24 04:48:36,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:36,428 INFO L462 AbstractCegarLoop]: Abstraction has 2620 states and 4138 transitions. [2019-11-24 04:48:36,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 4138 transitions. [2019-11-24 04:48:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 04:48:36,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:36,431 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:36,431 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:36,432 INFO L82 PathProgramCache]: Analyzing trace with hash 100981670, now seen corresponding path program 1 times [2019-11-24 04:48:36,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:36,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868438046] [2019-11-24 04:48:36,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:48:36,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868438046] [2019-11-24 04:48:36,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:36,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:36,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121842667] [2019-11-24 04:48:36,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:36,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:36,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:36,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:36,557 INFO L87 Difference]: Start difference. First operand 2620 states and 4138 transitions. Second operand 5 states.