/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:39:47,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:39:47,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:39:47,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:39:47,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:39:47,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:39:47,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:39:47,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:39:47,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:39:47,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:39:47,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:39:47,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:39:47,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:39:47,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:39:47,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:39:47,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:39:47,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:39:47,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:39:47,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:39:47,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:39:47,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:39:47,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:39:47,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:39:47,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:39:47,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:39:47,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:39:47,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:39:47,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:39:47,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:39:47,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:39:47,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:39:47,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:39:47,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:39:47,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:39:47,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:39:47,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:39:47,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:39:47,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:39:47,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:39:47,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:39:47,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:39:47,654 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:39:47,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:39:47,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:39:47,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:39:47,673 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:39:47,673 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:39:47,673 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:39:47,673 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:39:47,673 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:39:47,674 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:39:47,674 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:39:47,674 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:39:47,674 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:39:47,674 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:39:47,675 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:39:47,675 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:39:47,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:39:47,676 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:39:47,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:39:47,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:39:47,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:39:47,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:39:47,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:39:47,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:39:47,677 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:39:47,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:39:47,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:39:47,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:39:47,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:39:47,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:39:47,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:39:47,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:39:47,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:39:47,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:39:47,679 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:39:47,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:39:47,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:39:47,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:39:47,680 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:39:47,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:39:48,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:39:48,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:39:48,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:39:48,015 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:39:48,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product01.cil.c [2019-11-24 04:39:48,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a540db72/db52d880916844d3817ad2bb48bda93f/FLAG34c085392 [2019-11-24 04:39:48,785 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:39:48,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product01.cil.c [2019-11-24 04:39:48,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a540db72/db52d880916844d3817ad2bb48bda93f/FLAG34c085392 [2019-11-24 04:39:48,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a540db72/db52d880916844d3817ad2bb48bda93f [2019-11-24 04:39:49,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:39:49,007 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:39:49,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:39:49,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:39:49,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:39:49,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:48" (1/1) ... [2019-11-24 04:39:49,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670f241d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49, skipping insertion in model container [2019-11-24 04:39:49,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:48" (1/1) ... [2019-11-24 04:39:49,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:39:49,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:39:49,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:39:49,761 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:39:49,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:39:49,994 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:39:49,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49 WrapperNode [2019-11-24 04:39:49,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:39:49,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:39:49,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:39:49,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:39:50,005 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:39:49" (1/1) ... [2019-11-24 04:39:50,050 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:39:49" (1/1) ... [2019-11-24 04:39:50,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:39:50,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:39:50,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:39:50,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:39:50,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49" (1/1) ... [2019-11-24 04:39:50,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49" (1/1) ... [2019-11-24 04:39:50,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49" (1/1) ... [2019-11-24 04:39:50,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49" (1/1) ... [2019-11-24 04:39:50,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49" (1/1) ... [2019-11-24 04:39:50,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49" (1/1) ... [2019-11-24 04:39:50,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49" (1/1) ... [2019-11-24 04:39:50,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:39:50,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:39:50,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:39:50,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:39:50,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49" (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:39:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:39:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:39:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:39:50,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:40:15,065 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:40:15,066 INFO L284 CfgBuilder]: Removed 457 assume(true) statements. [2019-11-24 04:40:15,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:15 BoogieIcfgContainer [2019-11-24 04:40:15,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:40:15,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:40:15,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:40:15,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:40:15,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:39:48" (1/3) ... [2019-11-24 04:40:15,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5687d747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:15, skipping insertion in model container [2019-11-24 04:40:15,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:49" (2/3) ... [2019-11-24 04:40:15,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5687d747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:15, skipping insertion in model container [2019-11-24 04:40:15,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:15" (3/3) ... [2019-11-24 04:40:15,074 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product01.cil.c [2019-11-24 04:40:15,081 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:40:15,091 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:40:15,100 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:40:15,133 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:40:15,133 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:40:15,133 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:40:15,133 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:40:15,134 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:40:15,134 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:40:15,134 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:40:15,134 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:40:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-11-24 04:40:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:40:15,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:15,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:15,177 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:40:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1510161581, now seen corresponding path program 1 times [2019-11-24 04:40:15,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:15,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454745071] [2019-11-24 04:40:15,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:15,624 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:40:15,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454745071] [2019-11-24 04:40:15,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:15,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:15,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777743739] [2019-11-24 04:40:15,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:40:15,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:40:15,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:40:15,652 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 4 states. [2019-11-24 04:40:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:15,853 INFO L93 Difference]: Finished difference Result 1843 states and 3518 transitions. [2019-11-24 04:40:15,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:15,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:40:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:15,879 INFO L225 Difference]: With dead ends: 1843 [2019-11-24 04:40:15,879 INFO L226 Difference]: Without dead ends: 1351 [2019-11-24 04:40:15,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-11-24 04:40:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 968. [2019-11-24 04:40:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-24 04:40:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1855 transitions. [2019-11-24 04:40:15,985 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1855 transitions. Word has length 15 [2019-11-24 04:40:15,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:15,986 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1855 transitions. [2019-11-24 04:40:15,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:40:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1855 transitions. [2019-11-24 04:40:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:40:15,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:15,989 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:40:15,989 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:40:15,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash -149667657, now seen corresponding path program 1 times [2019-11-24 04:40:15,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:15,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502699268] [2019-11-24 04:40:15,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:16,174 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:40:16,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502699268] [2019-11-24 04:40:16,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:16,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:16,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080593113] [2019-11-24 04:40:16,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:40:16,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:40:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:40:16,181 INFO L87 Difference]: Start difference. First operand 968 states and 1855 transitions. Second operand 4 states. [2019-11-24 04:40:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:16,447 INFO L93 Difference]: Finished difference Result 1722 states and 3240 transitions. [2019-11-24 04:40:16,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:16,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:40:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:16,458 INFO L225 Difference]: With dead ends: 1722 [2019-11-24 04:40:16,459 INFO L226 Difference]: Without dead ends: 1329 [2019-11-24 04:40:16,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-11-24 04:40:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 972. [2019-11-24 04:40:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-24 04:40:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1859 transitions. [2019-11-24 04:40:16,524 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1859 transitions. Word has length 16 [2019-11-24 04:40:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:16,524 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1859 transitions. [2019-11-24 04:40:16,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:40:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1859 transitions. [2019-11-24 04:40:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:40:16,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:16,533 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:40:16,534 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:40:16,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:16,534 INFO L82 PathProgramCache]: Analyzing trace with hash -344425494, now seen corresponding path program 1 times [2019-11-24 04:40:16,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:16,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693026859] [2019-11-24 04:40:16,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:16,676 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:40:16,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693026859] [2019-11-24 04:40:16,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:16,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:16,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565281861] [2019-11-24 04:40:16,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:16,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:16,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:16,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:16,678 INFO L87 Difference]: Start difference. First operand 972 states and 1859 transitions. Second operand 3 states. [2019-11-24 04:40:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:16,904 INFO L93 Difference]: Finished difference Result 1608 states and 3067 transitions. [2019-11-24 04:40:16,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:16,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:40:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:16,912 INFO L225 Difference]: With dead ends: 1608 [2019-11-24 04:40:16,912 INFO L226 Difference]: Without dead ends: 1216 [2019-11-24 04:40:16,914 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:40:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-11-24 04:40:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1142. [2019-11-24 04:40:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-11-24 04:40:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 2178 transitions. [2019-11-24 04:40:16,950 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 2178 transitions. Word has length 19 [2019-11-24 04:40:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:16,950 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 2178 transitions. [2019-11-24 04:40:16,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 2178 transitions. [2019-11-24 04:40:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:40:16,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:16,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:16,952 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:40:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1427107789, now seen corresponding path program 1 times [2019-11-24 04:40:16,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:16,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323800900] [2019-11-24 04:40:16,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:17,032 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:40:17,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323800900] [2019-11-24 04:40:17,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:17,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:17,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092546685] [2019-11-24 04:40:17,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:17,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:17,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:17,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:17,034 INFO L87 Difference]: Start difference. First operand 1142 states and 2178 transitions. Second operand 3 states. [2019-11-24 04:40:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:17,301 INFO L93 Difference]: Finished difference Result 2227 states and 4239 transitions. [2019-11-24 04:40:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:17,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:40:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:17,314 INFO L225 Difference]: With dead ends: 2227 [2019-11-24 04:40:17,315 INFO L226 Difference]: Without dead ends: 1695 [2019-11-24 04:40:17,317 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:40:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-11-24 04:40:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1471. [2019-11-24 04:40:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-24 04:40:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2794 transitions. [2019-11-24 04:40:17,388 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2794 transitions. Word has length 21 [2019-11-24 04:40:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:17,389 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2794 transitions. [2019-11-24 04:40:17,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2794 transitions. [2019-11-24 04:40:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:40:17,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:17,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:17,391 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:40:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:17,392 INFO L82 PathProgramCache]: Analyzing trace with hash 416684013, now seen corresponding path program 1 times [2019-11-24 04:40:17,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:17,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733224730] [2019-11-24 04:40:17,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:18,721 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:40:18,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733224730] [2019-11-24 04:40:18,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:18,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:18,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076615260] [2019-11-24 04:40:18,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:18,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:18,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:18,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:18,725 INFO L87 Difference]: Start difference. First operand 1471 states and 2794 transitions. Second operand 3 states. [2019-11-24 04:40:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:18,993 INFO L93 Difference]: Finished difference Result 2583 states and 4899 transitions. [2019-11-24 04:40:18,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:18,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:40:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:19,003 INFO L225 Difference]: With dead ends: 2583 [2019-11-24 04:40:19,003 INFO L226 Difference]: Without dead ends: 1456 [2019-11-24 04:40:19,006 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:40:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-11-24 04:40:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1456. [2019-11-24 04:40:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1456 states. [2019-11-24 04:40:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2753 transitions. [2019-11-24 04:40:19,061 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2753 transitions. Word has length 23 [2019-11-24 04:40:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:19,062 INFO L462 AbstractCegarLoop]: Abstraction has 1456 states and 2753 transitions. [2019-11-24 04:40:19,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2753 transitions. [2019-11-24 04:40:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:40:19,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:19,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:19,064 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:40:19,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:19,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1845932383, now seen corresponding path program 1 times [2019-11-24 04:40:19,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:19,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646342523] [2019-11-24 04:40:19,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:19,156 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:40:19,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646342523] [2019-11-24 04:40:19,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:19,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:19,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959580495] [2019-11-24 04:40:19,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:19,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:19,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:19,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:19,161 INFO L87 Difference]: Start difference. First operand 1456 states and 2753 transitions. Second operand 3 states. [2019-11-24 04:40:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:19,554 INFO L93 Difference]: Finished difference Result 3169 states and 5986 transitions. [2019-11-24 04:40:19,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:19,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:40:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:19,568 INFO L225 Difference]: With dead ends: 3169 [2019-11-24 04:40:19,569 INFO L226 Difference]: Without dead ends: 2363 [2019-11-24 04:40:19,574 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:40:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2019-11-24 04:40:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2063. [2019-11-24 04:40:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2019-11-24 04:40:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3877 transitions. [2019-11-24 04:40:19,675 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3877 transitions. Word has length 24 [2019-11-24 04:40:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:19,676 INFO L462 AbstractCegarLoop]: Abstraction has 2063 states and 3877 transitions. [2019-11-24 04:40:19,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3877 transitions. [2019-11-24 04:40:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:40:19,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:19,679 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:40:19,680 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:40:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1389312298, now seen corresponding path program 1 times [2019-11-24 04:40:19,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:19,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932601576] [2019-11-24 04:40:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:19,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:40:19,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932601576] [2019-11-24 04:40:19,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:19,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:19,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932989992] [2019-11-24 04:40:19,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:19,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:19,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:19,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:19,827 INFO L87 Difference]: Start difference. First operand 2063 states and 3877 transitions. Second operand 3 states. [2019-11-24 04:40:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:20,086 INFO L93 Difference]: Finished difference Result 2063 states and 3877 transitions. [2019-11-24 04:40:20,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:20,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:40:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:20,099 INFO L225 Difference]: With dead ends: 2063 [2019-11-24 04:40:20,100 INFO L226 Difference]: Without dead ends: 2056 [2019-11-24 04:40:20,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-11-24 04:40:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2056. [2019-11-24 04:40:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-11-24 04:40:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3862 transitions. [2019-11-24 04:40:20,192 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3862 transitions. Word has length 25 [2019-11-24 04:40:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:20,192 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 3862 transitions. [2019-11-24 04:40:20,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3862 transitions. [2019-11-24 04:40:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:40:20,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:20,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:20,196 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:40:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:20,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1668499835, now seen corresponding path program 1 times [2019-11-24 04:40:20,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:20,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044121912] [2019-11-24 04:40:20,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:20,359 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:40:20,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044121912] [2019-11-24 04:40:20,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:20,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:20,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829603553] [2019-11-24 04:40:20,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:20,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:20,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:20,361 INFO L87 Difference]: Start difference. First operand 2056 states and 3862 transitions. Second operand 3 states. [2019-11-24 04:40:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:21,760 INFO L93 Difference]: Finished difference Result 5189 states and 9685 transitions. [2019-11-24 04:40:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:21,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 04:40:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:21,780 INFO L225 Difference]: With dead ends: 5189 [2019-11-24 04:40:21,780 INFO L226 Difference]: Without dead ends: 3293 [2019-11-24 04:40:21,784 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:40:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-11-24 04:40:21,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 1996. [2019-11-24 04:40:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-11-24 04:40:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 3712 transitions. [2019-11-24 04:40:21,899 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 3712 transitions. Word has length 31 [2019-11-24 04:40:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:21,902 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 3712 transitions. [2019-11-24 04:40:21,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 3712 transitions. [2019-11-24 04:40:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:40:21,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:21,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:21,906 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:40:21,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1383800724, now seen corresponding path program 1 times [2019-11-24 04:40:21,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:21,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017654228] [2019-11-24 04:40:21,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:22,130 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:40:22,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017654228] [2019-11-24 04:40:22,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:22,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:22,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208672217] [2019-11-24 04:40:22,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:22,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:22,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:22,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:22,132 INFO L87 Difference]: Start difference. First operand 1996 states and 3712 transitions. Second operand 3 states. [2019-11-24 04:40:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:23,250 INFO L93 Difference]: Finished difference Result 5059 states and 9380 transitions. [2019-11-24 04:40:23,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:23,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 04:40:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:23,270 INFO L225 Difference]: With dead ends: 5059 [2019-11-24 04:40:23,270 INFO L226 Difference]: Without dead ends: 3245 [2019-11-24 04:40:23,275 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:40:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2019-11-24 04:40:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 1951. [2019-11-24 04:40:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2019-11-24 04:40:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3577 transitions. [2019-11-24 04:40:23,388 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3577 transitions. Word has length 32 [2019-11-24 04:40:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:23,388 INFO L462 AbstractCegarLoop]: Abstraction has 1951 states and 3577 transitions. [2019-11-24 04:40:23,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3577 transitions. [2019-11-24 04:40:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:40:23,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:23,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:23,391 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:40:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1569503815, now seen corresponding path program 1 times [2019-11-24 04:40:23,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:23,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042592322] [2019-11-24 04:40:23,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:23,580 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:40:23,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042592322] [2019-11-24 04:40:23,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:23,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:23,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181401712] [2019-11-24 04:40:23,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:23,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:23,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:23,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:23,583 INFO L87 Difference]: Start difference. First operand 1951 states and 3577 transitions. Second operand 3 states. [2019-11-24 04:40:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:24,464 INFO L93 Difference]: Finished difference Result 4954 states and 9100 transitions. [2019-11-24 04:40:24,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:24,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:40:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:24,482 INFO L225 Difference]: With dead ends: 4954 [2019-11-24 04:40:24,482 INFO L226 Difference]: Without dead ends: 3212 [2019-11-24 04:40:24,486 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:40:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2019-11-24 04:40:24,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 1921. [2019-11-24 04:40:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2019-11-24 04:40:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 3457 transitions. [2019-11-24 04:40:24,589 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 3457 transitions. Word has length 34 [2019-11-24 04:40:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:24,590 INFO L462 AbstractCegarLoop]: Abstraction has 1921 states and 3457 transitions. [2019-11-24 04:40:24,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 3457 transitions. [2019-11-24 04:40:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:40:24,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:24,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:24,592 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:40:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash -463906613, now seen corresponding path program 1 times [2019-11-24 04:40:24,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:24,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940635387] [2019-11-24 04:40:24,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:24,758 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:40:24,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940635387] [2019-11-24 04:40:24,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:24,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:24,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424590087] [2019-11-24 04:40:24,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:24,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:24,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:24,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:24,760 INFO L87 Difference]: Start difference. First operand 1921 states and 3457 transitions. Second operand 3 states. [2019-11-24 04:40:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:25,538 INFO L93 Difference]: Finished difference Result 4874 states and 8845 transitions. [2019-11-24 04:40:25,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:25,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:40:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:25,548 INFO L225 Difference]: With dead ends: 4874 [2019-11-24 04:40:25,548 INFO L226 Difference]: Without dead ends: 3194 [2019-11-24 04:40:25,552 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:40:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2019-11-24 04:40:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 1906. [2019-11-24 04:40:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2019-11-24 04:40:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 3352 transitions. [2019-11-24 04:40:25,719 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 3352 transitions. Word has length 37 [2019-11-24 04:40:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:25,720 INFO L462 AbstractCegarLoop]: Abstraction has 1906 states and 3352 transitions. [2019-11-24 04:40:25,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 3352 transitions. [2019-11-24 04:40:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:40:25,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:25,722 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:40:25,722 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:40:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:25,722 INFO L82 PathProgramCache]: Analyzing trace with hash -947227883, now seen corresponding path program 1 times [2019-11-24 04:40:25,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:25,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889406189] [2019-11-24 04:40:25,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:25,872 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:40:25,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889406189] [2019-11-24 04:40:25,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:25,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:25,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971075248] [2019-11-24 04:40:25,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:25,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:25,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:25,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:25,875 INFO L87 Difference]: Start difference. First operand 1906 states and 3352 transitions. Second operand 3 states. [2019-11-24 04:40:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:26,575 INFO L93 Difference]: Finished difference Result 3676 states and 6507 transitions. [2019-11-24 04:40:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:26,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:40:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:26,581 INFO L225 Difference]: With dead ends: 3676 [2019-11-24 04:40:26,582 INFO L226 Difference]: Without dead ends: 2048 [2019-11-24 04:40:26,584 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:40:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-11-24 04:40:26,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1906. [2019-11-24 04:40:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2019-11-24 04:40:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 3262 transitions. [2019-11-24 04:40:26,681 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 3262 transitions. Word has length 41 [2019-11-24 04:40:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:26,682 INFO L462 AbstractCegarLoop]: Abstraction has 1906 states and 3262 transitions. [2019-11-24 04:40:26,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 3262 transitions. [2019-11-24 04:40:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:40:26,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:26,684 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:40:26,684 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:40:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:26,684 INFO L82 PathProgramCache]: Analyzing trace with hash -288062608, now seen corresponding path program 1 times [2019-11-24 04:40:26,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:26,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720876923] [2019-11-24 04:40:26,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:26,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720876923] [2019-11-24 04:40:26,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:26,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:26,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078611281] [2019-11-24 04:40:26,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:26,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:26,870 INFO L87 Difference]: Start difference. First operand 1906 states and 3262 transitions. Second operand 5 states. [2019-11-24 04:40:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:27,936 INFO L93 Difference]: Finished difference Result 6740 states and 12148 transitions. [2019-11-24 04:40:27,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:27,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:40:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:27,947 INFO L225 Difference]: With dead ends: 6740 [2019-11-24 04:40:27,947 INFO L226 Difference]: Without dead ends: 4849 [2019-11-24 04:40:27,951 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:40:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4849 states. [2019-11-24 04:40:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4849 to 2028. [2019-11-24 04:40:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2028 states. [2019-11-24 04:40:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 3462 transitions. [2019-11-24 04:40:28,101 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 3462 transitions. Word has length 45 [2019-11-24 04:40:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:28,101 INFO L462 AbstractCegarLoop]: Abstraction has 2028 states and 3462 transitions. [2019-11-24 04:40:28,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 3462 transitions. [2019-11-24 04:40:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:40:28,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:28,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:28,103 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:40:28,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash -550203710, now seen corresponding path program 1 times [2019-11-24 04:40:28,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:28,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960317852] [2019-11-24 04:40:28,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:28,366 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:40:28,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960317852] [2019-11-24 04:40:28,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:28,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:28,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91074576] [2019-11-24 04:40:28,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:28,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:28,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:28,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:28,369 INFO L87 Difference]: Start difference. First operand 2028 states and 3462 transitions. Second operand 5 states. [2019-11-24 04:40:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:28,596 INFO L93 Difference]: Finished difference Result 3049 states and 5031 transitions. [2019-11-24 04:40:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:28,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-24 04:40:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:28,603 INFO L225 Difference]: With dead ends: 3049 [2019-11-24 04:40:28,604 INFO L226 Difference]: Without dead ends: 3031 [2019-11-24 04:40:28,605 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:40:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2019-11-24 04:40:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2042. [2019-11-24 04:40:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-11-24 04:40:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3476 transitions. [2019-11-24 04:40:28,772 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3476 transitions. Word has length 46 [2019-11-24 04:40:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:28,773 INFO L462 AbstractCegarLoop]: Abstraction has 2042 states and 3476 transitions. [2019-11-24 04:40:28,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3476 transitions. [2019-11-24 04:40:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:40:28,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:28,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:28,775 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:40:28,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:28,775 INFO L82 PathProgramCache]: Analyzing trace with hash 653336473, now seen corresponding path program 1 times [2019-11-24 04:40:28,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:28,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047130259] [2019-11-24 04:40:28,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:28,957 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:40:28,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047130259] [2019-11-24 04:40:28,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:28,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:28,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304678181] [2019-11-24 04:40:28,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:28,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:28,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:28,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:28,959 INFO L87 Difference]: Start difference. First operand 2042 states and 3476 transitions. Second operand 3 states. [2019-11-24 04:40:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:29,127 INFO L93 Difference]: Finished difference Result 2064 states and 3499 transitions. [2019-11-24 04:40:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:29,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 04:40:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:29,135 INFO L225 Difference]: With dead ends: 2064 [2019-11-24 04:40:29,135 INFO L226 Difference]: Without dead ends: 2046 [2019-11-24 04:40:29,138 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:40:29,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2019-11-24 04:40:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2042. [2019-11-24 04:40:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-11-24 04:40:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3462 transitions. [2019-11-24 04:40:29,330 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3462 transitions. Word has length 47 [2019-11-24 04:40:29,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:29,331 INFO L462 AbstractCegarLoop]: Abstraction has 2042 states and 3462 transitions. [2019-11-24 04:40:29,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3462 transitions. [2019-11-24 04:40:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:40:29,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:29,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:29,333 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:40:29,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1502990079, now seen corresponding path program 1 times [2019-11-24 04:40:29,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:29,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410053359] [2019-11-24 04:40:29,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:29,701 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:40:29,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410053359] [2019-11-24 04:40:29,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:29,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:40:29,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521791655] [2019-11-24 04:40:29,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:40:29,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:29,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:40:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:40:29,704 INFO L87 Difference]: Start difference. First operand 2042 states and 3462 transitions. Second operand 9 states. [2019-11-24 04:40:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:30,683 INFO L93 Difference]: Finished difference Result 3659 states and 6285 transitions. [2019-11-24 04:40:30,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:40:30,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-11-24 04:40:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:30,687 INFO L225 Difference]: With dead ends: 3659 [2019-11-24 04:40:30,688 INFO L226 Difference]: Without dead ends: 1689 [2019-11-24 04:40:30,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:40:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2019-11-24 04:40:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1589. [2019-11-24 04:40:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2019-11-24 04:40:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2786 transitions. [2019-11-24 04:40:30,839 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2786 transitions. Word has length 48 [2019-11-24 04:40:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:30,840 INFO L462 AbstractCegarLoop]: Abstraction has 1589 states and 2786 transitions. [2019-11-24 04:40:30,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:40:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2786 transitions. [2019-11-24 04:40:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:40:30,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:30,842 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:30,842 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:40:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:30,842 INFO L82 PathProgramCache]: Analyzing trace with hash -40458472, now seen corresponding path program 1 times [2019-11-24 04:40:30,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:30,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045254902] [2019-11-24 04:40:30,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:30,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045254902] [2019-11-24 04:40:30,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:30,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:40:30,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237476479] [2019-11-24 04:40:30,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:30,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:30,990 INFO L87 Difference]: Start difference. First operand 1589 states and 2786 transitions. Second operand 5 states. [2019-11-24 04:40:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:32,440 INFO L93 Difference]: Finished difference Result 5780 states and 10242 transitions. [2019-11-24 04:40:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:32,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-24 04:40:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:32,451 INFO L225 Difference]: With dead ends: 5780 [2019-11-24 04:40:32,451 INFO L226 Difference]: Without dead ends: 4263 [2019-11-24 04:40:32,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:40:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2019-11-24 04:40:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 2102. [2019-11-24 04:40:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2019-11-24 04:40:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 3609 transitions. [2019-11-24 04:40:32,646 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 3609 transitions. Word has length 64 [2019-11-24 04:40:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:32,646 INFO L462 AbstractCegarLoop]: Abstraction has 2102 states and 3609 transitions. [2019-11-24 04:40:32,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 3609 transitions. [2019-11-24 04:40:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 04:40:32,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:32,648 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:32,649 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:40:32,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:32,649 INFO L82 PathProgramCache]: Analyzing trace with hash -616777293, now seen corresponding path program 1 times [2019-11-24 04:40:32,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:32,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405818516] [2019-11-24 04:40:32,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:32,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405818516] [2019-11-24 04:40:32,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:32,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:40:32,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907193319] [2019-11-24 04:40:32,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:40:32,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:32,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:40:32,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:40:32,901 INFO L87 Difference]: Start difference. First operand 2102 states and 3609 transitions. Second operand 6 states. [2019-11-24 04:40:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:34,851 INFO L93 Difference]: Finished difference Result 8079 states and 14342 transitions. [2019-11-24 04:40:34,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 04:40:34,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-24 04:40:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:34,857 INFO L225 Difference]: With dead ends: 8079 [2019-11-24 04:40:34,857 INFO L226 Difference]: Without dead ends: 6047 [2019-11-24 04:40:34,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:40:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2019-11-24 04:40:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 1942. [2019-11-24 04:40:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-24 04:40:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3280 transitions. [2019-11-24 04:40:35,030 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3280 transitions. Word has length 65 [2019-11-24 04:40:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:35,031 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 3280 transitions. [2019-11-24 04:40:35,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:40:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3280 transitions. [2019-11-24 04:40:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 04:40:35,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:35,033 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:35,033 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:40:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2059237338, now seen corresponding path program 1 times [2019-11-24 04:40:35,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:35,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927459941] [2019-11-24 04:40:35,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:35,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927459941] [2019-11-24 04:40:35,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:35,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:40:35,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568443486] [2019-11-24 04:40:35,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:35,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:35,152 INFO L87 Difference]: Start difference. First operand 1942 states and 3280 transitions. Second operand 5 states. [2019-11-24 04:40:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:36,640 INFO L93 Difference]: Finished difference Result 7093 states and 12213 transitions. [2019-11-24 04:40:36,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:40:36,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-24 04:40:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:36,645 INFO L225 Difference]: With dead ends: 7093 [2019-11-24 04:40:36,645 INFO L226 Difference]: Without dead ends: 5228 [2019-11-24 04:40:36,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:40:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2019-11-24 04:40:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 2178. [2019-11-24 04:40:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2019-11-24 04:40:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 3596 transitions. [2019-11-24 04:40:37,028 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 3596 transitions. Word has length 65 [2019-11-24 04:40:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:37,028 INFO L462 AbstractCegarLoop]: Abstraction has 2178 states and 3596 transitions. [2019-11-24 04:40:37,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 3596 transitions. [2019-11-24 04:40:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 04:40:37,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:37,039 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:37,039 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:40:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1865991155, now seen corresponding path program 1 times [2019-11-24 04:40:37,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:37,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839820429] [2019-11-24 04:40:37,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:38,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839820429] [2019-11-24 04:40:38,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:38,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:40:38,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195776582] [2019-11-24 04:40:38,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:40:38,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:38,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:40:38,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:40:38,063 INFO L87 Difference]: Start difference. First operand 2178 states and 3596 transitions. Second operand 21 states. [2019-11-24 04:40:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:40,870 INFO L93 Difference]: Finished difference Result 6735 states and 11289 transitions. [2019-11-24 04:40:40,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:40:40,870 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-11-24 04:40:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:40,875 INFO L225 Difference]: With dead ends: 6735 [2019-11-24 04:40:40,875 INFO L226 Difference]: Without dead ends: 4636 [2019-11-24 04:40:40,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:40:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4636 states. [2019-11-24 04:40:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4636 to 2490. [2019-11-24 04:40:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2490 states. [2019-11-24 04:40:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 3969 transitions. [2019-11-24 04:40:41,242 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 3969 transitions. Word has length 66 [2019-11-24 04:40:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:41,243 INFO L462 AbstractCegarLoop]: Abstraction has 2490 states and 3969 transitions. [2019-11-24 04:40:41,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:40:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 3969 transitions. [2019-11-24 04:40:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 04:40:41,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:41,246 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:41,246 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:40:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash -164663675, now seen corresponding path program 1 times [2019-11-24 04:40:41,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:41,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330686109] [2019-11-24 04:40:41,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:41,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330686109] [2019-11-24 04:40:41,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:41,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:40:41,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212545860] [2019-11-24 04:40:41,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:40:41,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:40:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:40:41,400 INFO L87 Difference]: Start difference. First operand 2490 states and 3969 transitions. Second operand 6 states. [2019-11-24 04:40:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:42,940 INFO L93 Difference]: Finished difference Result 6653 states and 10898 transitions. [2019-11-24 04:40:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:42,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-24 04:40:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:42,945 INFO L225 Difference]: With dead ends: 6653 [2019-11-24 04:40:42,945 INFO L226 Difference]: Without dead ends: 4244 [2019-11-24 04:40:42,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:40:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2019-11-24 04:40:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 2410. [2019-11-24 04:40:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2019-11-24 04:40:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3869 transitions. [2019-11-24 04:40:43,167 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3869 transitions. Word has length 66 [2019-11-24 04:40:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:43,167 INFO L462 AbstractCegarLoop]: Abstraction has 2410 states and 3869 transitions. [2019-11-24 04:40:43,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:40:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3869 transitions. [2019-11-24 04:40:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 04:40:43,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:43,170 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:43,170 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:40:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash -224740872, now seen corresponding path program 1 times [2019-11-24 04:40:43,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:43,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829951158] [2019-11-24 04:40:43,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:43,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829951158] [2019-11-24 04:40:43,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864311680] [2019-11-24 04:40:43,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:40:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:44,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:40:44,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:40:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:44,682 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:40:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:44,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860008015] [2019-11-24 04:40:44,858 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2019-11-24 04:40:44,859 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:40:44,865 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:40:44,875 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:40:44,876 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs