/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/email_spec9_product14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:14:19,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:14:19,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:14:19,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:14:19,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:14:19,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:14:19,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:14:19,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:14:19,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:14:19,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:14:19,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:14:19,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:14:19,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:14:19,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:14:19,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:14:19,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:14:19,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:14:19,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:14:19,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:14:19,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:14:19,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:14:19,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:14:19,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:14:19,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:14:19,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:14:19,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:14:19,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:14:19,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:14:19,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:14:19,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:14:19,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:14:19,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:14:19,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:14:19,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:14:19,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:14:19,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:14:19,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:14:19,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:14:19,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:14:19,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:14:19,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:14:19,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 05:14:19,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:14:19,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:14:19,750 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:14:19,750 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:14:19,751 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:14:19,751 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:14:19,751 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:14:19,751 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:14:19,751 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:14:19,751 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:14:19,752 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:14:19,752 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:14:19,752 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:14:19,752 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:14:19,752 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:14:19,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:14:19,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:14:19,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:14:19,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:14:19,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:14:19,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:14:19,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:14:19,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:14:19,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:14:19,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:14:19,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:14:19,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:14:19,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:14:19,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:14:19,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:14:19,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:14:19,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:14:19,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:14:19,757 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:14:19,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:14:19,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:14:19,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:14:19,757 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:14:20,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:14:20,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:14:20,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:14:20,041 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:14:20,041 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:14:20,042 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product14.cil.c [2019-11-24 05:14:20,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4097ef0/39719525e6674da19f7ef01a042747ac/FLAG262e4982b [2019-11-24 05:14:20,765 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:14:20,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product14.cil.c [2019-11-24 05:14:20,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4097ef0/39719525e6674da19f7ef01a042747ac/FLAG262e4982b [2019-11-24 05:14:21,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4097ef0/39719525e6674da19f7ef01a042747ac [2019-11-24 05:14:21,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:14:21,046 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:14:21,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:14:21,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:14:21,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:14:21,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:14:21" (1/1) ... [2019-11-24 05:14:21,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e6ed37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:21, skipping insertion in model container [2019-11-24 05:14:21,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:14:21" (1/1) ... [2019-11-24 05:14:21,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:14:21,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:14:21,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:14:21,886 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:14:22,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:14:22,120 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:14:22,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22 WrapperNode [2019-11-24 05:14:22,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:14:22,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:14:22,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:14:22,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:14:22,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (1/1) ... [2019-11-24 05:14:22,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (1/1) ... [2019-11-24 05:14:22,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:14:22,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:14:22,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:14:22,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:14:22,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (1/1) ... [2019-11-24 05:14:22,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (1/1) ... [2019-11-24 05:14:22,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (1/1) ... [2019-11-24 05:14:22,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (1/1) ... [2019-11-24 05:14:22,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (1/1) ... [2019-11-24 05:14:22,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (1/1) ... [2019-11-24 05:14:22,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (1/1) ... [2019-11-24 05:14:22,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:14:22,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:14:22,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:14:22,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:14:22,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (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 05:14:22,502 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 05:14:22,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 05:14:22,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 05:14:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:14:22,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:14:33,031 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:14:33,031 INFO L284 CfgBuilder]: Removed 465 assume(true) statements. [2019-11-24 05:14:33,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:14:33 BoogieIcfgContainer [2019-11-24 05:14:33,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:14:33,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:14:33,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:14:33,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:14:33,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:14:21" (1/3) ... [2019-11-24 05:14:33,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6305565e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:14:33, skipping insertion in model container [2019-11-24 05:14:33,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:22" (2/3) ... [2019-11-24 05:14:33,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6305565e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:14:33, skipping insertion in model container [2019-11-24 05:14:33,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:14:33" (3/3) ... [2019-11-24 05:14:33,047 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product14.cil.c [2019-11-24 05:14:33,058 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:14:33,064 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:14:33,073 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:14:33,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:14:33,098 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:14:33,098 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:14:33,098 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:14:33,098 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:14:33,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:14:33,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:14:33,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:14:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 05:14:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 05:14:33,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:33,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:14:33,124 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:33,130 INFO L82 PathProgramCache]: Analyzing trace with hash 40386823, now seen corresponding path program 1 times [2019-11-24 05:14:33,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:33,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101364658] [2019-11-24 05:14:33,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:33,492 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 05:14:33,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101364658] [2019-11-24 05:14:33,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:33,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:14:33,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162392843] [2019-11-24 05:14:33,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 05:14:33,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:33,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 05:14:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:14:33,520 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2019-11-24 05:14:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:33,552 INFO L93 Difference]: Finished difference Result 100 states and 153 transitions. [2019-11-24 05:14:33,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 05:14:33,554 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 05:14:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:33,566 INFO L225 Difference]: With dead ends: 100 [2019-11-24 05:14:33,566 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 05:14:33,570 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 05:14:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 05:14:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-24 05:14:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 05:14:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2019-11-24 05:14:33,614 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 8 [2019-11-24 05:14:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:33,614 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2019-11-24 05:14:33,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 05:14:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2019-11-24 05:14:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 05:14:33,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:33,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:14:33,616 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1848233376, now seen corresponding path program 1 times [2019-11-24 05:14:33,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:33,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042899059] [2019-11-24 05:14:33,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:33,755 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 05:14:33,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042899059] [2019-11-24 05:14:33,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:33,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:33,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717609810] [2019-11-24 05:14:33,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:33,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:33,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:33,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:33,759 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 3 states. [2019-11-24 05:14:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:33,786 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-24 05:14:33,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:33,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 05:14:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:33,793 INFO L225 Difference]: With dead ends: 94 [2019-11-24 05:14:33,793 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 05:14:33,795 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 05:14:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 05:14:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 05:14:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 05:14:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 05:14:33,818 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 9 [2019-11-24 05:14:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:33,819 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 05:14:33,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 05:14:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 05:14:33,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:33,822 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:14:33,822 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash 543449188, now seen corresponding path program 1 times [2019-11-24 05:14:33,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:33,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81709589] [2019-11-24 05:14:33,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:14:34,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81709589] [2019-11-24 05:14:34,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:34,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:14:34,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461736663] [2019-11-24 05:14:34,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:34,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:34,019 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 05:14:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:34,112 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2019-11-24 05:14:34,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:34,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 05:14:34,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:34,114 INFO L225 Difference]: With dead ends: 86 [2019-11-24 05:14:34,114 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 05:14:34,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:14:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 05:14:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-24 05:14:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 05:14:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-24 05:14:34,123 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2019-11-24 05:14:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:34,124 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-24 05:14:34,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-24 05:14:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:14:34,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:34,125 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:14:34,125 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:34,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash 301244399, now seen corresponding path program 1 times [2019-11-24 05:14:34,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:34,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824814528] [2019-11-24 05:14:34,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:14:34,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824814528] [2019-11-24 05:14:34,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:34,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:14:34,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172557302] [2019-11-24 05:14:34,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:14:34,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:34,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:14:34,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:14:34,339 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 5 states. [2019-11-24 05:14:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:34,662 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2019-11-24 05:14:34,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 05:14:34,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 05:14:34,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:34,664 INFO L225 Difference]: With dead ends: 124 [2019-11-24 05:14:34,664 INFO L226 Difference]: Without dead ends: 101 [2019-11-24 05:14:34,665 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 05:14:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-24 05:14:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-11-24 05:14:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-24 05:14:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 129 transitions. [2019-11-24 05:14:34,676 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 129 transitions. Word has length 15 [2019-11-24 05:14:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:34,676 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 129 transitions. [2019-11-24 05:14:34,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:14:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 129 transitions. [2019-11-24 05:14:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:14:34,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:34,678 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:14:34,678 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:34,679 INFO L82 PathProgramCache]: Analyzing trace with hash -675574307, now seen corresponding path program 1 times [2019-11-24 05:14:34,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:34,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883083247] [2019-11-24 05:14:34,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:14:34,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883083247] [2019-11-24 05:14:34,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:34,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:34,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657895057] [2019-11-24 05:14:34,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:14:34,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:14:34,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:14:34,789 INFO L87 Difference]: Start difference. First operand 81 states and 129 transitions. Second operand 4 states. [2019-11-24 05:14:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:34,810 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2019-11-24 05:14:34,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:14:34,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 05:14:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:34,811 INFO L225 Difference]: With dead ends: 81 [2019-11-24 05:14:34,811 INFO L226 Difference]: Without dead ends: 60 [2019-11-24 05:14:34,812 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 05:14:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-24 05:14:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-24 05:14:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-24 05:14:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2019-11-24 05:14:34,821 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 18 [2019-11-24 05:14:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:34,821 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2019-11-24 05:14:34,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:14:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2019-11-24 05:14:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 05:14:34,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:34,822 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] [2019-11-24 05:14:34,823 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:34,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash -439932052, now seen corresponding path program 1 times [2019-11-24 05:14:34,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:34,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284186948] [2019-11-24 05:14:34,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:34,882 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 05:14:34,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284186948] [2019-11-24 05:14:34,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:34,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:34,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920402038] [2019-11-24 05:14:34,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:34,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:34,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:34,884 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 3 states. [2019-11-24 05:14:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:34,906 INFO L93 Difference]: Finished difference Result 168 states and 292 transitions. [2019-11-24 05:14:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:34,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 05:14:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:34,909 INFO L225 Difference]: With dead ends: 168 [2019-11-24 05:14:34,909 INFO L226 Difference]: Without dead ends: 112 [2019-11-24 05:14:34,910 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 05:14:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-24 05:14:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2019-11-24 05:14:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-24 05:14:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 185 transitions. [2019-11-24 05:14:34,931 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 185 transitions. Word has length 22 [2019-11-24 05:14:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:34,931 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 185 transitions. [2019-11-24 05:14:34,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 185 transitions. [2019-11-24 05:14:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 05:14:34,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:34,935 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] [2019-11-24 05:14:34,935 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:34,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1831118467, now seen corresponding path program 1 times [2019-11-24 05:14:34,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:34,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130304208] [2019-11-24 05:14:34,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:35,006 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 05:14:35,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130304208] [2019-11-24 05:14:35,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:35,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:35,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172083038] [2019-11-24 05:14:35,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:35,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:35,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:35,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:35,009 INFO L87 Difference]: Start difference. First operand 104 states and 185 transitions. Second operand 3 states. [2019-11-24 05:14:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:35,028 INFO L93 Difference]: Finished difference Result 304 states and 543 transitions. [2019-11-24 05:14:35,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:35,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 05:14:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:35,030 INFO L225 Difference]: With dead ends: 304 [2019-11-24 05:14:35,030 INFO L226 Difference]: Without dead ends: 202 [2019-11-24 05:14:35,032 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 05:14:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-24 05:14:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2019-11-24 05:14:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-24 05:14:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 349 transitions. [2019-11-24 05:14:35,068 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 349 transitions. Word has length 23 [2019-11-24 05:14:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:35,068 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 349 transitions. [2019-11-24 05:14:35,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 349 transitions. [2019-11-24 05:14:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:14:35,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:35,074 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] [2019-11-24 05:14:35,074 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:35,075 INFO L82 PathProgramCache]: Analyzing trace with hash 861615450, now seen corresponding path program 1 times [2019-11-24 05:14:35,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:35,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789519686] [2019-11-24 05:14:35,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:35,164 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 05:14:35,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789519686] [2019-11-24 05:14:35,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:35,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:35,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330087317] [2019-11-24 05:14:35,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:35,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:35,167 INFO L87 Difference]: Start difference. First operand 194 states and 349 transitions. Second operand 3 states. [2019-11-24 05:14:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:35,210 INFO L93 Difference]: Finished difference Result 570 states and 1027 transitions. [2019-11-24 05:14:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:35,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 05:14:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:35,214 INFO L225 Difference]: With dead ends: 570 [2019-11-24 05:14:35,214 INFO L226 Difference]: Without dead ends: 378 [2019-11-24 05:14:35,217 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 05:14:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-24 05:14:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-11-24 05:14:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-24 05:14:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 665 transitions. [2019-11-24 05:14:35,245 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 665 transitions. Word has length 24 [2019-11-24 05:14:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:35,245 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 665 transitions. [2019-11-24 05:14:35,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 665 transitions. [2019-11-24 05:14:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 05:14:35,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:35,248 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] [2019-11-24 05:14:35,248 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:35,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1465212543, now seen corresponding path program 1 times [2019-11-24 05:14:35,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:35,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525434841] [2019-11-24 05:14:35,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:35,319 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 05:14:35,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525434841] [2019-11-24 05:14:35,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:35,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:35,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576148016] [2019-11-24 05:14:35,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:35,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:35,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:35,323 INFO L87 Difference]: Start difference. First operand 370 states and 665 transitions. Second operand 3 states. [2019-11-24 05:14:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:35,389 INFO L93 Difference]: Finished difference Result 1090 states and 1959 transitions. [2019-11-24 05:14:35,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:35,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 05:14:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:35,395 INFO L225 Difference]: With dead ends: 1090 [2019-11-24 05:14:35,395 INFO L226 Difference]: Without dead ends: 722 [2019-11-24 05:14:35,397 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 05:14:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-24 05:14:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 714. [2019-11-24 05:14:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-24 05:14:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1273 transitions. [2019-11-24 05:14:35,451 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1273 transitions. Word has length 25 [2019-11-24 05:14:35,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:35,452 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1273 transitions. [2019-11-24 05:14:35,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1273 transitions. [2019-11-24 05:14:35,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 05:14:35,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:35,454 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] [2019-11-24 05:14:35,455 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1375049323, now seen corresponding path program 1 times [2019-11-24 05:14:35,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:35,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266245220] [2019-11-24 05:14:35,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:35,545 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 05:14:35,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266245220] [2019-11-24 05:14:35,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:35,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:35,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837606313] [2019-11-24 05:14:35,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:35,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:35,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:35,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:35,548 INFO L87 Difference]: Start difference. First operand 714 states and 1273 transitions. Second operand 3 states. [2019-11-24 05:14:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:35,659 INFO L93 Difference]: Finished difference Result 2106 states and 3751 transitions. [2019-11-24 05:14:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:35,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 05:14:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:35,677 INFO L225 Difference]: With dead ends: 2106 [2019-11-24 05:14:35,678 INFO L226 Difference]: Without dead ends: 1394 [2019-11-24 05:14:35,680 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 05:14:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-11-24 05:14:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1386. [2019-11-24 05:14:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-11-24 05:14:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2441 transitions. [2019-11-24 05:14:35,775 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2441 transitions. Word has length 26 [2019-11-24 05:14:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:35,777 INFO L462 AbstractCegarLoop]: Abstraction has 1386 states and 2441 transitions. [2019-11-24 05:14:35,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2441 transitions. [2019-11-24 05:14:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 05:14:35,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:35,781 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] [2019-11-24 05:14:35,781 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1257275696, now seen corresponding path program 1 times [2019-11-24 05:14:35,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:35,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489084699] [2019-11-24 05:14:35,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:35,888 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 05:14:35,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489084699] [2019-11-24 05:14:35,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:35,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:35,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910326542] [2019-11-24 05:14:35,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:35,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:35,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:35,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:35,890 INFO L87 Difference]: Start difference. First operand 1386 states and 2441 transitions. Second operand 3 states. [2019-11-24 05:14:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:36,066 INFO L93 Difference]: Finished difference Result 4090 states and 7191 transitions. [2019-11-24 05:14:36,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:36,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 05:14:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:36,081 INFO L225 Difference]: With dead ends: 4090 [2019-11-24 05:14:36,082 INFO L226 Difference]: Without dead ends: 2706 [2019-11-24 05:14:36,085 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 05:14:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2019-11-24 05:14:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2698. [2019-11-24 05:14:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-11-24 05:14:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 4681 transitions. [2019-11-24 05:14:36,371 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 4681 transitions. Word has length 27 [2019-11-24 05:14:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:36,371 INFO L462 AbstractCegarLoop]: Abstraction has 2698 states and 4681 transitions. [2019-11-24 05:14:36,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4681 transitions. [2019-11-24 05:14:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 05:14:36,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:36,373 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] [2019-11-24 05:14:36,373 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:36,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2030248006, now seen corresponding path program 1 times [2019-11-24 05:14:36,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:36,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860226030] [2019-11-24 05:14:36,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:36,462 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 05:14:36,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860226030] [2019-11-24 05:14:36,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:36,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:36,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457238182] [2019-11-24 05:14:36,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:36,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:36,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:36,465 INFO L87 Difference]: Start difference. First operand 2698 states and 4681 transitions. Second operand 3 states. [2019-11-24 05:14:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:36,762 INFO L93 Difference]: Finished difference Result 7962 states and 13783 transitions. [2019-11-24 05:14:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:36,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 05:14:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:36,794 INFO L225 Difference]: With dead ends: 7962 [2019-11-24 05:14:36,794 INFO L226 Difference]: Without dead ends: 5266 [2019-11-24 05:14:36,802 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 05:14:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2019-11-24 05:14:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 5258. [2019-11-24 05:14:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5258 states. [2019-11-24 05:14:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 8969 transitions. [2019-11-24 05:14:37,118 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 8969 transitions. Word has length 28 [2019-11-24 05:14:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:37,118 INFO L462 AbstractCegarLoop]: Abstraction has 5258 states and 8969 transitions. [2019-11-24 05:14:37,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8969 transitions. [2019-11-24 05:14:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:14:37,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:37,121 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] [2019-11-24 05:14:37,121 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:14:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:37,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1240128722, now seen corresponding path program 1 times [2019-11-24 05:14:37,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:37,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213316877] [2019-11-24 05:14:37,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:37,311 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 05:14:37,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213316877] [2019-11-24 05:14:37,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118874815] [2019-11-24 05:14:37,313 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 05:14:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:37,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 05:14:37,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:14:37,783 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 05:14:37,783 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:14:37,805 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 05:14:37,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1357619096] [2019-11-24 05:14:37,833 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-11-24 05:14:37,833 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:14:37,840 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:14:37,846 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:14:37,847 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:15:39,079 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 705 [2019-11-24 05:15:43,550 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 306 DAG size of output: 249 [2019-11-24 05:15:43,950 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 744