/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:36:53,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:36:53,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:36:53,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:36:53,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:36:53,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:36:53,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:36:53,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:36:53,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:36:53,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:36:53,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:36:53,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:36:53,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:36:53,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:36:53,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:36:53,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:36:53,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:36:53,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:36:53,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:36:53,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:36:53,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:36:53,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:36:53,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:36:53,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:36:53,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:36:53,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:36:53,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:36:53,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:36:53,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:36:53,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:36:53,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:36:53,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:36:53,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:36:53,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:36:53,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:36:53,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:36:53,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:36:53,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:36:53,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:36:53,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:36:53,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:36:53,727 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:36:53,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:36:53,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:36:53,750 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:36:53,750 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:36:53,750 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:36:53,750 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:36:53,751 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:36:53,751 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:36:53,751 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:36:53,751 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:36:53,752 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:36:53,753 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:36:53,753 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:36:53,753 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:36:53,754 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:36:53,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:36:53,755 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:36:53,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:36:53,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:36:53,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:36:53,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:36:53,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:36:53,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:36:53,756 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:36:53,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:36:53,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:36:53,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:36:53,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:36:53,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:36:53,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:36:53,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:36:53,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:36:53,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:36:53,759 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:36:53,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:36:53,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:36:53,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:36:53,761 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:36:54,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:36:54,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:36:54,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:36:54,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:36:54,097 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:36:54,098 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product11.cil.c [2019-11-24 04:36:54,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aaeec8a1/bf6184cac8ee4019b1f1613cf3f399d0/FLAGa2c59db22 [2019-11-24 04:36:54,814 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:36:54,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product11.cil.c [2019-11-24 04:36:54,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aaeec8a1/bf6184cac8ee4019b1f1613cf3f399d0/FLAGa2c59db22 [2019-11-24 04:36:54,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aaeec8a1/bf6184cac8ee4019b1f1613cf3f399d0 [2019-11-24 04:36:55,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:36:55,002 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:36:55,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:36:55,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:36:55,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:36:55,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:55,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1348e435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55, skipping insertion in model container [2019-11-24 04:36:55,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:55,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:36:55,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:36:55,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:36:55,799 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:36:55,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:36:55,988 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:36:55,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55 WrapperNode [2019-11-24 04:36:55,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:36:55,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:36:55,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:36:55,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:36:55,998 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:36:55" (1/1) ... [2019-11-24 04:36:56,038 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:36:55" (1/1) ... [2019-11-24 04:36:56,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:36:56,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:36:56,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:36:56,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:36:56,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:36:56,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:36:56,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:36:56,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:36:56,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (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:36:56,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:36:56,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:36:56,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:36:56,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:37:29,894 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:37:29,895 INFO L284 CfgBuilder]: Removed 553 assume(true) statements. [2019-11-24 04:37:29,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:29 BoogieIcfgContainer [2019-11-24 04:37:29,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:37:29,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:37:29,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:37:29,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:37:29,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:36:54" (1/3) ... [2019-11-24 04:37:29,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e556629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:29, skipping insertion in model container [2019-11-24 04:37:29,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (2/3) ... [2019-11-24 04:37:29,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e556629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:29, skipping insertion in model container [2019-11-24 04:37:29,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:29" (3/3) ... [2019-11-24 04:37:29,905 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product11.cil.c [2019-11-24 04:37:29,914 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:37:29,922 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:37:29,933 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:37:29,961 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:37:29,961 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:37:29,961 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:37:29,961 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:37:29,962 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:37:29,962 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:37:29,962 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:37:29,962 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:37:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-11-24 04:37:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:37:30,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:30,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:30,003 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:37:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:30,010 INFO L82 PathProgramCache]: Analyzing trace with hash 580610657, now seen corresponding path program 1 times [2019-11-24 04:37:30,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:30,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616162972] [2019-11-24 04:37:30,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:30,496 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:37:30,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616162972] [2019-11-24 04:37:30,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:30,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:37:30,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747513948] [2019-11-24 04:37:30,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:37:30,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:30,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:37:30,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:37:30,523 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 2 states. [2019-11-24 04:37:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:30,624 INFO L93 Difference]: Finished difference Result 766 states and 1459 transitions. [2019-11-24 04:37:30,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:37:30,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:37:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:30,666 INFO L225 Difference]: With dead ends: 766 [2019-11-24 04:37:30,666 INFO L226 Difference]: Without dead ends: 747 [2019-11-24 04:37:30,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:37:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-24 04:37:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-24 04:37:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-24 04:37:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1429 transitions. [2019-11-24 04:37:30,794 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1429 transitions. Word has length 14 [2019-11-24 04:37:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:30,795 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1429 transitions. [2019-11-24 04:37:30,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:37:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1429 transitions. [2019-11-24 04:37:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:37:30,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:30,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:30,798 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:37:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:30,799 INFO L82 PathProgramCache]: Analyzing trace with hash 783207172, now seen corresponding path program 1 times [2019-11-24 04:37:30,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:30,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282724383] [2019-11-24 04:37:30,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:31,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:37:31,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282724383] [2019-11-24 04:37:31,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:31,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:31,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900345411] [2019-11-24 04:37:31,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:31,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:31,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:31,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:31,180 INFO L87 Difference]: Start difference. First operand 747 states and 1429 transitions. Second operand 5 states. [2019-11-24 04:37:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:31,686 INFO L93 Difference]: Finished difference Result 1613 states and 3033 transitions. [2019-11-24 04:37:31,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:31,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 04:37:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:31,695 INFO L225 Difference]: With dead ends: 1613 [2019-11-24 04:37:31,696 INFO L226 Difference]: Without dead ends: 1230 [2019-11-24 04:37:31,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-11-24 04:37:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 755. [2019-11-24 04:37:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-24 04:37:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1441 transitions. [2019-11-24 04:37:31,738 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1441 transitions. Word has length 15 [2019-11-24 04:37:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:31,738 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1441 transitions. [2019-11-24 04:37:31,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1441 transitions. [2019-11-24 04:37:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:37:31,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:31,745 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:37:31,746 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:37:31,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1331610706, now seen corresponding path program 1 times [2019-11-24 04:37:31,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:31,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373523633] [2019-11-24 04:37:31,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:31,893 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:37:31,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373523633] [2019-11-24 04:37:31,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:31,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:31,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668583844] [2019-11-24 04:37:31,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:31,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:31,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:31,896 INFO L87 Difference]: Start difference. First operand 755 states and 1441 transitions. Second operand 5 states. [2019-11-24 04:37:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:32,299 INFO L93 Difference]: Finished difference Result 1605 states and 3013 transitions. [2019-11-24 04:37:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:32,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 04:37:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:32,309 INFO L225 Difference]: With dead ends: 1605 [2019-11-24 04:37:32,314 INFO L226 Difference]: Without dead ends: 1218 [2019-11-24 04:37:32,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-11-24 04:37:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 761. [2019-11-24 04:37:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-24 04:37:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1451 transitions. [2019-11-24 04:37:32,349 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1451 transitions. Word has length 16 [2019-11-24 04:37:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:32,350 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1451 transitions. [2019-11-24 04:37:32,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1451 transitions. [2019-11-24 04:37:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:37:32,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:32,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:32,352 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:37:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1848285679, now seen corresponding path program 1 times [2019-11-24 04:37:32,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:32,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23322049] [2019-11-24 04:37:32,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:32,508 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:37:32,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23322049] [2019-11-24 04:37:32,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:32,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:32,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517669306] [2019-11-24 04:37:32,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:32,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:32,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:32,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:32,510 INFO L87 Difference]: Start difference. First operand 761 states and 1451 transitions. Second operand 5 states. [2019-11-24 04:37:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:32,969 INFO L93 Difference]: Finished difference Result 1596 states and 2992 transitions. [2019-11-24 04:37:32,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:32,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:37:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:32,977 INFO L225 Difference]: With dead ends: 1596 [2019-11-24 04:37:32,977 INFO L226 Difference]: Without dead ends: 1206 [2019-11-24 04:37:32,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2019-11-24 04:37:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 767. [2019-11-24 04:37:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-24 04:37:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1461 transitions. [2019-11-24 04:37:33,009 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1461 transitions. Word has length 17 [2019-11-24 04:37:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:33,009 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1461 transitions. [2019-11-24 04:37:33,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1461 transitions. [2019-11-24 04:37:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:37:33,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:33,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:33,011 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:37:33,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:33,011 INFO L82 PathProgramCache]: Analyzing trace with hash 906628858, now seen corresponding path program 1 times [2019-11-24 04:37:33,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:33,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596725660] [2019-11-24 04:37:33,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:33,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596725660] [2019-11-24 04:37:33,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:33,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:33,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938358065] [2019-11-24 04:37:33,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:33,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:33,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:33,138 INFO L87 Difference]: Start difference. First operand 767 states and 1461 transitions. Second operand 5 states. [2019-11-24 04:37:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:34,020 INFO L93 Difference]: Finished difference Result 1551 states and 2941 transitions. [2019-11-24 04:37:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:37:34,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:37:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:34,026 INFO L225 Difference]: With dead ends: 1551 [2019-11-24 04:37:34,027 INFO L226 Difference]: Without dead ends: 1017 [2019-11-24 04:37:34,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:34,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-11-24 04:37:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 999. [2019-11-24 04:37:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-11-24 04:37:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1865 transitions. [2019-11-24 04:37:34,073 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1865 transitions. Word has length 17 [2019-11-24 04:37:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:34,074 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 1865 transitions. [2019-11-24 04:37:34,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1865 transitions. [2019-11-24 04:37:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:37:34,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:34,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:34,076 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:37:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1959258950, now seen corresponding path program 1 times [2019-11-24 04:37:34,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:34,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961258445] [2019-11-24 04:37:34,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:34,221 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:37:34,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961258445] [2019-11-24 04:37:34,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:34,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:34,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415204130] [2019-11-24 04:37:34,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:34,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:34,223 INFO L87 Difference]: Start difference. First operand 999 states and 1865 transitions. Second operand 5 states. [2019-11-24 04:37:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:34,386 INFO L93 Difference]: Finished difference Result 1697 states and 3164 transitions. [2019-11-24 04:37:34,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:34,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:37:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:34,397 INFO L225 Difference]: With dead ends: 1697 [2019-11-24 04:37:34,397 INFO L226 Difference]: Without dead ends: 1684 [2019-11-24 04:37:34,398 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:37:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-11-24 04:37:34,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1003. [2019-11-24 04:37:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-11-24 04:37:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1869 transitions. [2019-11-24 04:37:34,447 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1869 transitions. Word has length 18 [2019-11-24 04:37:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:34,448 INFO L462 AbstractCegarLoop]: Abstraction has 1003 states and 1869 transitions. [2019-11-24 04:37:34,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1869 transitions. [2019-11-24 04:37:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:37:34,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:34,450 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:37:34,450 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:37:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:34,451 INFO L82 PathProgramCache]: Analyzing trace with hash 168431059, now seen corresponding path program 1 times [2019-11-24 04:37:34,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:34,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754114292] [2019-11-24 04:37:34,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:34,565 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:37:34,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754114292] [2019-11-24 04:37:34,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:34,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:34,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060600229] [2019-11-24 04:37:34,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:34,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:34,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:34,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:34,568 INFO L87 Difference]: Start difference. First operand 1003 states and 1869 transitions. Second operand 3 states. [2019-11-24 04:37:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:34,639 INFO L93 Difference]: Finished difference Result 1016 states and 1881 transitions. [2019-11-24 04:37:34,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:34,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:37:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:34,649 INFO L225 Difference]: With dead ends: 1016 [2019-11-24 04:37:34,649 INFO L226 Difference]: Without dead ends: 1003 [2019-11-24 04:37:34,650 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:37:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-11-24 04:37:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2019-11-24 04:37:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-11-24 04:37:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1867 transitions. [2019-11-24 04:37:34,710 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1867 transitions. Word has length 19 [2019-11-24 04:37:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:34,710 INFO L462 AbstractCegarLoop]: Abstraction has 1003 states and 1867 transitions. [2019-11-24 04:37:34,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1867 transitions. [2019-11-24 04:37:34,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:37:34,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:34,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:34,712 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:37:34,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash -158849862, now seen corresponding path program 1 times [2019-11-24 04:37:34,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:34,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867346076] [2019-11-24 04:37:34,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:35,112 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:37:35,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867346076] [2019-11-24 04:37:35,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:35,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:35,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300719815] [2019-11-24 04:37:35,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:35,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:35,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:35,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:35,114 INFO L87 Difference]: Start difference. First operand 1003 states and 1867 transitions. Second operand 6 states. [2019-11-24 04:37:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:35,944 INFO L93 Difference]: Finished difference Result 1868 states and 3469 transitions. [2019-11-24 04:37:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:35,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-24 04:37:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:35,951 INFO L225 Difference]: With dead ends: 1868 [2019-11-24 04:37:35,951 INFO L226 Difference]: Without dead ends: 1016 [2019-11-24 04:37:35,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-11-24 04:37:36,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1003. [2019-11-24 04:37:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-11-24 04:37:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1861 transitions. [2019-11-24 04:37:36,061 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1861 transitions. Word has length 20 [2019-11-24 04:37:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:36,061 INFO L462 AbstractCegarLoop]: Abstraction has 1003 states and 1861 transitions. [2019-11-24 04:37:36,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1861 transitions. [2019-11-24 04:37:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:37:36,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:36,063 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:37:36,063 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:37:36,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1218128679, now seen corresponding path program 1 times [2019-11-24 04:37:36,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:36,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822108388] [2019-11-24 04:37:36,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:36,152 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:37:36,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822108388] [2019-11-24 04:37:36,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:36,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:36,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150801525] [2019-11-24 04:37:36,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:36,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:36,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:36,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:36,154 INFO L87 Difference]: Start difference. First operand 1003 states and 1861 transitions. Second operand 5 states. [2019-11-24 04:37:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:36,331 INFO L93 Difference]: Finished difference Result 2055 states and 3767 transitions. [2019-11-24 04:37:36,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:37:36,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:37:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:36,340 INFO L225 Difference]: With dead ends: 2055 [2019-11-24 04:37:36,340 INFO L226 Difference]: Without dead ends: 1588 [2019-11-24 04:37:36,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:37:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2019-11-24 04:37:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1001. [2019-11-24 04:37:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-11-24 04:37:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1857 transitions. [2019-11-24 04:37:36,390 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1857 transitions. Word has length 23 [2019-11-24 04:37:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:36,391 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1857 transitions. [2019-11-24 04:37:36,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1857 transitions. [2019-11-24 04:37:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:37:36,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:36,392 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:37:36,393 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:37:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash -601547932, now seen corresponding path program 1 times [2019-11-24 04:37:36,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:36,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917645848] [2019-11-24 04:37:36,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:36,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917645848] [2019-11-24 04:37:36,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:36,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:36,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78478099] [2019-11-24 04:37:36,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:36,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:36,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:36,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:36,483 INFO L87 Difference]: Start difference. First operand 1001 states and 1857 transitions. Second operand 5 states. [2019-11-24 04:37:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:36,818 INFO L93 Difference]: Finished difference Result 1770 states and 3235 transitions. [2019-11-24 04:37:36,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:36,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:37:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:36,826 INFO L225 Difference]: With dead ends: 1770 [2019-11-24 04:37:36,827 INFO L226 Difference]: Without dead ends: 1366 [2019-11-24 04:37:36,829 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:37:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-11-24 04:37:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1010. [2019-11-24 04:37:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-11-24 04:37:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1866 transitions. [2019-11-24 04:37:36,887 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1866 transitions. Word has length 23 [2019-11-24 04:37:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:36,887 INFO L462 AbstractCegarLoop]: Abstraction has 1010 states and 1866 transitions. [2019-11-24 04:37:36,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1866 transitions. [2019-11-24 04:37:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:37:36,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:36,889 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] [2019-11-24 04:37:36,889 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:37:36,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1845201928, now seen corresponding path program 1 times [2019-11-24 04:37:36,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:36,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974397729] [2019-11-24 04:37:36,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:37,015 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:37:37,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974397729] [2019-11-24 04:37:37,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:37,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:37,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604700226] [2019-11-24 04:37:37,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:37,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:37,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:37,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:37,017 INFO L87 Difference]: Start difference. First operand 1010 states and 1866 transitions. Second operand 6 states. [2019-11-24 04:37:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:37,650 INFO L93 Difference]: Finished difference Result 1986 states and 3654 transitions. [2019-11-24 04:37:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:37,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-24 04:37:37,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:37,661 INFO L225 Difference]: With dead ends: 1986 [2019-11-24 04:37:37,662 INFO L226 Difference]: Without dead ends: 1530 [2019-11-24 04:37:37,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:37:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2019-11-24 04:37:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 963. [2019-11-24 04:37:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-24 04:37:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1789 transitions. [2019-11-24 04:37:37,729 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1789 transitions. Word has length 28 [2019-11-24 04:37:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:37,729 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1789 transitions. [2019-11-24 04:37:37,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1789 transitions. [2019-11-24 04:37:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:37:37,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:37,732 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] [2019-11-24 04:37:37,732 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:37:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash 785402490, now seen corresponding path program 1 times [2019-11-24 04:37:37,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:37,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036132509] [2019-11-24 04:37:37,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:38,013 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:37:38,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036132509] [2019-11-24 04:37:38,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:38,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:38,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200173329] [2019-11-24 04:37:38,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:38,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:38,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:38,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:38,015 INFO L87 Difference]: Start difference. First operand 963 states and 1789 transitions. Second operand 4 states. [2019-11-24 04:37:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:38,528 INFO L93 Difference]: Finished difference Result 1706 states and 3142 transitions. [2019-11-24 04:37:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:38,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 04:37:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:38,536 INFO L225 Difference]: With dead ends: 1706 [2019-11-24 04:37:38,536 INFO L226 Difference]: Without dead ends: 1285 [2019-11-24 04:37:38,537 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:37:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2019-11-24 04:37:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 984. [2019-11-24 04:37:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-24 04:37:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1821 transitions. [2019-11-24 04:37:38,590 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1821 transitions. Word has length 28 [2019-11-24 04:37:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:38,591 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1821 transitions. [2019-11-24 04:37:38,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1821 transitions. [2019-11-24 04:37:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:37:38,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:38,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] [2019-11-24 04:37:38,592 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:37:38,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:38,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1709164692, now seen corresponding path program 1 times [2019-11-24 04:37:38,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:38,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810503453] [2019-11-24 04:37:38,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:38,780 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:37:38,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810503453] [2019-11-24 04:37:38,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:38,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:38,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993923210] [2019-11-24 04:37:38,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:38,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:38,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:38,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:38,785 INFO L87 Difference]: Start difference. First operand 984 states and 1821 transitions. Second operand 5 states. [2019-11-24 04:37:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:39,871 INFO L93 Difference]: Finished difference Result 2739 states and 5044 transitions. [2019-11-24 04:37:39,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:39,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-24 04:37:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:39,882 INFO L225 Difference]: With dead ends: 2739 [2019-11-24 04:37:39,882 INFO L226 Difference]: Without dead ends: 2024 [2019-11-24 04:37:39,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2019-11-24 04:37:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1294. [2019-11-24 04:37:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-11-24 04:37:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2363 transitions. [2019-11-24 04:37:39,964 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2363 transitions. Word has length 28 [2019-11-24 04:37:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:39,964 INFO L462 AbstractCegarLoop]: Abstraction has 1294 states and 2363 transitions. [2019-11-24 04:37:39,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2363 transitions. [2019-11-24 04:37:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:37:39,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:39,966 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:39,966 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:37:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:39,967 INFO L82 PathProgramCache]: Analyzing trace with hash 185014646, now seen corresponding path program 1 times [2019-11-24 04:37:39,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:39,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639845848] [2019-11-24 04:37:39,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:40,052 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:37:40,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639845848] [2019-11-24 04:37:40,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:40,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:40,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561025453] [2019-11-24 04:37:40,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:40,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:40,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:40,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:40,054 INFO L87 Difference]: Start difference. First operand 1294 states and 2363 transitions. Second operand 3 states. [2019-11-24 04:37:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:40,281 INFO L93 Difference]: Finished difference Result 3300 states and 6032 transitions. [2019-11-24 04:37:40,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:40,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 04:37:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:40,293 INFO L225 Difference]: With dead ends: 3300 [2019-11-24 04:37:40,293 INFO L226 Difference]: Without dead ends: 2295 [2019-11-24 04:37:40,295 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:37:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-11-24 04:37:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2290. [2019-11-24 04:37:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-11-24 04:37:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 4184 transitions. [2019-11-24 04:37:40,409 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 4184 transitions. Word has length 29 [2019-11-24 04:37:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:40,411 INFO L462 AbstractCegarLoop]: Abstraction has 2290 states and 4184 transitions. [2019-11-24 04:37:40,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 4184 transitions. [2019-11-24 04:37:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:37:40,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:40,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:40,413 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:37:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1440504263, now seen corresponding path program 1 times [2019-11-24 04:37:40,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:40,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328992303] [2019-11-24 04:37:40,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:40,517 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:37:40,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328992303] [2019-11-24 04:37:40,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:40,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:37:40,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729720873] [2019-11-24 04:37:40,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:40,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:40,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:40,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:40,519 INFO L87 Difference]: Start difference. First operand 2290 states and 4184 transitions. Second operand 6 states. [2019-11-24 04:37:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:41,156 INFO L93 Difference]: Finished difference Result 4073 states and 7413 transitions. [2019-11-24 04:37:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:41,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-24 04:37:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:41,169 INFO L225 Difference]: With dead ends: 4073 [2019-11-24 04:37:41,169 INFO L226 Difference]: Without dead ends: 2285 [2019-11-24 04:37:41,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-11-24 04:37:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2281. [2019-11-24 04:37:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-11-24 04:37:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 4131 transitions. [2019-11-24 04:37:41,292 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 4131 transitions. Word has length 30 [2019-11-24 04:37:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:41,292 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 4131 transitions. [2019-11-24 04:37:41,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 4131 transitions. [2019-11-24 04:37:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:37:41,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:41,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:41,294 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:37:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:41,294 INFO L82 PathProgramCache]: Analyzing trace with hash 542534588, now seen corresponding path program 1 times [2019-11-24 04:37:41,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:41,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295914204] [2019-11-24 04:37:41,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:41,659 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:37:41,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295914204] [2019-11-24 04:37:41,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:41,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:37:41,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871837976] [2019-11-24 04:37:41,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:37:41,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:41,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:37:41,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:37:41,662 INFO L87 Difference]: Start difference. First operand 2281 states and 4131 transitions. Second operand 9 states. [2019-11-24 04:37:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:43,334 INFO L93 Difference]: Finished difference Result 3474 states and 6214 transitions. [2019-11-24 04:37:43,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:37:43,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-24 04:37:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:43,342 INFO L225 Difference]: With dead ends: 3474 [2019-11-24 04:37:43,343 INFO L226 Difference]: Without dead ends: 2621 [2019-11-24 04:37:43,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-24 04:37:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2019-11-24 04:37:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2526. [2019-11-24 04:37:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2019-11-24 04:37:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 4503 transitions. [2019-11-24 04:37:43,501 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 4503 transitions. Word has length 30 [2019-11-24 04:37:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:43,501 INFO L462 AbstractCegarLoop]: Abstraction has 2526 states and 4503 transitions. [2019-11-24 04:37:43,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:37:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 4503 transitions. [2019-11-24 04:37:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:37:43,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:43,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:43,503 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:37:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:43,503 INFO L82 PathProgramCache]: Analyzing trace with hash 282324212, now seen corresponding path program 1 times [2019-11-24 04:37:43,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:43,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936655444] [2019-11-24 04:37:43,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:43,655 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:37:43,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936655444] [2019-11-24 04:37:43,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:43,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:43,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726866635] [2019-11-24 04:37:43,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:43,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:43,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:43,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:43,657 INFO L87 Difference]: Start difference. First operand 2526 states and 4503 transitions. Second operand 3 states. [2019-11-24 04:37:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:44,805 INFO L93 Difference]: Finished difference Result 5279 states and 9272 transitions. [2019-11-24 04:37:44,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:44,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:37:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:44,813 INFO L225 Difference]: With dead ends: 5279 [2019-11-24 04:37:44,813 INFO L226 Difference]: Without dead ends: 3099 [2019-11-24 04:37:44,818 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:37:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2019-11-24 04:37:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 2386. [2019-11-24 04:37:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2019-11-24 04:37:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 4153 transitions. [2019-11-24 04:37:44,935 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 4153 transitions. Word has length 35 [2019-11-24 04:37:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:44,935 INFO L462 AbstractCegarLoop]: Abstraction has 2386 states and 4153 transitions. [2019-11-24 04:37:44,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 4153 transitions. [2019-11-24 04:37:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:37:44,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:44,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:44,937 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:37:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:44,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1003597529, now seen corresponding path program 1 times [2019-11-24 04:37:44,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:44,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687043435] [2019-11-24 04:37:44,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:45,066 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:37:45,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687043435] [2019-11-24 04:37:45,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:45,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:45,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005969868] [2019-11-24 04:37:45,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:45,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:45,068 INFO L87 Difference]: Start difference. First operand 2386 states and 4153 transitions. Second operand 3 states. [2019-11-24 04:37:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:46,128 INFO L93 Difference]: Finished difference Result 5005 states and 8603 transitions. [2019-11-24 04:37:46,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:46,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:37:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:46,134 INFO L225 Difference]: With dead ends: 5005 [2019-11-24 04:37:46,134 INFO L226 Difference]: Without dead ends: 2987 [2019-11-24 04:37:46,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:37:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2019-11-24 04:37:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2281. [2019-11-24 04:37:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-11-24 04:37:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3838 transitions. [2019-11-24 04:37:46,253 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3838 transitions. Word has length 36 [2019-11-24 04:37:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:46,253 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 3838 transitions. [2019-11-24 04:37:46,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3838 transitions. [2019-11-24 04:37:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 04:37:46,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:46,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:46,255 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:37:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:46,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1163878690, now seen corresponding path program 1 times [2019-11-24 04:37:46,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:46,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185472438] [2019-11-24 04:37:46,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:46,422 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:37:46,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185472438] [2019-11-24 04:37:46,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:46,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:46,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064307093] [2019-11-24 04:37:46,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:46,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:46,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:46,424 INFO L87 Difference]: Start difference. First operand 2281 states and 3838 transitions. Second operand 6 states. [2019-11-24 04:37:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:48,188 INFO L93 Difference]: Finished difference Result 4714 states and 7745 transitions. [2019-11-24 04:37:48,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:37:48,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-24 04:37:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:48,194 INFO L225 Difference]: With dead ends: 4714 [2019-11-24 04:37:48,194 INFO L226 Difference]: Without dead ends: 2727 [2019-11-24 04:37:48,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:37:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2019-11-24 04:37:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 1503. [2019-11-24 04:37:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-24 04:37:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2451 transitions. [2019-11-24 04:37:48,327 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2451 transitions. Word has length 38 [2019-11-24 04:37:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:48,327 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 2451 transitions. [2019-11-24 04:37:48,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2451 transitions. [2019-11-24 04:37:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:37:48,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:48,328 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] [2019-11-24 04:37:48,329 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:37:48,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:48,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1985393880, now seen corresponding path program 1 times [2019-11-24 04:37:48,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:48,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598377073] [2019-11-24 04:37:48,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:48,460 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:37:48,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598377073] [2019-11-24 04:37:48,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:48,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:37:48,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362471080] [2019-11-24 04:37:48,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:37:48,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:48,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:37:48,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:48,463 INFO L87 Difference]: Start difference. First operand 1503 states and 2451 transitions. Second operand 7 states. [2019-11-24 04:37:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:50,077 INFO L93 Difference]: Finished difference Result 4299 states and 7184 transitions. [2019-11-24 04:37:50,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 04:37:50,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-11-24 04:37:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:50,086 INFO L225 Difference]: With dead ends: 4299 [2019-11-24 04:37:50,086 INFO L226 Difference]: Without dead ends: 3287 [2019-11-24 04:37:50,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:37:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2019-11-24 04:37:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 2720. [2019-11-24 04:37:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2019-11-24 04:37:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 4384 transitions. [2019-11-24 04:37:50,361 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 4384 transitions. Word has length 49 [2019-11-24 04:37:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:50,361 INFO L462 AbstractCegarLoop]: Abstraction has 2720 states and 4384 transitions. [2019-11-24 04:37:50,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:37:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 4384 transitions. [2019-11-24 04:37:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:37:50,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:50,364 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] [2019-11-24 04:37:50,364 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:37:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash 169200970, now seen corresponding path program 1 times [2019-11-24 04:37:50,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:50,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659469301] [2019-11-24 04:37:50,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:50,515 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:37:50,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659469301] [2019-11-24 04:37:50,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:50,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:37:50,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269013808] [2019-11-24 04:37:50,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:37:50,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:37:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:37:50,523 INFO L87 Difference]: Start difference. First operand 2720 states and 4384 transitions. Second operand 9 states. [2019-11-24 04:37:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:51,585 INFO L93 Difference]: Finished difference Result 7990 states and 13086 transitions. [2019-11-24 04:37:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 04:37:51,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-24 04:37:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:51,598 INFO L225 Difference]: With dead ends: 7990 [2019-11-24 04:37:51,599 INFO L226 Difference]: Without dead ends: 5786 [2019-11-24 04:37:51,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:37:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5786 states. [2019-11-24 04:37:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5786 to 2711. [2019-11-24 04:37:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2019-11-24 04:37:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4320 transitions. [2019-11-24 04:37:51,928 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4320 transitions. Word has length 51 [2019-11-24 04:37:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:51,928 INFO L462 AbstractCegarLoop]: Abstraction has 2711 states and 4320 transitions. [2019-11-24 04:37:51,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:37:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4320 transitions. [2019-11-24 04:37:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 04:37:51,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:51,930 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] [2019-11-24 04:37:51,930 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:37:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash 983918355, now seen corresponding path program 1 times [2019-11-24 04:37:51,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:51,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367402595] [2019-11-24 04:37:51,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:52,061 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:37:52,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367402595] [2019-11-24 04:37:52,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303146203] [2019-11-24 04:37:52,062 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:37:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:52,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:37:52,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:37:52,600 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:37:52,601 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:37:52,655 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:37:52,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [387065627] [2019-11-24 04:37:52,702 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2019-11-24 04:37:52,702 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:37:52,711 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:37:52,720 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:37:52,722 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs