/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_spec1_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:38:20,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:38:20,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:38:20,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:38:20,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:38:20,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:38:20,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:38:20,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:38:20,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:38:20,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:38:20,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:38:20,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:38:20,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:38:20,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:38:20,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:38:20,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:38:20,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:38:20,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:38:20,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:38:20,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:38:20,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:38:20,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:38:20,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:38:20,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:38:20,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:38:20,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:38:20,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:38:20,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:38:20,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:38:20,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:38:20,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:38:20,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:38:20,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:38:20,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:38:20,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:38:20,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:38:20,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:38:20,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:38:20,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:38:20,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:38:20,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:38:20,737 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:38:20,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:38:20,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:38:20,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:38:20,769 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:38:20,769 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:38:20,771 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:38:20,771 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:38:20,771 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:38:20,771 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:38:20,771 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:38:20,772 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:38:20,772 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:38:20,772 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:38:20,772 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:38:20,772 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:38:20,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:38:20,773 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:38:20,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:38:20,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:38:20,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:38:20,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:38:20,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:38:20,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:38:20,776 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:38:20,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:38:20,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:38:20,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:38:20,777 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:38:20,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:38:20,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:38:20,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:38:20,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:38:20,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:38:20,779 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:38:20,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:38:20,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:38:20,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:38:20,781 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:38:21,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:38:21,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:38:21,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:38:21,072 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:38:21,072 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:38:21,073 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product23.cil.c [2019-11-24 04:38:21,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d2637ea9/1041a3fe6ac84fbba098944308317d32/FLAGb159a5096 [2019-11-24 04:38:21,828 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:38:21,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product23.cil.c [2019-11-24 04:38:21,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d2637ea9/1041a3fe6ac84fbba098944308317d32/FLAGb159a5096 [2019-11-24 04:38:21,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d2637ea9/1041a3fe6ac84fbba098944308317d32 [2019-11-24 04:38:21,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:38:21,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:38:21,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:21,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:38:22,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:38:22,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:21" (1/1) ... [2019-11-24 04:38:22,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580da5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:22, skipping insertion in model container [2019-11-24 04:38:22,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:21" (1/1) ... [2019-11-24 04:38:22,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:38:22,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:38:22,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:22,853 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:38:23,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:23,081 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:38:23,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23 WrapperNode [2019-11-24 04:38:23,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:23,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:23,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:38:23,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:38:23,092 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:38:23" (1/1) ... [2019-11-24 04:38:23,125 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:38:23" (1/1) ... [2019-11-24 04:38:23,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:23,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:38:23,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:38:23,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:38:23,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23" (1/1) ... [2019-11-24 04:38:23,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23" (1/1) ... [2019-11-24 04:38:23,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23" (1/1) ... [2019-11-24 04:38:23,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23" (1/1) ... [2019-11-24 04:38:23,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23" (1/1) ... [2019-11-24 04:38:23,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23" (1/1) ... [2019-11-24 04:38:23,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23" (1/1) ... [2019-11-24 04:38:23,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:38:23,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:38:23,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:38:23,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:38:23,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:38:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:38:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:38:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:38:23,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:39:01,408 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:39:01,408 INFO L284 CfgBuilder]: Removed 833 assume(true) statements. [2019-11-24 04:39:01,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:39:01 BoogieIcfgContainer [2019-11-24 04:39:01,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:39:01,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:39:01,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:39:01,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:39:01,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:38:21" (1/3) ... [2019-11-24 04:39:01,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19eab1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:39:01, skipping insertion in model container [2019-11-24 04:39:01,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:23" (2/3) ... [2019-11-24 04:39:01,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19eab1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:39:01, skipping insertion in model container [2019-11-24 04:39:01,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:39:01" (3/3) ... [2019-11-24 04:39:01,418 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product23.cil.c [2019-11-24 04:39:01,428 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:39:01,436 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:39:01,445 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:39:01,481 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:39:01,481 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:39:01,481 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:39:01,481 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:39:01,482 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:39:01,482 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:39:01,482 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:39:01,482 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:39:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states. [2019-11-24 04:39:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:39:01,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:01,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:01,531 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:39:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:01,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2128277575, now seen corresponding path program 1 times [2019-11-24 04:39:01,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:01,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825639823] [2019-11-24 04:39:01,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:01,991 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:39:01,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825639823] [2019-11-24 04:39:01,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:01,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:39:01,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077447392] [2019-11-24 04:39:02,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:39:02,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:39:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:39:02,019 INFO L87 Difference]: Start difference. First operand 1241 states. Second operand 2 states. [2019-11-24 04:39:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:02,118 INFO L93 Difference]: Finished difference Result 1258 states and 2415 transitions. [2019-11-24 04:39:02,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:39:02,120 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:39:02,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:02,146 INFO L225 Difference]: With dead ends: 1258 [2019-11-24 04:39:02,147 INFO L226 Difference]: Without dead ends: 1239 [2019-11-24 04:39:02,153 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:39:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-11-24 04:39:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2019-11-24 04:39:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-11-24 04:39:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2385 transitions. [2019-11-24 04:39:02,295 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2385 transitions. Word has length 14 [2019-11-24 04:39:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:02,296 INFO L462 AbstractCegarLoop]: Abstraction has 1239 states and 2385 transitions. [2019-11-24 04:39:02,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:39:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2385 transitions. [2019-11-24 04:39:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:39:02,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:02,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:02,307 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:39:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:02,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1539347384, now seen corresponding path program 1 times [2019-11-24 04:39:02,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:02,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553504503] [2019-11-24 04:39:02,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:02,572 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:39:02,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553504503] [2019-11-24 04:39:02,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:02,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:02,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147077848] [2019-11-24 04:39:02,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:02,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:02,577 INFO L87 Difference]: Start difference. First operand 1239 states and 2385 transitions. Second operand 5 states. [2019-11-24 04:39:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:03,127 INFO L93 Difference]: Finished difference Result 2597 states and 4945 transitions. [2019-11-24 04:39:03,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:03,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 04:39:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:03,139 INFO L225 Difference]: With dead ends: 2597 [2019-11-24 04:39:03,139 INFO L226 Difference]: Without dead ends: 1968 [2019-11-24 04:39:03,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-11-24 04:39:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1247. [2019-11-24 04:39:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-11-24 04:39:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2397 transitions. [2019-11-24 04:39:03,197 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2397 transitions. Word has length 15 [2019-11-24 04:39:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:03,198 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 2397 transitions. [2019-11-24 04:39:03,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2397 transitions. [2019-11-24 04:39:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:39:03,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:03,200 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:39:03,200 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:39:03,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash 612694440, now seen corresponding path program 1 times [2019-11-24 04:39:03,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:03,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959359734] [2019-11-24 04:39:03,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:03,329 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:39:03,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959359734] [2019-11-24 04:39:03,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:03,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:03,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870857494] [2019-11-24 04:39:03,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:03,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:03,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:03,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:03,331 INFO L87 Difference]: Start difference. First operand 1247 states and 2397 transitions. Second operand 5 states. [2019-11-24 04:39:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:03,588 INFO L93 Difference]: Finished difference Result 1894 states and 3619 transitions. [2019-11-24 04:39:03,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:03,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 04:39:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:03,604 INFO L225 Difference]: With dead ends: 1894 [2019-11-24 04:39:03,612 INFO L226 Difference]: Without dead ends: 1879 [2019-11-24 04:39:03,614 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:39:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-11-24 04:39:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1249. [2019-11-24 04:39:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2019-11-24 04:39:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 2399 transitions. [2019-11-24 04:39:03,681 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 2399 transitions. Word has length 16 [2019-11-24 04:39:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:03,681 INFO L462 AbstractCegarLoop]: Abstraction has 1249 states and 2399 transitions. [2019-11-24 04:39:03,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 2399 transitions. [2019-11-24 04:39:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:39:03,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:03,684 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:39:03,686 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:39:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2055918532, now seen corresponding path program 1 times [2019-11-24 04:39:03,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:03,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050296531] [2019-11-24 04:39:03,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:03,824 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:39:03,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050296531] [2019-11-24 04:39:03,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:03,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:03,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825768489] [2019-11-24 04:39:03,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:03,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:03,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:03,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:03,827 INFO L87 Difference]: Start difference. First operand 1249 states and 2399 transitions. Second operand 4 states. [2019-11-24 04:39:03,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:03,991 INFO L93 Difference]: Finished difference Result 1891 states and 3608 transitions. [2019-11-24 04:39:03,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:03,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 04:39:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:04,001 INFO L225 Difference]: With dead ends: 1891 [2019-11-24 04:39:04,002 INFO L226 Difference]: Without dead ends: 1876 [2019-11-24 04:39:04,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:39:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2019-11-24 04:39:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1249. [2019-11-24 04:39:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2019-11-24 04:39:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 2398 transitions. [2019-11-24 04:39:04,061 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 2398 transitions. Word has length 17 [2019-11-24 04:39:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:04,061 INFO L462 AbstractCegarLoop]: Abstraction has 1249 states and 2398 transitions. [2019-11-24 04:39:04,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:39:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 2398 transitions. [2019-11-24 04:39:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:39:04,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:04,063 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:04,064 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:39:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash -355727008, now seen corresponding path program 1 times [2019-11-24 04:39:04,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:04,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430722528] [2019-11-24 04:39:04,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:04,276 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:39:04,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430722528] [2019-11-24 04:39:04,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:04,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:39:04,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429166710] [2019-11-24 04:39:04,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:39:04,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:04,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:39:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:04,279 INFO L87 Difference]: Start difference. First operand 1249 states and 2398 transitions. Second operand 6 states. [2019-11-24 04:39:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:06,020 INFO L93 Difference]: Finished difference Result 2057 states and 3940 transitions. [2019-11-24 04:39:06,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:39:06,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-24 04:39:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:06,028 INFO L225 Difference]: With dead ends: 2057 [2019-11-24 04:39:06,028 INFO L226 Difference]: Without dead ends: 1051 [2019-11-24 04:39:06,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-11-24 04:39:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1045. [2019-11-24 04:39:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2019-11-24 04:39:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1940 transitions. [2019-11-24 04:39:06,080 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1940 transitions. Word has length 18 [2019-11-24 04:39:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:06,080 INFO L462 AbstractCegarLoop]: Abstraction has 1045 states and 1940 transitions. [2019-11-24 04:39:06,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:39:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1940 transitions. [2019-11-24 04:39:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:39:06,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:06,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:06,082 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:39:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1857387656, now seen corresponding path program 1 times [2019-11-24 04:39:06,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:06,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945122286] [2019-11-24 04:39:06,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:06,204 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:39:06,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945122286] [2019-11-24 04:39:06,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:06,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:06,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679256732] [2019-11-24 04:39:06,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:06,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:06,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:06,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:06,209 INFO L87 Difference]: Start difference. First operand 1045 states and 1940 transitions. Second operand 3 states. [2019-11-24 04:39:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:06,402 INFO L93 Difference]: Finished difference Result 2293 states and 4337 transitions. [2019-11-24 04:39:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:06,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:39:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:06,416 INFO L225 Difference]: With dead ends: 2293 [2019-11-24 04:39:06,416 INFO L226 Difference]: Without dead ends: 1668 [2019-11-24 04:39:06,418 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:39:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2019-11-24 04:39:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2019-11-24 04:39:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-11-24 04:39:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 3139 transitions. [2019-11-24 04:39:06,547 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 3139 transitions. Word has length 19 [2019-11-24 04:39:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:06,548 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 3139 transitions. [2019-11-24 04:39:06,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 3139 transitions. [2019-11-24 04:39:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:39:06,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:06,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:06,559 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:39:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:06,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1744465513, now seen corresponding path program 1 times [2019-11-24 04:39:06,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:06,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342091893] [2019-11-24 04:39:06,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:07,033 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:39:07,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342091893] [2019-11-24 04:39:07,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:07,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:39:07,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5552425] [2019-11-24 04:39:07,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:39:07,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:07,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:39:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:39:07,040 INFO L87 Difference]: Start difference. First operand 1668 states and 3139 transitions. Second operand 9 states. [2019-11-24 04:39:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:08,825 INFO L93 Difference]: Finished difference Result 6405 states and 12199 transitions. [2019-11-24 04:39:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:39:08,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-24 04:39:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:08,851 INFO L225 Difference]: With dead ends: 6405 [2019-11-24 04:39:08,851 INFO L226 Difference]: Without dead ends: 5151 [2019-11-24 04:39:08,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:39:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-11-24 04:39:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4253. [2019-11-24 04:39:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4253 states. [2019-11-24 04:39:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 8084 transitions. [2019-11-24 04:39:09,095 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 8084 transitions. Word has length 20 [2019-11-24 04:39:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:09,095 INFO L462 AbstractCegarLoop]: Abstraction has 4253 states and 8084 transitions. [2019-11-24 04:39:09,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:39:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 8084 transitions. [2019-11-24 04:39:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:39:09,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:09,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:09,097 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:39:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1193109169, now seen corresponding path program 1 times [2019-11-24 04:39:09,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:09,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060339303] [2019-11-24 04:39:09,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:09,201 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:39:09,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060339303] [2019-11-24 04:39:09,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:09,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:09,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048001605] [2019-11-24 04:39:09,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:09,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:09,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:09,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:09,203 INFO L87 Difference]: Start difference. First operand 4253 states and 8084 transitions. Second operand 5 states. [2019-11-24 04:39:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:09,847 INFO L93 Difference]: Finished difference Result 8202 states and 15562 transitions. [2019-11-24 04:39:09,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:09,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-24 04:39:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:09,880 INFO L225 Difference]: With dead ends: 8202 [2019-11-24 04:39:09,880 INFO L226 Difference]: Without dead ends: 6962 [2019-11-24 04:39:09,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6962 states. [2019-11-24 04:39:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6962 to 4297. [2019-11-24 04:39:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4297 states. [2019-11-24 04:39:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 8154 transitions. [2019-11-24 04:39:10,139 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 8154 transitions. Word has length 20 [2019-11-24 04:39:10,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:10,140 INFO L462 AbstractCegarLoop]: Abstraction has 4297 states and 8154 transitions. [2019-11-24 04:39:10,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 8154 transitions. [2019-11-24 04:39:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:39:10,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:10,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:10,142 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:39:10,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:10,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1176037339, now seen corresponding path program 1 times [2019-11-24 04:39:10,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:10,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671216501] [2019-11-24 04:39:10,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:10,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671216501] [2019-11-24 04:39:10,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:10,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:39:10,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423859837] [2019-11-24 04:39:10,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:39:10,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:10,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:39:10,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:39:10,451 INFO L87 Difference]: Start difference. First operand 4297 states and 8154 transitions. Second operand 8 states. [2019-11-24 04:39:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:12,710 INFO L93 Difference]: Finished difference Result 10322 states and 19674 transitions. [2019-11-24 04:39:12,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:39:12,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-11-24 04:39:12,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:12,733 INFO L225 Difference]: With dead ends: 10322 [2019-11-24 04:39:12,733 INFO L226 Difference]: Without dead ends: 5669 [2019-11-24 04:39:12,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:39:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2019-11-24 04:39:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 2937. [2019-11-24 04:39:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2019-11-24 04:39:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 5561 transitions. [2019-11-24 04:39:13,016 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 5561 transitions. Word has length 20 [2019-11-24 04:39:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:13,017 INFO L462 AbstractCegarLoop]: Abstraction has 2937 states and 5561 transitions. [2019-11-24 04:39:13,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:39:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 5561 transitions. [2019-11-24 04:39:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:39:13,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:13,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:13,019 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:39:13,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:13,020 INFO L82 PathProgramCache]: Analyzing trace with hash -767616513, now seen corresponding path program 1 times [2019-11-24 04:39:13,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:13,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849952135] [2019-11-24 04:39:13,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:13,116 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:39:13,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849952135] [2019-11-24 04:39:13,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:13,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:39:13,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446781032] [2019-11-24 04:39:13,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:39:13,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:13,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:39:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:13,118 INFO L87 Difference]: Start difference. First operand 2937 states and 5561 transitions. Second operand 6 states. [2019-11-24 04:39:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:13,765 INFO L93 Difference]: Finished difference Result 6776 states and 12725 transitions. [2019-11-24 04:39:13,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:39:13,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-24 04:39:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:13,775 INFO L225 Difference]: With dead ends: 6776 [2019-11-24 04:39:13,775 INFO L226 Difference]: Without dead ends: 4255 [2019-11-24 04:39:13,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:39:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-11-24 04:39:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 2967. [2019-11-24 04:39:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2967 states. [2019-11-24 04:39:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 5591 transitions. [2019-11-24 04:39:14,007 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 5591 transitions. Word has length 25 [2019-11-24 04:39:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:14,007 INFO L462 AbstractCegarLoop]: Abstraction has 2967 states and 5591 transitions. [2019-11-24 04:39:14,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:39:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 5591 transitions. [2019-11-24 04:39:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:39:14,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:14,009 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:39:14,009 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:39:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:14,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1387610690, now seen corresponding path program 1 times [2019-11-24 04:39:14,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:14,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496533313] [2019-11-24 04:39:14,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:14,189 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:39:14,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496533313] [2019-11-24 04:39:14,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:14,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:14,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23951887] [2019-11-24 04:39:14,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:14,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:14,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:14,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:14,191 INFO L87 Difference]: Start difference. First operand 2967 states and 5591 transitions. Second operand 5 states. [2019-11-24 04:39:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:14,652 INFO L93 Difference]: Finished difference Result 5646 states and 10613 transitions. [2019-11-24 04:39:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:14,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-24 04:39:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:14,666 INFO L225 Difference]: With dead ends: 5646 [2019-11-24 04:39:14,667 INFO L226 Difference]: Without dead ends: 4388 [2019-11-24 04:39:14,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4388 states. [2019-11-24 04:39:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4388 to 2973. [2019-11-24 04:39:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2973 states. [2019-11-24 04:39:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 5598 transitions. [2019-11-24 04:39:14,875 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 5598 transitions. Word has length 30 [2019-11-24 04:39:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:14,876 INFO L462 AbstractCegarLoop]: Abstraction has 2973 states and 5598 transitions. [2019-11-24 04:39:14,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 5598 transitions. [2019-11-24 04:39:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:39:14,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:14,878 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:39:14,879 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:39:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash -13146246, now seen corresponding path program 1 times [2019-11-24 04:39:14,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:14,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781881422] [2019-11-24 04:39:14,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:15,292 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:39:15,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781881422] [2019-11-24 04:39:15,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:15,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:39:15,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039939782] [2019-11-24 04:39:15,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 04:39:15,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 04:39:15,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:39:15,294 INFO L87 Difference]: Start difference. First operand 2973 states and 5598 transitions. Second operand 10 states. [2019-11-24 04:39:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:18,527 INFO L93 Difference]: Finished difference Result 7647 states and 14358 transitions. [2019-11-24 04:39:18,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-24 04:39:18,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-11-24 04:39:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:18,540 INFO L225 Difference]: With dead ends: 7647 [2019-11-24 04:39:18,540 INFO L226 Difference]: Without dead ends: 5128 [2019-11-24 04:39:18,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-11-24 04:39:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5128 states. [2019-11-24 04:39:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5128 to 4581. [2019-11-24 04:39:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4581 states. [2019-11-24 04:39:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 8594 transitions. [2019-11-24 04:39:18,892 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 8594 transitions. Word has length 30 [2019-11-24 04:39:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:18,892 INFO L462 AbstractCegarLoop]: Abstraction has 4581 states and 8594 transitions. [2019-11-24 04:39:18,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 04:39:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 8594 transitions. [2019-11-24 04:39:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:39:18,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:18,895 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:39:18,896 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:39:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1813490552, now seen corresponding path program 1 times [2019-11-24 04:39:18,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:18,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041824403] [2019-11-24 04:39:18,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:19,046 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:39:19,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041824403] [2019-11-24 04:39:19,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:19,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:19,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419795429] [2019-11-24 04:39:19,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:19,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:19,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:19,048 INFO L87 Difference]: Start difference. First operand 4581 states and 8594 transitions. Second operand 3 states. [2019-11-24 04:39:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:20,497 INFO L93 Difference]: Finished difference Result 8890 states and 16735 transitions. [2019-11-24 04:39:20,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:20,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:39:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:20,504 INFO L225 Difference]: With dead ends: 8890 [2019-11-24 04:39:20,504 INFO L226 Difference]: Without dead ends: 6169 [2019-11-24 04:39:20,507 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:39:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-11-24 04:39:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 4481. [2019-11-24 04:39:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4481 states. [2019-11-24 04:39:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 8344 transitions. [2019-11-24 04:39:20,982 INFO L78 Accepts]: Start accepts. Automaton has 4481 states and 8344 transitions. Word has length 35 [2019-11-24 04:39:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:20,982 INFO L462 AbstractCegarLoop]: Abstraction has 4481 states and 8344 transitions. [2019-11-24 04:39:20,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4481 states and 8344 transitions. [2019-11-24 04:39:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:39:20,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:20,985 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] [2019-11-24 04:39:20,986 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:39:20,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:20,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1568617411, now seen corresponding path program 1 times [2019-11-24 04:39:20,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:20,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023679961] [2019-11-24 04:39:20,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:21,136 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:39:21,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023679961] [2019-11-24 04:39:21,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:21,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:21,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197028336] [2019-11-24 04:39:21,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:21,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:21,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:21,138 INFO L87 Difference]: Start difference. First operand 4481 states and 8344 transitions. Second operand 3 states. [2019-11-24 04:39:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:22,342 INFO L93 Difference]: Finished difference Result 8688 states and 16248 transitions. [2019-11-24 04:39:22,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:22,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:39:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:22,348 INFO L225 Difference]: With dead ends: 8688 [2019-11-24 04:39:22,348 INFO L226 Difference]: Without dead ends: 6089 [2019-11-24 04:39:22,352 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:39:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2019-11-24 04:39:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 4406. [2019-11-24 04:39:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4406 states. [2019-11-24 04:39:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 8119 transitions. [2019-11-24 04:39:22,827 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 8119 transitions. Word has length 36 [2019-11-24 04:39:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:22,827 INFO L462 AbstractCegarLoop]: Abstraction has 4406 states and 8119 transitions. [2019-11-24 04:39:22,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 8119 transitions. [2019-11-24 04:39:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 04:39:22,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:22,830 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] [2019-11-24 04:39:22,830 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:39:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2037740424, now seen corresponding path program 1 times [2019-11-24 04:39:22,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:22,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779259417] [2019-11-24 04:39:22,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:23,010 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:39:23,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779259417] [2019-11-24 04:39:23,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:23,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:23,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000405682] [2019-11-24 04:39:23,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:23,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:23,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:23,012 INFO L87 Difference]: Start difference. First operand 4406 states and 8119 transitions. Second operand 3 states. [2019-11-24 04:39:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:24,120 INFO L93 Difference]: Finished difference Result 8531 states and 15806 transitions. [2019-11-24 04:39:24,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:24,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 04:39:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:24,127 INFO L225 Difference]: With dead ends: 8531 [2019-11-24 04:39:24,127 INFO L226 Difference]: Without dead ends: 6034 [2019-11-24 04:39:24,130 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:39:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2019-11-24 04:39:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 4356. [2019-11-24 04:39:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4356 states. [2019-11-24 04:39:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 4356 states and 7919 transitions. [2019-11-24 04:39:24,410 INFO L78 Accepts]: Start accepts. Automaton has 4356 states and 7919 transitions. Word has length 38 [2019-11-24 04:39:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:24,410 INFO L462 AbstractCegarLoop]: Abstraction has 4356 states and 7919 transitions. [2019-11-24 04:39:24,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4356 states and 7919 transitions. [2019-11-24 04:39:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:39:24,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:24,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:24,414 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:39:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1962013404, now seen corresponding path program 1 times [2019-11-24 04:39:24,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:24,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923643232] [2019-11-24 04:39:24,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:24,604 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:39:24,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923643232] [2019-11-24 04:39:24,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:24,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:24,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215499729] [2019-11-24 04:39:24,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:24,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:24,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:24,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:24,606 INFO L87 Difference]: Start difference. First operand 4356 states and 7919 transitions. Second operand 3 states. [2019-11-24 04:39:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:25,686 INFO L93 Difference]: Finished difference Result 8419 states and 15409 transitions. [2019-11-24 04:39:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:25,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:39:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:25,691 INFO L225 Difference]: With dead ends: 8419 [2019-11-24 04:39:25,692 INFO L226 Difference]: Without dead ends: 6004 [2019-11-24 04:39:25,694 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:39:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2019-11-24 04:39:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 4331. [2019-11-24 04:39:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2019-11-24 04:39:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 7744 transitions. [2019-11-24 04:39:25,988 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 7744 transitions. Word has length 41 [2019-11-24 04:39:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:25,988 INFO L462 AbstractCegarLoop]: Abstraction has 4331 states and 7744 transitions. [2019-11-24 04:39:25,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 7744 transitions. [2019-11-24 04:39:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:39:25,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:25,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:25,992 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:39:25,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:25,993 INFO L82 PathProgramCache]: Analyzing trace with hash -136054610, now seen corresponding path program 1 times [2019-11-24 04:39:25,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:25,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376253658] [2019-11-24 04:39:25,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:26,173 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:39:26,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376253658] [2019-11-24 04:39:26,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:26,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:26,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215810387] [2019-11-24 04:39:26,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:26,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:26,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:26,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:26,175 INFO L87 Difference]: Start difference. First operand 4331 states and 7744 transitions. Second operand 3 states. [2019-11-24 04:39:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:27,451 INFO L93 Difference]: Finished difference Result 6709 states and 11948 transitions. [2019-11-24 04:39:27,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:27,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-24 04:39:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:27,458 INFO L225 Difference]: With dead ends: 6709 [2019-11-24 04:39:27,458 INFO L226 Difference]: Without dead ends: 4356 [2019-11-24 04:39:27,462 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:39:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4356 states. [2019-11-24 04:39:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4356 to 4331. [2019-11-24 04:39:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2019-11-24 04:39:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 7594 transitions. [2019-11-24 04:39:27,779 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 7594 transitions. Word has length 45 [2019-11-24 04:39:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:27,779 INFO L462 AbstractCegarLoop]: Abstraction has 4331 states and 7594 transitions. [2019-11-24 04:39:27,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 7594 transitions. [2019-11-24 04:39:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:39:27,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:27,839 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:39:27,839 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:39:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash -375291511, now seen corresponding path program 1 times [2019-11-24 04:39:27,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:27,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169191978] [2019-11-24 04:39:27,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:28,068 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:39:28,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169191978] [2019-11-24 04:39:28,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:28,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:28,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756967949] [2019-11-24 04:39:28,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:28,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:28,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:28,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:28,070 INFO L87 Difference]: Start difference. First operand 4331 states and 7594 transitions. Second operand 5 states. [2019-11-24 04:39:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:31,428 INFO L93 Difference]: Finished difference Result 13673 states and 24591 transitions. [2019-11-24 04:39:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:39:31,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-24 04:39:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:31,441 INFO L225 Difference]: With dead ends: 13673 [2019-11-24 04:39:31,441 INFO L226 Difference]: Without dead ends: 9577 [2019-11-24 04:39:31,448 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:39:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9577 states. [2019-11-24 04:39:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9577 to 5434. [2019-11-24 04:39:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5434 states. [2019-11-24 04:39:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 9267 transitions. [2019-11-24 04:39:31,940 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 9267 transitions. Word has length 49 [2019-11-24 04:39:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:31,940 INFO L462 AbstractCegarLoop]: Abstraction has 5434 states and 9267 transitions. [2019-11-24 04:39:31,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 9267 transitions. [2019-11-24 04:39:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:39:31,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:31,944 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] [2019-11-24 04:39:31,944 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:39:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:31,944 INFO L82 PathProgramCache]: Analyzing trace with hash -75334829, now seen corresponding path program 1 times [2019-11-24 04:39:31,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:31,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616110568] [2019-11-24 04:39:31,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:32,158 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:39:32,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616110568] [2019-11-24 04:39:32,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:32,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:32,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453791864] [2019-11-24 04:39:32,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:32,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:32,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:32,161 INFO L87 Difference]: Start difference. First operand 5434 states and 9267 transitions. Second operand 4 states.