/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:47:35,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:47:35,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:47:35,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:47:35,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:47:35,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:47:35,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:47:35,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:47:35,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:47:35,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:47:35,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:47:35,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:47:35,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:47:35,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:47:35,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:47:35,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:47:35,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:47:35,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:47:35,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:47:35,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:47:35,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:47:35,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:47:35,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:47:35,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:47:35,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:47:35,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:47:35,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:47:35,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:47:35,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:47:35,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:47:35,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:47:35,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:47:35,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:47:35,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:47:35,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:47:35,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:47:35,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:47:35,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:47:35,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:47:35,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:47:35,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:47:35,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:47:35,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:47:35,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:47:35,586 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:47:35,586 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:47:35,586 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:47:35,586 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:47:35,586 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:47:35,587 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:47:35,587 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:47:35,587 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:47:35,587 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:47:35,588 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:47:35,588 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:47:35,588 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:47:35,588 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:47:35,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:47:35,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:47:35,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:47:35,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:47:35,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:47:35,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:47:35,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:47:35,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:47:35,591 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:47:35,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:47:35,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:47:35,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:47:35,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:47:35,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:47:35,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:47:35,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:47:35,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:47:35,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:47:35,593 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:47:35,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:47:35,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:47:35,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:47:35,594 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:47:35,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:47:35,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:47:35,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:47:35,936 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:47:35,936 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:47:35,937 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-11-24 04:47:35,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba259777/6027d776aeeb4fa3b59631061d34dff6/FLAG773e64000 [2019-11-24 04:47:36,604 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:47:36,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-11-24 04:47:36,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba259777/6027d776aeeb4fa3b59631061d34dff6/FLAG773e64000 [2019-11-24 04:47:36,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba259777/6027d776aeeb4fa3b59631061d34dff6 [2019-11-24 04:47:36,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:47:36,824 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:47:36,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:47:36,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:47:36,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:47:36,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:47:36" (1/1) ... [2019-11-24 04:47:36,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a2d471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:36, skipping insertion in model container [2019-11-24 04:47:36,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:47:36" (1/1) ... [2019-11-24 04:47:36,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:47:36,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:47:37,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:47:37,629 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:47:37,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:47:37,833 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:47:37,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37 WrapperNode [2019-11-24 04:47:37,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:47:37,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:47:37,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:47:37,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:47:37,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... [2019-11-24 04:47:37,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... [2019-11-24 04:47:38,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:47:38,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:47:38,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:47:38,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:47:38,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... [2019-11-24 04:47:38,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... [2019-11-24 04:47:38,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... [2019-11-24 04:47:38,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... [2019-11-24 04:47:38,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... [2019-11-24 04:47:38,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... [2019-11-24 04:47:38,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... [2019-11-24 04:47:38,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:47:38,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:47:38,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:47:38,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:47:38,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:47:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:47:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:47:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:47:38,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:48:11,290 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:48:11,290 INFO L284 CfgBuilder]: Removed 649 assume(true) statements. [2019-11-24 04:48:11,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:48:11 BoogieIcfgContainer [2019-11-24 04:48:11,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:48:11,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:48:11,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:48:11,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:48:11,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:47:36" (1/3) ... [2019-11-24 04:48:11,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f39bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:48:11, skipping insertion in model container [2019-11-24 04:48:11,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:37" (2/3) ... [2019-11-24 04:48:11,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f39bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:48:11, skipping insertion in model container [2019-11-24 04:48:11,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:48:11" (3/3) ... [2019-11-24 04:48:11,313 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product27.cil.c [2019-11-24 04:48:11,328 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:48:11,350 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:48:11,368 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:48:11,436 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:48:11,437 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:48:11,437 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:48:11,437 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:48:11,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:48:11,438 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:48:11,438 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:48:11,438 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:48:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states. [2019-11-24 04:48:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:48:11,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:11,514 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:11,515 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash -562711782, now seen corresponding path program 1 times [2019-11-24 04:48:11,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:11,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087077543] [2019-11-24 04:48:11,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:12,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087077543] [2019-11-24 04:48:12,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:12,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:48:12,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068620281] [2019-11-24 04:48:12,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:48:12,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:12,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:48:12,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:48:12,322 INFO L87 Difference]: Start difference. First operand 745 states. Second operand 2 states. [2019-11-24 04:48:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:12,422 INFO L93 Difference]: Finished difference Result 762 states and 1451 transitions. [2019-11-24 04:48:12,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:48:12,427 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-24 04:48:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:12,478 INFO L225 Difference]: With dead ends: 762 [2019-11-24 04:48:12,479 INFO L226 Difference]: Without dead ends: 743 [2019-11-24 04:48:12,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:48:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-24 04:48:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2019-11-24 04:48:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-11-24 04:48:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1421 transitions. [2019-11-24 04:48:12,634 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1421 transitions. Word has length 12 [2019-11-24 04:48:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:12,635 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1421 transitions. [2019-11-24 04:48:12,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:48:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1421 transitions. [2019-11-24 04:48:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:48:12,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:12,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:12,639 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash -286987305, now seen corresponding path program 1 times [2019-11-24 04:48:12,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:12,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103023910] [2019-11-24 04:48:12,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:12,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103023910] [2019-11-24 04:48:12,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:12,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:12,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094805909] [2019-11-24 04:48:12,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:12,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:12,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:12,786 INFO L87 Difference]: Start difference. First operand 743 states and 1421 transitions. Second operand 3 states. [2019-11-24 04:48:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:13,194 INFO L93 Difference]: Finished difference Result 1318 states and 2513 transitions. [2019-11-24 04:48:13,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:13,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 04:48:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:13,202 INFO L225 Difference]: With dead ends: 1318 [2019-11-24 04:48:13,203 INFO L226 Difference]: Without dead ends: 937 [2019-11-24 04:48:13,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-11-24 04:48:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 900. [2019-11-24 04:48:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-11-24 04:48:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1717 transitions. [2019-11-24 04:48:13,243 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1717 transitions. Word has length 13 [2019-11-24 04:48:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:13,244 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1717 transitions. [2019-11-24 04:48:13,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1717 transitions. [2019-11-24 04:48:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:48:13,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:13,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:13,247 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash -306653487, now seen corresponding path program 1 times [2019-11-24 04:48:13,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:13,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270636855] [2019-11-24 04:48:13,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:13,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270636855] [2019-11-24 04:48:13,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:13,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:13,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987359028] [2019-11-24 04:48:13,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:13,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:13,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:13,356 INFO L87 Difference]: Start difference. First operand 900 states and 1717 transitions. Second operand 3 states. [2019-11-24 04:48:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:14,038 INFO L93 Difference]: Finished difference Result 1841 states and 3505 transitions. [2019-11-24 04:48:14,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:14,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 04:48:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:14,056 INFO L225 Difference]: With dead ends: 1841 [2019-11-24 04:48:14,065 INFO L226 Difference]: Without dead ends: 1316 [2019-11-24 04:48:14,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:48:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-11-24 04:48:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1203. [2019-11-24 04:48:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-24 04:48:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2289 transitions. [2019-11-24 04:48:14,137 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2289 transitions. Word has length 14 [2019-11-24 04:48:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:14,137 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 2289 transitions. [2019-11-24 04:48:14,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2289 transitions. [2019-11-24 04:48:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:48:14,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:14,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:14,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -916305120, now seen corresponding path program 1 times [2019-11-24 04:48:14,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:14,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097013668] [2019-11-24 04:48:14,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:14,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097013668] [2019-11-24 04:48:14,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:14,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:14,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124525206] [2019-11-24 04:48:14,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:14,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:14,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:14,338 INFO L87 Difference]: Start difference. First operand 1203 states and 2289 transitions. Second operand 3 states. [2019-11-24 04:48:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:14,683 INFO L93 Difference]: Finished difference Result 2018 states and 3835 transitions. [2019-11-24 04:48:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:14,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:48:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:14,694 INFO L225 Difference]: With dead ends: 2018 [2019-11-24 04:48:14,694 INFO L226 Difference]: Without dead ends: 1201 [2019-11-24 04:48:14,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-11-24 04:48:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2019-11-24 04:48:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2019-11-24 04:48:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2279 transitions. [2019-11-24 04:48:14,743 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2279 transitions. Word has length 15 [2019-11-24 04:48:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:14,744 INFO L462 AbstractCegarLoop]: Abstraction has 1201 states and 2279 transitions. [2019-11-24 04:48:14,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2279 transitions. [2019-11-24 04:48:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:48:14,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:14,746 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:48:14,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1659330746, now seen corresponding path program 1 times [2019-11-24 04:48:14,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:14,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59560627] [2019-11-24 04:48:14,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:14,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59560627] [2019-11-24 04:48:14,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:14,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:14,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700275477] [2019-11-24 04:48:14,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:14,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:14,878 INFO L87 Difference]: Start difference. First operand 1201 states and 2279 transitions. Second operand 3 states. [2019-11-24 04:48:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:15,215 INFO L93 Difference]: Finished difference Result 2757 states and 5222 transitions. [2019-11-24 04:48:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:15,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 04:48:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:15,226 INFO L225 Difference]: With dead ends: 2757 [2019-11-24 04:48:15,226 INFO L226 Difference]: Without dead ends: 1945 [2019-11-24 04:48:15,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2019-11-24 04:48:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1793. [2019-11-24 04:48:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2019-11-24 04:48:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 3388 transitions. [2019-11-24 04:48:15,302 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 3388 transitions. Word has length 16 [2019-11-24 04:48:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:15,303 INFO L462 AbstractCegarLoop]: Abstraction has 1793 states and 3388 transitions. [2019-11-24 04:48:15,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3388 transitions. [2019-11-24 04:48:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:48:15,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:15,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:15,305 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:15,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:15,306 INFO L82 PathProgramCache]: Analyzing trace with hash -100336023, now seen corresponding path program 1 times [2019-11-24 04:48:15,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:15,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629700801] [2019-11-24 04:48:15,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:15,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629700801] [2019-11-24 04:48:15,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:15,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:15,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274437620] [2019-11-24 04:48:15,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:15,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:15,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:15,410 INFO L87 Difference]: Start difference. First operand 1793 states and 3388 transitions. Second operand 3 states. [2019-11-24 04:48:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:15,653 INFO L93 Difference]: Finished difference Result 1793 states and 3388 transitions. [2019-11-24 04:48:15,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:15,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:48:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:15,663 INFO L225 Difference]: With dead ends: 1793 [2019-11-24 04:48:15,663 INFO L226 Difference]: Without dead ends: 1786 [2019-11-24 04:48:15,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2019-11-24 04:48:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1786. [2019-11-24 04:48:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-11-24 04:48:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 3376 transitions. [2019-11-24 04:48:15,725 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 3376 transitions. Word has length 17 [2019-11-24 04:48:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:15,726 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 3376 transitions. [2019-11-24 04:48:15,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 3376 transitions. [2019-11-24 04:48:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:48:15,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:15,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:15,728 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1173361402, now seen corresponding path program 1 times [2019-11-24 04:48:15,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:15,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587408068] [2019-11-24 04:48:15,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:15,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587408068] [2019-11-24 04:48:15,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:15,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:15,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584028580] [2019-11-24 04:48:15,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:15,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:15,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:15,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:15,945 INFO L87 Difference]: Start difference. First operand 1786 states and 3376 transitions. Second operand 3 states. [2019-11-24 04:48:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:17,093 INFO L93 Difference]: Finished difference Result 4554 states and 8566 transitions. [2019-11-24 04:48:17,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:17,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 04:48:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:17,111 INFO L225 Difference]: With dead ends: 4554 [2019-11-24 04:48:17,112 INFO L226 Difference]: Without dead ends: 2959 [2019-11-24 04:48:17,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2019-11-24 04:48:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1746. [2019-11-24 04:48:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1746 states. [2019-11-24 04:48:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 3276 transitions. [2019-11-24 04:48:17,191 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 3276 transitions. Word has length 29 [2019-11-24 04:48:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:17,192 INFO L462 AbstractCegarLoop]: Abstraction has 1746 states and 3276 transitions. [2019-11-24 04:48:17,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 3276 transitions. [2019-11-24 04:48:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:48:17,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:17,194 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:17,194 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash -338355988, now seen corresponding path program 1 times [2019-11-24 04:48:17,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:17,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621086498] [2019-11-24 04:48:17,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:17,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621086498] [2019-11-24 04:48:17,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:17,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:17,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873055598] [2019-11-24 04:48:17,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:17,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:17,406 INFO L87 Difference]: Start difference. First operand 1746 states and 3276 transitions. Second operand 3 states. [2019-11-24 04:48:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:18,463 INFO L93 Difference]: Finished difference Result 4460 states and 8352 transitions. [2019-11-24 04:48:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:18,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-24 04:48:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:18,480 INFO L225 Difference]: With dead ends: 4460 [2019-11-24 04:48:18,480 INFO L226 Difference]: Without dead ends: 2927 [2019-11-24 04:48:18,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2019-11-24 04:48:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1716. [2019-11-24 04:48:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-11-24 04:48:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 3186 transitions. [2019-11-24 04:48:18,651 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 3186 transitions. Word has length 30 [2019-11-24 04:48:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:18,651 INFO L462 AbstractCegarLoop]: Abstraction has 1716 states and 3186 transitions. [2019-11-24 04:48:18,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 3186 transitions. [2019-11-24 04:48:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:48:18,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:18,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:18,654 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2023341263, now seen corresponding path program 1 times [2019-11-24 04:48:18,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:18,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023256022] [2019-11-24 04:48:18,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:18,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023256022] [2019-11-24 04:48:18,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:18,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:18,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29836270] [2019-11-24 04:48:18,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:18,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:18,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:18,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:18,872 INFO L87 Difference]: Start difference. First operand 1716 states and 3186 transitions. Second operand 3 states. [2019-11-24 04:48:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:19,799 INFO L93 Difference]: Finished difference Result 4381 states and 8153 transitions. [2019-11-24 04:48:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:19,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 04:48:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:19,817 INFO L225 Difference]: With dead ends: 4381 [2019-11-24 04:48:19,817 INFO L226 Difference]: Without dead ends: 2905 [2019-11-24 04:48:19,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2019-11-24 04:48:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1696. [2019-11-24 04:48:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2019-11-24 04:48:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 3106 transitions. [2019-11-24 04:48:19,911 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 3106 transitions. Word has length 32 [2019-11-24 04:48:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:19,913 INFO L462 AbstractCegarLoop]: Abstraction has 1696 states and 3106 transitions. [2019-11-24 04:48:19,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 3106 transitions. [2019-11-24 04:48:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:48:19,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:19,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:19,917 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:19,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1613007696, now seen corresponding path program 1 times [2019-11-24 04:48:19,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:19,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957472425] [2019-11-24 04:48:19,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:20,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957472425] [2019-11-24 04:48:20,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:20,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:20,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911048845] [2019-11-24 04:48:20,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:20,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:20,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:20,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:20,194 INFO L87 Difference]: Start difference. First operand 1696 states and 3106 transitions. Second operand 3 states. [2019-11-24 04:48:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:21,083 INFO L93 Difference]: Finished difference Result 4317 states and 7969 transitions. [2019-11-24 04:48:21,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:21,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:48:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:21,106 INFO L225 Difference]: With dead ends: 4317 [2019-11-24 04:48:21,106 INFO L226 Difference]: Without dead ends: 2893 [2019-11-24 04:48:21,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2019-11-24 04:48:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1686. [2019-11-24 04:48:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-11-24 04:48:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 3036 transitions. [2019-11-24 04:48:21,245 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 3036 transitions. Word has length 35 [2019-11-24 04:48:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:21,247 INFO L462 AbstractCegarLoop]: Abstraction has 1686 states and 3036 transitions. [2019-11-24 04:48:21,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 3036 transitions. [2019-11-24 04:48:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:48:21,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:21,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:21,250 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash 183372730, now seen corresponding path program 1 times [2019-11-24 04:48:21,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:21,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58375767] [2019-11-24 04:48:21,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:21,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58375767] [2019-11-24 04:48:21,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:21,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:21,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311129085] [2019-11-24 04:48:21,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:21,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:21,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:21,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:21,539 INFO L87 Difference]: Start difference. First operand 1686 states and 3036 transitions. Second operand 3 states. [2019-11-24 04:48:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:22,229 INFO L93 Difference]: Finished difference Result 3210 states and 5820 transitions. [2019-11-24 04:48:22,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:22,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:48:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:22,239 INFO L225 Difference]: With dead ends: 3210 [2019-11-24 04:48:22,239 INFO L226 Difference]: Without dead ends: 1833 [2019-11-24 04:48:22,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2019-11-24 04:48:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1686. [2019-11-24 04:48:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-11-24 04:48:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2976 transitions. [2019-11-24 04:48:22,377 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2976 transitions. Word has length 39 [2019-11-24 04:48:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:22,379 INFO L462 AbstractCegarLoop]: Abstraction has 1686 states and 2976 transitions. [2019-11-24 04:48:22,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2976 transitions. [2019-11-24 04:48:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:48:22,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:22,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:22,382 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1118048363, now seen corresponding path program 1 times [2019-11-24 04:48:22,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:22,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036980771] [2019-11-24 04:48:22,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:22,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036980771] [2019-11-24 04:48:22,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:22,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:22,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887771596] [2019-11-24 04:48:22,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:22,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:22,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:22,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:22,655 INFO L87 Difference]: Start difference. First operand 1686 states and 2976 transitions. Second operand 5 states. [2019-11-24 04:48:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:24,001 INFO L93 Difference]: Finished difference Result 6647 states and 12106 transitions. [2019-11-24 04:48:24,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:48:24,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-24 04:48:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:24,027 INFO L225 Difference]: With dead ends: 6647 [2019-11-24 04:48:24,027 INFO L226 Difference]: Without dead ends: 4976 [2019-11-24 04:48:24,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:48:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2019-11-24 04:48:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 2059. [2019-11-24 04:48:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-11-24 04:48:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 3532 transitions. [2019-11-24 04:48:24,204 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 3532 transitions. Word has length 43 [2019-11-24 04:48:24,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:24,204 INFO L462 AbstractCegarLoop]: Abstraction has 2059 states and 3532 transitions. [2019-11-24 04:48:24,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 3532 transitions. [2019-11-24 04:48:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:48:24,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:24,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:24,207 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:24,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1111218646, now seen corresponding path program 1 times [2019-11-24 04:48:24,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:24,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593072256] [2019-11-24 04:48:24,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:24,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593072256] [2019-11-24 04:48:24,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:24,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:24,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230716999] [2019-11-24 04:48:24,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:48:24,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:48:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:48:24,483 INFO L87 Difference]: Start difference. First operand 2059 states and 3532 transitions. Second operand 4 states. [2019-11-24 04:48:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:24,831 INFO L93 Difference]: Finished difference Result 5547 states and 9624 transitions. [2019-11-24 04:48:24,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:48:24,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-24 04:48:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:24,840 INFO L225 Difference]: With dead ends: 5547 [2019-11-24 04:48:24,841 INFO L226 Difference]: Without dead ends: 3644 [2019-11-24 04:48:24,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2019-11-24 04:48:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 2062. [2019-11-24 04:48:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2019-11-24 04:48:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3534 transitions. [2019-11-24 04:48:25,026 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3534 transitions. Word has length 44 [2019-11-24 04:48:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:25,027 INFO L462 AbstractCegarLoop]: Abstraction has 2062 states and 3534 transitions. [2019-11-24 04:48:25,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:48:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3534 transitions. [2019-11-24 04:48:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:48:25,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:25,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:25,032 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:25,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:25,032 INFO L82 PathProgramCache]: Analyzing trace with hash 613990860, now seen corresponding path program 1 times [2019-11-24 04:48:25,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:25,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377048140] [2019-11-24 04:48:25,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:25,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377048140] [2019-11-24 04:48:25,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:25,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:25,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642525551] [2019-11-24 04:48:25,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:48:25,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:25,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:48:25,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:48:25,333 INFO L87 Difference]: Start difference. First operand 2062 states and 3534 transitions. Second operand 4 states. [2019-11-24 04:48:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:26,384 INFO L93 Difference]: Finished difference Result 4664 states and 8047 transitions. [2019-11-24 04:48:26,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:48:26,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-24 04:48:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:26,390 INFO L225 Difference]: With dead ends: 4664 [2019-11-24 04:48:26,390 INFO L226 Difference]: Without dead ends: 2718 [2019-11-24 04:48:26,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-11-24 04:48:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 1819. [2019-11-24 04:48:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2019-11-24 04:48:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 3131 transitions. [2019-11-24 04:48:26,523 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 3131 transitions. Word has length 47 [2019-11-24 04:48:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:26,525 INFO L462 AbstractCegarLoop]: Abstraction has 1819 states and 3131 transitions. [2019-11-24 04:48:26,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:48:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 3131 transitions. [2019-11-24 04:48:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:48:26,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:26,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:26,527 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1451072253, now seen corresponding path program 1 times [2019-11-24 04:48:26,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:26,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578363927] [2019-11-24 04:48:26,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:26,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578363927] [2019-11-24 04:48:26,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:26,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:26,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225248588] [2019-11-24 04:48:26,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:26,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:26,812 INFO L87 Difference]: Start difference. First operand 1819 states and 3131 transitions. Second operand 5 states. [2019-11-24 04:48:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:27,132 INFO L93 Difference]: Finished difference Result 2377 states and 3974 transitions. [2019-11-24 04:48:27,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:48:27,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-24 04:48:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:27,137 INFO L225 Difference]: With dead ends: 2377 [2019-11-24 04:48:27,137 INFO L226 Difference]: Without dead ends: 2369 [2019-11-24 04:48:27,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:48:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-11-24 04:48:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1821. [2019-11-24 04:48:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-11-24 04:48:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 3133 transitions. [2019-11-24 04:48:27,266 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 3133 transitions. Word has length 47 [2019-11-24 04:48:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:27,266 INFO L462 AbstractCegarLoop]: Abstraction has 1821 states and 3133 transitions. [2019-11-24 04:48:27,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 3133 transitions. [2019-11-24 04:48:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:48:27,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:27,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:27,268 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:27,268 INFO L82 PathProgramCache]: Analyzing trace with hash -739137311, now seen corresponding path program 1 times [2019-11-24 04:48:27,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:27,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162173182] [2019-11-24 04:48:27,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:27,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162173182] [2019-11-24 04:48:27,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:27,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:27,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224292272] [2019-11-24 04:48:27,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:27,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:27,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:27,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:27,486 INFO L87 Difference]: Start difference. First operand 1821 states and 3133 transitions. Second operand 3 states. [2019-11-24 04:48:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:27,645 INFO L93 Difference]: Finished difference Result 1843 states and 3156 transitions. [2019-11-24 04:48:27,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:27,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-24 04:48:27,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:27,650 INFO L225 Difference]: With dead ends: 1843 [2019-11-24 04:48:27,650 INFO L226 Difference]: Without dead ends: 1825 [2019-11-24 04:48:27,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2019-11-24 04:48:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1821. [2019-11-24 04:48:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-11-24 04:48:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 3125 transitions. [2019-11-24 04:48:27,806 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 3125 transitions. Word has length 48 [2019-11-24 04:48:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:27,806 INFO L462 AbstractCegarLoop]: Abstraction has 1821 states and 3125 transitions. [2019-11-24 04:48:27,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 3125 transitions. [2019-11-24 04:48:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:48:27,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:27,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:27,808 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:27,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1333752582, now seen corresponding path program 1 times [2019-11-24 04:48:27,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:27,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457674294] [2019-11-24 04:48:27,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:28,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457674294] [2019-11-24 04:48:28,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:28,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:48:28,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480036158] [2019-11-24 04:48:28,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:48:28,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:48:28,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:48:28,530 INFO L87 Difference]: Start difference. First operand 1821 states and 3125 transitions. Second operand 21 states. [2019-11-24 04:48:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:31,664 INFO L93 Difference]: Finished difference Result 5780 states and 10122 transitions. [2019-11-24 04:48:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:31,664 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-11-24 04:48:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:31,679 INFO L225 Difference]: With dead ends: 5780 [2019-11-24 04:48:31,680 INFO L226 Difference]: Without dead ends: 4086 [2019-11-24 04:48:31,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:48:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4086 states. [2019-11-24 04:48:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4086 to 1963. [2019-11-24 04:48:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-11-24 04:48:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 3301 transitions. [2019-11-24 04:48:31,953 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 3301 transitions. Word has length 49 [2019-11-24 04:48:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:31,953 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 3301 transitions. [2019-11-24 04:48:31,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:48:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 3301 transitions. [2019-11-24 04:48:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 04:48:31,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:31,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:31,956 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1208901254, now seen corresponding path program 1 times [2019-11-24 04:48:31,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:31,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226812537] [2019-11-24 04:48:31,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:32,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226812537] [2019-11-24 04:48:32,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:32,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:48:32,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607318740] [2019-11-24 04:48:32,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:48:32,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:48:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:48:32,737 INFO L87 Difference]: Start difference. First operand 1963 states and 3301 transitions. Second operand 21 states. [2019-11-24 04:48:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:35,322 INFO L93 Difference]: Finished difference Result 6108 states and 10510 transitions. [2019-11-24 04:48:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:35,322 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2019-11-24 04:48:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:35,327 INFO L225 Difference]: With dead ends: 6108 [2019-11-24 04:48:35,328 INFO L226 Difference]: Without dead ends: 4389 [2019-11-24 04:48:35,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:48:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4389 states. [2019-11-24 04:48:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4389 to 2211. [2019-11-24 04:48:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2019-11-24 04:48:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 3641 transitions. [2019-11-24 04:48:35,592 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 3641 transitions. Word has length 53 [2019-11-24 04:48:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:35,593 INFO L462 AbstractCegarLoop]: Abstraction has 2211 states and 3641 transitions. [2019-11-24 04:48:35,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:48:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 3641 transitions. [2019-11-24 04:48:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 04:48:35,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:35,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:35,595 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2112346845, now seen corresponding path program 1 times [2019-11-24 04:48:35,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:35,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164756291] [2019-11-24 04:48:35,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:36,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164756291] [2019-11-24 04:48:36,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:36,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:48:36,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985332028] [2019-11-24 04:48:36,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:48:36,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:36,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:48:36,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:48:36,303 INFO L87 Difference]: Start difference. First operand 2211 states and 3641 transitions. Second operand 21 states. [2019-11-24 04:48:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:38,151 INFO L93 Difference]: Finished difference Result 6166 states and 10262 transitions. [2019-11-24 04:48:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:38,151 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-11-24 04:48:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:38,158 INFO L225 Difference]: With dead ends: 6166 [2019-11-24 04:48:38,158 INFO L226 Difference]: Without dead ends: 4199 [2019-11-24 04:48:38,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:48:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2019-11-24 04:48:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 2574. [2019-11-24 04:48:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2019-11-24 04:48:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 4168 transitions. [2019-11-24 04:48:38,409 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 4168 transitions. Word has length 55 [2019-11-24 04:48:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:38,410 INFO L462 AbstractCegarLoop]: Abstraction has 2574 states and 4168 transitions. [2019-11-24 04:48:38,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:48:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4168 transitions. [2019-11-24 04:48:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-24 04:48:38,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:38,413 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] [2019-11-24 04:48:38,413 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2103699637, now seen corresponding path program 1 times [2019-11-24 04:48:38,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:38,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996464905] [2019-11-24 04:48:38,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:38,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996464905] [2019-11-24 04:48:38,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:38,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:38,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485312270] [2019-11-24 04:48:38,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:38,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:38,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:38,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:38,583 INFO L87 Difference]: Start difference. First operand 2574 states and 4168 transitions. Second operand 5 states. [2019-11-24 04:48:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:39,591 INFO L93 Difference]: Finished difference Result 6622 states and 11071 transitions. [2019-11-24 04:48:39,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:39,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-24 04:48:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:39,600 INFO L225 Difference]: With dead ends: 6622 [2019-11-24 04:48:39,600 INFO L226 Difference]: Without dead ends: 4259 [2019-11-24 04:48:39,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:48:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2019-11-24 04:48:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2655. [2019-11-24 04:48:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2019-11-24 04:48:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4249 transitions. [2019-11-24 04:48:39,888 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4249 transitions. Word has length 59 [2019-11-24 04:48:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:39,888 INFO L462 AbstractCegarLoop]: Abstraction has 2655 states and 4249 transitions. [2019-11-24 04:48:39,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4249 transitions. [2019-11-24 04:48:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 04:48:39,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:39,892 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] [2019-11-24 04:48:39,892 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash -477460620, now seen corresponding path program 1 times [2019-11-24 04:48:39,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:39,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850343820] [2019-11-24 04:48:39,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:40,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850343820] [2019-11-24 04:48:40,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:40,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:40,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27875610] [2019-11-24 04:48:40,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:40,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:40,065 INFO L87 Difference]: Start difference. First operand 2655 states and 4249 transitions. Second operand 5 states. [2019-11-24 04:48:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:40,987 INFO L93 Difference]: Finished difference Result 6703 states and 11112 transitions. [2019-11-24 04:48:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:40,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-24 04:48:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:40,993 INFO L225 Difference]: With dead ends: 6703 [2019-11-24 04:48:40,993 INFO L226 Difference]: Without dead ends: 4259 [2019-11-24 04:48:40,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:48:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2019-11-24 04:48:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2655. [2019-11-24 04:48:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2019-11-24 04:48:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4209 transitions. [2019-11-24 04:48:41,494 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4209 transitions. Word has length 61 [2019-11-24 04:48:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:41,494 INFO L462 AbstractCegarLoop]: Abstraction has 2655 states and 4209 transitions. [2019-11-24 04:48:41,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4209 transitions. [2019-11-24 04:48:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 04:48:41,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:41,496 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] [2019-11-24 04:48:41,497 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:41,497 INFO L82 PathProgramCache]: Analyzing trace with hash 337509619, now seen corresponding path program 1 times [2019-11-24 04:48:41,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:41,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972283501] [2019-11-24 04:48:41,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:41,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972283501] [2019-11-24 04:48:41,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:41,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:41,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890047471] [2019-11-24 04:48:41,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:41,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:41,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:41,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:41,710 INFO L87 Difference]: Start difference. First operand 2655 states and 4209 transitions. Second operand 5 states. [2019-11-24 04:48:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:42,692 INFO L93 Difference]: Finished difference Result 6751 states and 11097 transitions. [2019-11-24 04:48:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:42,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-24 04:48:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:42,699 INFO L225 Difference]: With dead ends: 6751 [2019-11-24 04:48:42,699 INFO L226 Difference]: Without dead ends: 4307 [2019-11-24 04:48:42,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:48:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2019-11-24 04:48:43,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 2635. [2019-11-24 04:48:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2019-11-24 04:48:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4174 transitions. [2019-11-24 04:48:43,115 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4174 transitions. Word has length 61 [2019-11-24 04:48:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:43,115 INFO L462 AbstractCegarLoop]: Abstraction has 2635 states and 4174 transitions. [2019-11-24 04:48:43,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4174 transitions. [2019-11-24 04:48:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:48:43,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:43,117 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:48:43,117 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:43,117 INFO L82 PathProgramCache]: Analyzing trace with hash 517473870, now seen corresponding path program 1 times [2019-11-24 04:48:43,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:43,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312504472] [2019-11-24 04:48:43,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:43,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312504472] [2019-11-24 04:48:43,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:43,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:43,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668247391] [2019-11-24 04:48:43,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:43,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:43,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:43,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:43,342 INFO L87 Difference]: Start difference. First operand 2635 states and 4174 transitions. Second operand 5 states. [2019-11-24 04:48:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:45,654 INFO L93 Difference]: Finished difference Result 8495 states and 13815 transitions. [2019-11-24 04:48:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:48:45,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-24 04:48:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:45,660 INFO L225 Difference]: With dead ends: 8495 [2019-11-24 04:48:45,660 INFO L226 Difference]: Without dead ends: 6071 [2019-11-24 04:48:45,663 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:48:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2019-11-24 04:48:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3059. [2019-11-24 04:48:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2019-11-24 04:48:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4892 transitions. [2019-11-24 04:48:46,058 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4892 transitions. Word has length 64 [2019-11-24 04:48:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:46,058 INFO L462 AbstractCegarLoop]: Abstraction has 3059 states and 4892 transitions. [2019-11-24 04:48:46,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4892 transitions. [2019-11-24 04:48:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:48:46,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:46,060 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:48:46,060 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:46,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:46,060 INFO L82 PathProgramCache]: Analyzing trace with hash -311120081, now seen corresponding path program 1 times [2019-11-24 04:48:46,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:46,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579764088] [2019-11-24 04:48:46,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat