/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_spec2_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:42:11,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:42:11,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:42:11,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:42:11,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:42:11,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:42:11,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:42:11,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:42:11,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:42:11,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:42:11,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:42:11,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:42:11,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:42:11,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:42:11,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:42:11,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:42:11,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:42:11,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:42:11,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:42:11,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:42:11,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:42:11,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:42:11,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:42:11,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:42:11,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:42:11,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:42:11,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:42:11,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:42:11,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:42:11,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:42:11,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:42:11,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:42:11,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:42:11,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:42:11,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:42:11,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:42:11,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:42:11,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:42:11,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:42:11,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:42:11,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:42:11,403 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:42:11,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:42:11,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:42:11,427 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:42:11,427 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:42:11,428 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:42:11,428 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:42:11,428 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:42:11,428 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:42:11,428 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:42:11,429 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:42:11,430 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:42:11,430 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:42:11,430 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:42:11,430 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:42:11,431 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:42:11,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:42:11,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:42:11,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:42:11,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:42:11,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:42:11,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:42:11,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:42:11,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:42:11,434 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:42:11,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:42:11,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:42:11,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:42:11,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:42:11,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:42:11,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:42:11,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:42:11,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:42:11,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:42:11,437 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:42:11,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:42:11,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:42:11,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:42:11,438 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:42:11,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:42:11,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:42:11,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:42:11,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:42:11,756 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:42:11,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-11-24 04:42:11,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b71fd375/f1909cd0e42845c9a58e848ab0a95e7c/FLAG25db4e4a9 [2019-11-24 04:42:12,518 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:42:12,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-11-24 04:42:12,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b71fd375/f1909cd0e42845c9a58e848ab0a95e7c/FLAG25db4e4a9 [2019-11-24 04:42:12,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b71fd375/f1909cd0e42845c9a58e848ab0a95e7c [2019-11-24 04:42:12,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:42:12,762 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:42:12,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:42:12,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:42:12,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:42:12,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:12" (1/1) ... [2019-11-24 04:42:12,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339cab54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:12, skipping insertion in model container [2019-11-24 04:42:12,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:12" (1/1) ... [2019-11-24 04:42:12,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:42:12,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:42:13,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:42:13,610 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:42:13,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:42:13,836 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:42:13,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13 WrapperNode [2019-11-24 04:42:13,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:42:13,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:42:13,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:42:13,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:42:13,847 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:42:13" (1/1) ... [2019-11-24 04:42:13,878 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:42:13" (1/1) ... [2019-11-24 04:42:14,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:42:14,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:42:14,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:42:14,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:42:14,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13" (1/1) ... [2019-11-24 04:42:14,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13" (1/1) ... [2019-11-24 04:42:14,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13" (1/1) ... [2019-11-24 04:42:14,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13" (1/1) ... [2019-11-24 04:42:14,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13" (1/1) ... [2019-11-24 04:42:14,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13" (1/1) ... [2019-11-24 04:42:14,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13" (1/1) ... [2019-11-24 04:42:14,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:42:14,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:42:14,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:42:14,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:42:14,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13" (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:42:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:42:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:42:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:42:14,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:42:42,966 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:42:42,966 INFO L284 CfgBuilder]: Removed 601 assume(true) statements. [2019-11-24 04:42:42,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:42:42 BoogieIcfgContainer [2019-11-24 04:42:42,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:42:42,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:42:42,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:42:42,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:42:42,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:42:12" (1/3) ... [2019-11-24 04:42:42,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2e7e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:42:42, skipping insertion in model container [2019-11-24 04:42:42,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:13" (2/3) ... [2019-11-24 04:42:42,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2e7e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:42:42, skipping insertion in model container [2019-11-24 04:42:42,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:42:42" (3/3) ... [2019-11-24 04:42:42,976 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product25.cil.c [2019-11-24 04:42:42,986 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:42:42,995 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:42:43,006 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:42:43,039 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:42:43,039 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:42:43,039 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:42:43,040 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:42:43,040 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:42:43,040 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:42:43,040 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:42:43,040 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:42:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-11-24 04:42:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:42:43,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:43,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:43,084 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:42:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:43,091 INFO L82 PathProgramCache]: Analyzing trace with hash 767759188, now seen corresponding path program 1 times [2019-11-24 04:42:43,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:43,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052434403] [2019-11-24 04:42:43,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:43,557 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:42:43,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052434403] [2019-11-24 04:42:43,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:43,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:43,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136030778] [2019-11-24 04:42:43,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:42:43,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:43,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:42:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:42:43,582 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 4 states. [2019-11-24 04:42:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:43,782 INFO L93 Difference]: Finished difference Result 1843 states and 3518 transitions. [2019-11-24 04:42:43,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:42:43,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:42:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:43,815 INFO L225 Difference]: With dead ends: 1843 [2019-11-24 04:42:43,816 INFO L226 Difference]: Without dead ends: 1351 [2019-11-24 04:42:43,827 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:42:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-11-24 04:42:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 968. [2019-11-24 04:42:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-24 04:42:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1855 transitions. [2019-11-24 04:42:43,973 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1855 transitions. Word has length 15 [2019-11-24 04:42:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:43,973 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1855 transitions. [2019-11-24 04:42:43,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:42:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1855 transitions. [2019-11-24 04:42:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:42:43,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:43,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:43,983 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:42:43,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:43,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2119764432, now seen corresponding path program 1 times [2019-11-24 04:42:43,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:43,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760839822] [2019-11-24 04:42:43,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:44,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:42:44,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760839822] [2019-11-24 04:42:44,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:44,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:42:44,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524073536] [2019-11-24 04:42:44,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:42:44,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:44,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:42:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:42:44,302 INFO L87 Difference]: Start difference. First operand 968 states and 1855 transitions. Second operand 4 states. [2019-11-24 04:42:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:44,540 INFO L93 Difference]: Finished difference Result 1722 states and 3240 transitions. [2019-11-24 04:42:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:42:44,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:42:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:44,549 INFO L225 Difference]: With dead ends: 1722 [2019-11-24 04:42:44,549 INFO L226 Difference]: Without dead ends: 1329 [2019-11-24 04:42:44,551 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:42:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-11-24 04:42:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 972. [2019-11-24 04:42:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-24 04:42:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1859 transitions. [2019-11-24 04:42:44,582 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1859 transitions. Word has length 16 [2019-11-24 04:42:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:44,583 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1859 transitions. [2019-11-24 04:42:44,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:42:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1859 transitions. [2019-11-24 04:42:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:42:44,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:44,585 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:42:44,585 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:42:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash 428521521, now seen corresponding path program 1 times [2019-11-24 04:42:44,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:44,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107283715] [2019-11-24 04:42:44,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:44,677 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:42:44,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107283715] [2019-11-24 04:42:44,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:44,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:44,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719524368] [2019-11-24 04:42:44,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:44,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:44,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:44,680 INFO L87 Difference]: Start difference. First operand 972 states and 1859 transitions. Second operand 3 states. [2019-11-24 04:42:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:44,905 INFO L93 Difference]: Finished difference Result 1608 states and 3067 transitions. [2019-11-24 04:42:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:44,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:42:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:44,913 INFO L225 Difference]: With dead ends: 1608 [2019-11-24 04:42:44,914 INFO L226 Difference]: Without dead ends: 1216 [2019-11-24 04:42:44,915 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:42:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-11-24 04:42:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1142. [2019-11-24 04:42:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-11-24 04:42:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 2178 transitions. [2019-11-24 04:42:44,951 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 2178 transitions. Word has length 19 [2019-11-24 04:42:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:44,951 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 2178 transitions. [2019-11-24 04:42:44,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 2178 transitions. [2019-11-24 04:42:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:42:44,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:44,953 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:42:44,953 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:42:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash 805426978, now seen corresponding path program 1 times [2019-11-24 04:42:44,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:44,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126821368] [2019-11-24 04:42:44,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:45,039 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:42:45,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126821368] [2019-11-24 04:42:45,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:45,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:45,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067419346] [2019-11-24 04:42:45,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:45,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:45,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:45,042 INFO L87 Difference]: Start difference. First operand 1142 states and 2178 transitions. Second operand 3 states. [2019-11-24 04:42:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:45,309 INFO L93 Difference]: Finished difference Result 2227 states and 4239 transitions. [2019-11-24 04:42:45,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:45,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:42:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:45,319 INFO L225 Difference]: With dead ends: 2227 [2019-11-24 04:42:45,320 INFO L226 Difference]: Without dead ends: 1695 [2019-11-24 04:42:45,321 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:42:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-11-24 04:42:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1471. [2019-11-24 04:42:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-24 04:42:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2794 transitions. [2019-11-24 04:42:45,369 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2794 transitions. Word has length 21 [2019-11-24 04:42:45,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:45,369 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2794 transitions. [2019-11-24 04:42:45,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2794 transitions. [2019-11-24 04:42:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:42:45,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:45,371 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] [2019-11-24 04:42:45,371 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:42:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2107338431, now seen corresponding path program 1 times [2019-11-24 04:42:45,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:45,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980964857] [2019-11-24 04:42:45,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:45,448 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:42:45,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980964857] [2019-11-24 04:42:45,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:45,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:45,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897581112] [2019-11-24 04:42:45,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:45,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:45,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:45,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:45,450 INFO L87 Difference]: Start difference. First operand 1471 states and 2794 transitions. Second operand 3 states. [2019-11-24 04:42:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:45,686 INFO L93 Difference]: Finished difference Result 2583 states and 4899 transitions. [2019-11-24 04:42:45,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:45,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:42:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:45,695 INFO L225 Difference]: With dead ends: 2583 [2019-11-24 04:42:45,696 INFO L226 Difference]: Without dead ends: 1456 [2019-11-24 04:42:45,698 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:42:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-11-24 04:42:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1456. [2019-11-24 04:42:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1456 states. [2019-11-24 04:42:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2753 transitions. [2019-11-24 04:42:45,762 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2753 transitions. Word has length 23 [2019-11-24 04:42:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:45,763 INFO L462 AbstractCegarLoop]: Abstraction has 1456 states and 2753 transitions. [2019-11-24 04:42:45,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2753 transitions. [2019-11-24 04:42:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:42:45,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:45,765 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] [2019-11-24 04:42:45,765 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:42:45,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash 176016739, now seen corresponding path program 1 times [2019-11-24 04:42:45,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:45,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124228624] [2019-11-24 04:42:45,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:45,868 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:42:45,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124228624] [2019-11-24 04:42:45,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:45,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:45,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220048697] [2019-11-24 04:42:45,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:45,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:45,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:45,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:45,871 INFO L87 Difference]: Start difference. First operand 1456 states and 2753 transitions. Second operand 3 states. [2019-11-24 04:42:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:46,298 INFO L93 Difference]: Finished difference Result 3169 states and 5986 transitions. [2019-11-24 04:42:46,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:46,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:42:46,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:46,317 INFO L225 Difference]: With dead ends: 3169 [2019-11-24 04:42:46,317 INFO L226 Difference]: Without dead ends: 2363 [2019-11-24 04:42:46,323 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:42:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2019-11-24 04:42:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2063. [2019-11-24 04:42:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2019-11-24 04:42:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3877 transitions. [2019-11-24 04:42:46,419 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3877 transitions. Word has length 24 [2019-11-24 04:42:46,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:46,420 INFO L462 AbstractCegarLoop]: Abstraction has 2063 states and 3877 transitions. [2019-11-24 04:42:46,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3877 transitions. [2019-11-24 04:42:46,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:42:46,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:46,426 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] [2019-11-24 04:42:46,426 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:42:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1161569636, now seen corresponding path program 1 times [2019-11-24 04:42:46,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:46,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778387237] [2019-11-24 04:42:46,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:46,546 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:42:46,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778387237] [2019-11-24 04:42:46,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:46,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:46,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441744359] [2019-11-24 04:42:46,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:46,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:46,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:46,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:46,549 INFO L87 Difference]: Start difference. First operand 2063 states and 3877 transitions. Second operand 3 states. [2019-11-24 04:42:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:46,801 INFO L93 Difference]: Finished difference Result 2063 states and 3877 transitions. [2019-11-24 04:42:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:46,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:42:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:46,814 INFO L225 Difference]: With dead ends: 2063 [2019-11-24 04:42:46,814 INFO L226 Difference]: Without dead ends: 2056 [2019-11-24 04:42:46,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:42:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-11-24 04:42:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2056. [2019-11-24 04:42:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-11-24 04:42:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3862 transitions. [2019-11-24 04:42:46,936 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3862 transitions. Word has length 25 [2019-11-24 04:42:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:46,936 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 3862 transitions. [2019-11-24 04:42:46,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3862 transitions. [2019-11-24 04:42:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:42:46,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:46,940 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] [2019-11-24 04:42:46,940 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:42:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1356048664, now seen corresponding path program 1 times [2019-11-24 04:42:46,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:46,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232969589] [2019-11-24 04:42:46,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:47,261 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:42:47,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232969589] [2019-11-24 04:42:47,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:47,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:47,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334960757] [2019-11-24 04:42:47,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:47,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:47,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:47,264 INFO L87 Difference]: Start difference. First operand 2056 states and 3862 transitions. Second operand 3 states. [2019-11-24 04:42:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:48,442 INFO L93 Difference]: Finished difference Result 5189 states and 9685 transitions. [2019-11-24 04:42:48,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:48,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 04:42:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:48,463 INFO L225 Difference]: With dead ends: 5189 [2019-11-24 04:42:48,464 INFO L226 Difference]: Without dead ends: 3293 [2019-11-24 04:42:48,468 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:42:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-11-24 04:42:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 1996. [2019-11-24 04:42:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-11-24 04:42:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 3712 transitions. [2019-11-24 04:42:48,587 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 3712 transitions. Word has length 31 [2019-11-24 04:42:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:48,589 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 3712 transitions. [2019-11-24 04:42:48,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 3712 transitions. [2019-11-24 04:42:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:42:48,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:48,593 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:42:48,593 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:42:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:48,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1728865993, now seen corresponding path program 1 times [2019-11-24 04:42:48,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:48,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675258147] [2019-11-24 04:42:48,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:48,989 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:42:48,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675258147] [2019-11-24 04:42:48,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:48,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:48,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428271624] [2019-11-24 04:42:48,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:48,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:48,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:48,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:48,993 INFO L87 Difference]: Start difference. First operand 1996 states and 3712 transitions. Second operand 3 states. [2019-11-24 04:42:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:50,139 INFO L93 Difference]: Finished difference Result 5059 states and 9380 transitions. [2019-11-24 04:42:50,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:50,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 04:42:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:50,163 INFO L225 Difference]: With dead ends: 5059 [2019-11-24 04:42:50,163 INFO L226 Difference]: Without dead ends: 3245 [2019-11-24 04:42:50,168 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:42:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2019-11-24 04:42:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 1951. [2019-11-24 04:42:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2019-11-24 04:42:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3577 transitions. [2019-11-24 04:42:50,328 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3577 transitions. Word has length 32 [2019-11-24 04:42:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:50,328 INFO L462 AbstractCegarLoop]: Abstraction has 1951 states and 3577 transitions. [2019-11-24 04:42:50,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3577 transitions. [2019-11-24 04:42:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:42:50,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:50,331 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] [2019-11-24 04:42:50,332 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:42:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1826062748, now seen corresponding path program 1 times [2019-11-24 04:42:50,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:50,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657453109] [2019-11-24 04:42:50,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:50,695 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:42:50,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657453109] [2019-11-24 04:42:50,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:50,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:50,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929244003] [2019-11-24 04:42:50,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:50,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:50,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:50,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:50,698 INFO L87 Difference]: Start difference. First operand 1951 states and 3577 transitions. Second operand 3 states. [2019-11-24 04:42:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:51,767 INFO L93 Difference]: Finished difference Result 4954 states and 9100 transitions. [2019-11-24 04:42:51,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:51,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:42:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:51,792 INFO L225 Difference]: With dead ends: 4954 [2019-11-24 04:42:51,792 INFO L226 Difference]: Without dead ends: 3212 [2019-11-24 04:42:51,796 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:42:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2019-11-24 04:42:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 1921. [2019-11-24 04:42:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2019-11-24 04:42:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 3457 transitions. [2019-11-24 04:42:51,904 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 3457 transitions. Word has length 34 [2019-11-24 04:42:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:51,904 INFO L462 AbstractCegarLoop]: Abstraction has 1921 states and 3457 transitions. [2019-11-24 04:42:51,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 3457 transitions. [2019-11-24 04:42:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:42:51,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:51,906 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] [2019-11-24 04:42:51,906 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:42:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:51,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1052150176, now seen corresponding path program 1 times [2019-11-24 04:42:51,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:51,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102342624] [2019-11-24 04:42:51,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:52,161 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:42:52,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102342624] [2019-11-24 04:42:52,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:52,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:52,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607469452] [2019-11-24 04:42:52,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:52,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:52,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:52,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:52,164 INFO L87 Difference]: Start difference. First operand 1921 states and 3457 transitions. Second operand 3 states. [2019-11-24 04:42:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:53,051 INFO L93 Difference]: Finished difference Result 4874 states and 8845 transitions. [2019-11-24 04:42:53,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:53,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:42:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:53,065 INFO L225 Difference]: With dead ends: 4874 [2019-11-24 04:42:53,066 INFO L226 Difference]: Without dead ends: 3194 [2019-11-24 04:42:53,069 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:42:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2019-11-24 04:42:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 1906. [2019-11-24 04:42:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2019-11-24 04:42:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 3352 transitions. [2019-11-24 04:42:53,187 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 3352 transitions. Word has length 37 [2019-11-24 04:42:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:53,187 INFO L462 AbstractCegarLoop]: Abstraction has 1906 states and 3352 transitions. [2019-11-24 04:42:53,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 3352 transitions. [2019-11-24 04:42:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:42:53,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:53,189 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] [2019-11-24 04:42:53,190 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:42:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1940445802, now seen corresponding path program 1 times [2019-11-24 04:42:53,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:53,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047515740] [2019-11-24 04:42:53,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:53,397 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:42:53,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047515740] [2019-11-24 04:42:53,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:53,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:53,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539822404] [2019-11-24 04:42:53,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:53,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:53,399 INFO L87 Difference]: Start difference. First operand 1906 states and 3352 transitions. Second operand 3 states. [2019-11-24 04:42:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:54,112 INFO L93 Difference]: Finished difference Result 3676 states and 6507 transitions. [2019-11-24 04:42:54,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:54,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:42:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:54,117 INFO L225 Difference]: With dead ends: 3676 [2019-11-24 04:42:54,117 INFO L226 Difference]: Without dead ends: 2048 [2019-11-24 04:42:54,120 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:42:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-11-24 04:42:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1906. [2019-11-24 04:42:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2019-11-24 04:42:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 3262 transitions. [2019-11-24 04:42:54,222 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 3262 transitions. Word has length 41 [2019-11-24 04:42:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:54,223 INFO L462 AbstractCegarLoop]: Abstraction has 1906 states and 3262 transitions. [2019-11-24 04:42:54,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 3262 transitions. [2019-11-24 04:42:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:42:54,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:54,225 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] [2019-11-24 04:42:54,225 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:42:54,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:54,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1046364091, now seen corresponding path program 1 times [2019-11-24 04:42:54,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:54,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694207230] [2019-11-24 04:42:54,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:54,543 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:42:54,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694207230] [2019-11-24 04:42:54,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:54,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:42:54,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981333060] [2019-11-24 04:42:54,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:54,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:54,545 INFO L87 Difference]: Start difference. First operand 1906 states and 3262 transitions. Second operand 5 states. [2019-11-24 04:42:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:55,784 INFO L93 Difference]: Finished difference Result 6740 states and 12148 transitions. [2019-11-24 04:42:55,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:42:55,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:42:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:55,796 INFO L225 Difference]: With dead ends: 6740 [2019-11-24 04:42:55,796 INFO L226 Difference]: Without dead ends: 4849 [2019-11-24 04:42:55,800 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:42:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4849 states. [2019-11-24 04:42:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4849 to 2028. [2019-11-24 04:42:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2028 states. [2019-11-24 04:42:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 3462 transitions. [2019-11-24 04:42:55,996 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 3462 transitions. Word has length 45 [2019-11-24 04:42:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:55,996 INFO L462 AbstractCegarLoop]: Abstraction has 2028 states and 3462 transitions. [2019-11-24 04:42:55,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 3462 transitions. [2019-11-24 04:42:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:42:55,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:55,999 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] [2019-11-24 04:42:55,999 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:42:55,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1536139949, now seen corresponding path program 1 times [2019-11-24 04:42:56,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:56,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942241820] [2019-11-24 04:42:56,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:56,352 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:42:56,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942241820] [2019-11-24 04:42:56,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:56,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:42:56,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393923507] [2019-11-24 04:42:56,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 04:42:56,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:56,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 04:42:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:42:56,355 INFO L87 Difference]: Start difference. First operand 2028 states and 3462 transitions. Second operand 10 states. [2019-11-24 04:42:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:57,282 INFO L93 Difference]: Finished difference Result 3621 states and 6255 transitions. [2019-11-24 04:42:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:42:57,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-11-24 04:42:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:57,286 INFO L225 Difference]: With dead ends: 3621 [2019-11-24 04:42:57,286 INFO L226 Difference]: Without dead ends: 1665 [2019-11-24 04:42:57,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:42:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-11-24 04:42:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1569. [2019-11-24 04:42:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2019-11-24 04:42:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2753 transitions. [2019-11-24 04:42:57,396 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2753 transitions. Word has length 46 [2019-11-24 04:42:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:57,396 INFO L462 AbstractCegarLoop]: Abstraction has 1569 states and 2753 transitions. [2019-11-24 04:42:57,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 04:42:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2753 transitions. [2019-11-24 04:42:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:42:57,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:57,398 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] [2019-11-24 04:42:57,398 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:42:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:57,399 INFO L82 PathProgramCache]: Analyzing trace with hash -840219591, now seen corresponding path program 1 times [2019-11-24 04:42:57,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:57,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167320529] [2019-11-24 04:42:57,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:57,632 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:42:57,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167320529] [2019-11-24 04:42:57,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:57,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:42:57,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116683179] [2019-11-24 04:42:57,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:57,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:57,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:57,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:57,635 INFO L87 Difference]: Start difference. First operand 1569 states and 2753 transitions. Second operand 5 states. [2019-11-24 04:42:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:58,172 INFO L93 Difference]: Finished difference Result 4592 states and 8181 transitions. [2019-11-24 04:42:58,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:42:58,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-24 04:42:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:58,182 INFO L225 Difference]: With dead ends: 4592 [2019-11-24 04:42:58,182 INFO L226 Difference]: Without dead ends: 3095 [2019-11-24 04:42:58,186 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:42:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2019-11-24 04:42:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 1579. [2019-11-24 04:42:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2019-11-24 04:42:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2763 transitions. [2019-11-24 04:42:58,312 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2763 transitions. Word has length 64 [2019-11-24 04:42:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:58,313 INFO L462 AbstractCegarLoop]: Abstraction has 1579 states and 2763 transitions. [2019-11-24 04:42:58,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2763 transitions. [2019-11-24 04:42:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 04:42:58,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:58,314 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:42:58,315 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:42:58,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1857591291, now seen corresponding path program 1 times [2019-11-24 04:42:58,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:58,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044561472] [2019-11-24 04:42:58,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:59,085 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:42:59,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044561472] [2019-11-24 04:42:59,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:59,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:42:59,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507020125] [2019-11-24 04:42:59,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:42:59,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:59,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:42:59,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:42:59,087 INFO L87 Difference]: Start difference. First operand 1579 states and 2763 transitions. Second operand 22 states. [2019-11-24 04:43:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:00,586 INFO L93 Difference]: Finished difference Result 5267 states and 9309 transitions. [2019-11-24 04:43:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 04:43:00,586 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2019-11-24 04:43:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:00,592 INFO L225 Difference]: With dead ends: 5267 [2019-11-24 04:43:00,592 INFO L226 Difference]: Without dead ends: 3758 [2019-11-24 04:43:00,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2019-11-24 04:43:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2019-11-24 04:43:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 1724. [2019-11-24 04:43:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-11-24 04:43:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2938 transitions. [2019-11-24 04:43:00,808 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2938 transitions. Word has length 65 [2019-11-24 04:43:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:00,808 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 2938 transitions. [2019-11-24 04:43:00,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:43:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2938 transitions. [2019-11-24 04:43:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 04:43:00,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:00,810 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, 1] [2019-11-24 04:43:00,810 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:43:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash 172041498, now seen corresponding path program 1 times [2019-11-24 04:43:00,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:00,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965603617] [2019-11-24 04:43:00,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:00,980 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:43:00,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965603617] [2019-11-24 04:43:00,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:00,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:43:00,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001014568] [2019-11-24 04:43:00,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:43:00,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:00,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:43:00,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:43:00,982 INFO L87 Difference]: Start difference. First operand 1724 states and 2938 transitions. Second operand 6 states. [2019-11-24 04:43:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:01,592 INFO L93 Difference]: Finished difference Result 4895 states and 8539 transitions. [2019-11-24 04:43:01,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:43:01,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-24 04:43:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:01,598 INFO L225 Difference]: With dead ends: 4895 [2019-11-24 04:43:01,599 INFO L226 Difference]: Without dead ends: 3243 [2019-11-24 04:43:01,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:43:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2019-11-24 04:43:01,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 1724. [2019-11-24 04:43:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-11-24 04:43:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2921 transitions. [2019-11-24 04:43:01,812 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2921 transitions. Word has length 66 [2019-11-24 04:43:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:01,812 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 2921 transitions. [2019-11-24 04:43:01,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:43:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2921 transitions. [2019-11-24 04:43:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:43:01,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:01,818 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, 1, 1] [2019-11-24 04:43:01,818 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:43:01,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:01,819 INFO L82 PathProgramCache]: Analyzing trace with hash 588505832, now seen corresponding path program 1 times [2019-11-24 04:43:01,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:01,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294918476] [2019-11-24 04:43:01,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:02,069 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:43:02,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294918476] [2019-11-24 04:43:02,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:02,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:43:02,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282060953] [2019-11-24 04:43:02,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:02,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:02,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:02,071 INFO L87 Difference]: Start difference. First operand 1724 states and 2921 transitions. Second operand 5 states. [2019-11-24 04:43:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:03,447 INFO L93 Difference]: Finished difference Result 5268 states and 8943 transitions. [2019-11-24 04:43:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:43:03,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-24 04:43:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:03,451 INFO L225 Difference]: With dead ends: 5268 [2019-11-24 04:43:03,451 INFO L226 Difference]: Without dead ends: 3609 [2019-11-24 04:43:03,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:43:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2019-11-24 04:43:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 1840. [2019-11-24 04:43:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-11-24 04:43:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 3079 transitions. [2019-11-24 04:43:03,644 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 3079 transitions. Word has length 67 [2019-11-24 04:43:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:03,644 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 3079 transitions. [2019-11-24 04:43:03,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:43:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 3079 transitions. [2019-11-24 04:43:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 04:43:03,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:03,646 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, 1, 1, 1] [2019-11-24 04:43:03,647 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:43:03,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:03,647 INFO L82 PathProgramCache]: Analyzing trace with hash -694641751, now seen corresponding path program 1 times [2019-11-24 04:43:03,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:03,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678833995] [2019-11-24 04:43:03,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:43:04,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678833995] [2019-11-24 04:43:04,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640494958] [2019-11-24 04:43:04,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:43:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:04,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:43:04,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:43:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:43:05,140 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:43:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:43:05,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [401570565] [2019-11-24 04:43:05,308 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2019-11-24 04:43:05,309 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:43:05,315 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:43:05,321 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:43:05,322 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs