/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_spec0_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:49:57,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:49:57,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:49:57,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:49:57,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:49:57,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:49:57,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:49:57,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:49:57,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:49:57,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:49:57,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:49:57,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:49:57,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:49:57,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:49:57,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:49:57,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:49:57,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:49:57,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:49:57,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:49:57,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:49:57,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:49:57,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:49:57,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:49:57,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:49:57,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:49:57,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:49:57,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:49:57,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:49:57,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:49:57,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:49:57,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:49:57,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:49:57,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:49:57,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:49:57,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:49:57,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:49:57,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:49:57,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:49:57,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:49:57,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:49:57,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:49:57,698 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:49:57,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:49:57,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:49:57,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:49:57,724 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:49:57,725 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:49:57,725 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:49:57,725 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:49:57,726 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:49:57,726 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:49:57,726 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:49:57,727 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:49:57,727 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:49:57,728 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:49:57,728 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:49:57,728 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:49:57,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:49:57,730 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:49:57,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:49:57,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:49:57,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:49:57,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:49:57,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:49:57,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:49:57,731 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:49:57,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:49:57,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:49:57,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:49:57,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:49:57,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:49:57,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:49:57,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:49:57,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:49:57,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:49:57,734 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:49:57,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:49:57,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:49:57,736 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:49:57,736 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:49:58,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:49:58,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:49:58,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:49:58,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:49:58,037 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:49:58,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product31.cil.c [2019-11-24 04:49:58,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6b8d7bc/393351b1cfc543738112bb70fd96a2e2/FLAGae4ce4826 [2019-11-24 04:49:58,670 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:49:58,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product31.cil.c [2019-11-24 04:49:58,699 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6b8d7bc/393351b1cfc543738112bb70fd96a2e2/FLAGae4ce4826 [2019-11-24 04:49:58,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6b8d7bc/393351b1cfc543738112bb70fd96a2e2 [2019-11-24 04:49:58,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:49:58,883 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:49:58,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:49:58,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:49:58,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:49:58,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:49:58" (1/1) ... [2019-11-24 04:49:58,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d126f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:58, skipping insertion in model container [2019-11-24 04:49:58,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:49:58" (1/1) ... [2019-11-24 04:49:58,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:49:58,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:49:59,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:49:59,734 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:49:59,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:49:59,996 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:49:59,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59 WrapperNode [2019-11-24 04:49:59,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:49:59,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:49:59,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:49:59,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:50:00,008 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:49:59" (1/1) ... [2019-11-24 04:50:00,075 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:49:59" (1/1) ... [2019-11-24 04:50:00,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:50:00,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:50:00,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:50:00,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:50:00,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59" (1/1) ... [2019-11-24 04:50:00,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59" (1/1) ... [2019-11-24 04:50:00,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59" (1/1) ... [2019-11-24 04:50:00,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59" (1/1) ... [2019-11-24 04:50:00,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59" (1/1) ... [2019-11-24 04:50:00,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59" (1/1) ... [2019-11-24 04:50:00,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59" (1/1) ... [2019-11-24 04:50:00,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:50:00,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:50:00,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:50:00,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:50:00,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59" (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:50:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 04:50:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:50:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:50:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:50:00,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:50:09,595 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:50:09,595 INFO L284 CfgBuilder]: Removed 379 assume(true) statements. [2019-11-24 04:50:09,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:50:09 BoogieIcfgContainer [2019-11-24 04:50:09,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:50:09,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:50:09,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:50:09,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:50:09,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:49:58" (1/3) ... [2019-11-24 04:50:09,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33533f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:50:09, skipping insertion in model container [2019-11-24 04:50:09,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:59" (2/3) ... [2019-11-24 04:50:09,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33533f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:50:09, skipping insertion in model container [2019-11-24 04:50:09,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:50:09" (3/3) ... [2019-11-24 04:50:09,606 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product31.cil.c [2019-11-24 04:50:09,616 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:50:09,624 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-24 04:50:09,637 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-24 04:50:09,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:50:09,663 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:50:09,663 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:50:09,664 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:50:09,664 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:50:09,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:50:09,664 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:50:09,664 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:50:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-11-24 04:50:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:50:09,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:09,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:09,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash 654789195, now seen corresponding path program 1 times [2019-11-24 04:50:09,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:09,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162472468] [2019-11-24 04:50:09,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:10,096 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:50:10,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162472468] [2019-11-24 04:50:10,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:10,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:50:10,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883635331] [2019-11-24 04:50:10,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:50:10,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:10,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:50:10,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:50:10,122 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-11-24 04:50:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:10,157 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2019-11-24 04:50:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:50:10,159 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-11-24 04:50:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:10,173 INFO L225 Difference]: With dead ends: 56 [2019-11-24 04:50:10,173 INFO L226 Difference]: Without dead ends: 38 [2019-11-24 04:50:10,178 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:50:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-24 04:50:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-24 04:50:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-24 04:50:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2019-11-24 04:50:10,226 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 61 transitions. Word has length 7 [2019-11-24 04:50:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:10,226 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 61 transitions. [2019-11-24 04:50:10,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:50:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 61 transitions. [2019-11-24 04:50:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:50:10,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:10,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:10,228 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1887229024, now seen corresponding path program 1 times [2019-11-24 04:50:10,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:10,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541031203] [2019-11-24 04:50:10,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:10,374 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:50:10,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541031203] [2019-11-24 04:50:10,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:10,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:10,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312066586] [2019-11-24 04:50:10,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:10,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:10,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:10,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:10,379 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. Second operand 3 states. [2019-11-24 04:50:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:10,404 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2019-11-24 04:50:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:10,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-24 04:50:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:10,409 INFO L225 Difference]: With dead ends: 52 [2019-11-24 04:50:10,409 INFO L226 Difference]: Without dead ends: 40 [2019-11-24 04:50:10,410 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:50:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-24 04:50:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-24 04:50:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-24 04:50:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2019-11-24 04:50:10,424 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 8 [2019-11-24 04:50:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:10,424 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2019-11-24 04:50:10,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2019-11-24 04:50:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:50:10,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:10,427 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:10,427 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:10,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1033710221, now seen corresponding path program 1 times [2019-11-24 04:50:10,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:10,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701856866] [2019-11-24 04:50:10,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:11,058 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:50:11,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701856866] [2019-11-24 04:50:11,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:11,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:50:11,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110389639] [2019-11-24 04:50:11,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:50:11,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:11,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:50:11,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:50:11,063 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 6 states. [2019-11-24 04:50:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:12,013 INFO L93 Difference]: Finished difference Result 121 states and 190 transitions. [2019-11-24 04:50:12,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:50:12,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-24 04:50:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:12,015 INFO L225 Difference]: With dead ends: 121 [2019-11-24 04:50:12,016 INFO L226 Difference]: Without dead ends: 119 [2019-11-24 04:50:12,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:50:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-24 04:50:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-11-24 04:50:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-24 04:50:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 161 transitions. [2019-11-24 04:50:12,032 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 161 transitions. Word has length 12 [2019-11-24 04:50:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:12,033 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 161 transitions. [2019-11-24 04:50:12,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:50:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 161 transitions. [2019-11-24 04:50:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:50:12,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:12,034 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:12,034 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash -818671834, now seen corresponding path program 1 times [2019-11-24 04:50:12,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:12,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010233959] [2019-11-24 04:50:12,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:12,090 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:50:12,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010233959] [2019-11-24 04:50:12,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:12,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:12,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465347020] [2019-11-24 04:50:12,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:12,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:12,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:12,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:12,092 INFO L87 Difference]: Start difference. First operand 91 states and 161 transitions. Second operand 3 states. [2019-11-24 04:50:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:12,122 INFO L93 Difference]: Finished difference Result 262 states and 469 transitions. [2019-11-24 04:50:12,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:12,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 04:50:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:12,124 INFO L225 Difference]: With dead ends: 262 [2019-11-24 04:50:12,125 INFO L226 Difference]: Without dead ends: 175 [2019-11-24 04:50:12,126 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:50:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-24 04:50:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 160. [2019-11-24 04:50:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-24 04:50:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 293 transitions. [2019-11-24 04:50:12,148 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 293 transitions. Word has length 13 [2019-11-24 04:50:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:12,148 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 293 transitions. [2019-11-24 04:50:12,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 293 transitions. [2019-11-24 04:50:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:50:12,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:12,150 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:12,150 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:12,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1732246927, now seen corresponding path program 1 times [2019-11-24 04:50:12,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:12,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544722018] [2019-11-24 04:50:12,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:12,335 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 04:50:12,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544722018] [2019-11-24 04:50:12,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:12,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:50:12,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863564270] [2019-11-24 04:50:12,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:50:12,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:50:12,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:50:12,337 INFO L87 Difference]: Start difference. First operand 160 states and 293 transitions. Second operand 6 states. [2019-11-24 04:50:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:12,799 INFO L93 Difference]: Finished difference Result 219 states and 397 transitions. [2019-11-24 04:50:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:50:12,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-24 04:50:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:12,801 INFO L225 Difference]: With dead ends: 219 [2019-11-24 04:50:12,801 INFO L226 Difference]: Without dead ends: 217 [2019-11-24 04:50:12,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:50:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-24 04:50:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2019-11-24 04:50:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-24 04:50:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 381 transitions. [2019-11-24 04:50:12,828 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 381 transitions. Word has length 14 [2019-11-24 04:50:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:12,828 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 381 transitions. [2019-11-24 04:50:12,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:50:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 381 transitions. [2019-11-24 04:50:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:50:12,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:12,830 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:12,830 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash -564243266, now seen corresponding path program 1 times [2019-11-24 04:50:12,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:12,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109691715] [2019-11-24 04:50:12,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:12,991 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 04:50:12,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109691715] [2019-11-24 04:50:12,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:12,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:12,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811745779] [2019-11-24 04:50:12,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:50:12,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:12,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:50:12,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:50:12,993 INFO L87 Difference]: Start difference. First operand 206 states and 381 transitions. Second operand 4 states. [2019-11-24 04:50:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:13,058 INFO L93 Difference]: Finished difference Result 212 states and 386 transitions. [2019-11-24 04:50:13,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:50:13,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:50:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:13,061 INFO L225 Difference]: With dead ends: 212 [2019-11-24 04:50:13,061 INFO L226 Difference]: Without dead ends: 206 [2019-11-24 04:50:13,061 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:50:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-24 04:50:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-11-24 04:50:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-24 04:50:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 379 transitions. [2019-11-24 04:50:13,091 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 379 transitions. Word has length 15 [2019-11-24 04:50:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:13,092 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 379 transitions. [2019-11-24 04:50:13,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:50:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 379 transitions. [2019-11-24 04:50:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:50:13,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:13,099 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:13,100 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:13,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash 267684594, now seen corresponding path program 1 times [2019-11-24 04:50:13,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:13,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761825039] [2019-11-24 04:50:13,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:13,183 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:50:13,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761825039] [2019-11-24 04:50:13,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:13,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:13,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218334090] [2019-11-24 04:50:13,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:13,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:13,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:13,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:13,187 INFO L87 Difference]: Start difference. First operand 206 states and 379 transitions. Second operand 3 states. [2019-11-24 04:50:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:13,218 INFO L93 Difference]: Finished difference Result 602 states and 1113 transitions. [2019-11-24 04:50:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:13,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:50:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:13,221 INFO L225 Difference]: With dead ends: 602 [2019-11-24 04:50:13,221 INFO L226 Difference]: Without dead ends: 400 [2019-11-24 04:50:13,225 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:50:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-11-24 04:50:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 385. [2019-11-24 04:50:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-11-24 04:50:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 716 transitions. [2019-11-24 04:50:13,261 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 716 transitions. Word has length 17 [2019-11-24 04:50:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:13,262 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 716 transitions. [2019-11-24 04:50:13,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 716 transitions. [2019-11-24 04:50:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:50:13,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:13,268 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:13,268 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:13,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1928508124, now seen corresponding path program 1 times [2019-11-24 04:50:13,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:13,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562322538] [2019-11-24 04:50:13,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:13,574 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 04:50:13,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562322538] [2019-11-24 04:50:13,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:13,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:50:13,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543226106] [2019-11-24 04:50:13,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:50:13,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:13,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:50:13,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:50:13,576 INFO L87 Difference]: Start difference. First operand 385 states and 716 transitions. Second operand 5 states. [2019-11-24 04:50:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:13,810 INFO L93 Difference]: Finished difference Result 766 states and 1428 transitions. [2019-11-24 04:50:13,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:50:13,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:50:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:13,816 INFO L225 Difference]: With dead ends: 766 [2019-11-24 04:50:13,816 INFO L226 Difference]: Without dead ends: 751 [2019-11-24 04:50:13,817 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:50:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-11-24 04:50:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 737. [2019-11-24 04:50:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-24 04:50:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1356 transitions. [2019-11-24 04:50:13,948 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1356 transitions. Word has length 17 [2019-11-24 04:50:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:13,949 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1356 transitions. [2019-11-24 04:50:13,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:50:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1356 transitions. [2019-11-24 04:50:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:50:13,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:13,950 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 04:50:13,951 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash 801862935, now seen corresponding path program 1 times [2019-11-24 04:50:13,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:13,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950776161] [2019-11-24 04:50:13,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:14,010 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:50:14,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950776161] [2019-11-24 04:50:14,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:14,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:14,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193933905] [2019-11-24 04:50:14,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:14,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:14,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:14,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:14,012 INFO L87 Difference]: Start difference. First operand 737 states and 1356 transitions. Second operand 3 states. [2019-11-24 04:50:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:14,081 INFO L93 Difference]: Finished difference Result 1749 states and 3208 transitions. [2019-11-24 04:50:14,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:14,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:50:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:14,088 INFO L225 Difference]: With dead ends: 1749 [2019-11-24 04:50:14,088 INFO L226 Difference]: Without dead ends: 1014 [2019-11-24 04:50:14,090 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:50:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-11-24 04:50:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 999. [2019-11-24 04:50:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-11-24 04:50:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1808 transitions. [2019-11-24 04:50:14,154 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1808 transitions. Word has length 24 [2019-11-24 04:50:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:14,154 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 1808 transitions. [2019-11-24 04:50:14,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1808 transitions. [2019-11-24 04:50:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:50:14,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:14,156 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 04:50:14,156 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:14,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:14,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1840567906, now seen corresponding path program 1 times [2019-11-24 04:50:14,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:14,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801268898] [2019-11-24 04:50:14,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:14,216 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:50:14,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801268898] [2019-11-24 04:50:14,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:14,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:14,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590588275] [2019-11-24 04:50:14,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:14,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:14,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:14,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:14,218 INFO L87 Difference]: Start difference. First operand 999 states and 1808 transitions. Second operand 3 states. [2019-11-24 04:50:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:14,339 INFO L93 Difference]: Finished difference Result 2949 states and 5332 transitions. [2019-11-24 04:50:14,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:14,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:50:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:14,351 INFO L225 Difference]: With dead ends: 2949 [2019-11-24 04:50:14,351 INFO L226 Difference]: Without dead ends: 1952 [2019-11-24 04:50:14,353 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:50:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2019-11-24 04:50:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1937. [2019-11-24 04:50:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2019-11-24 04:50:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 3468 transitions. [2019-11-24 04:50:14,466 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 3468 transitions. Word has length 25 [2019-11-24 04:50:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:14,467 INFO L462 AbstractCegarLoop]: Abstraction has 1937 states and 3468 transitions. [2019-11-24 04:50:14,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 3468 transitions. [2019-11-24 04:50:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:50:14,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:14,469 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 04:50:14,469 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1941120280, now seen corresponding path program 1 times [2019-11-24 04:50:14,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:14,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155613507] [2019-11-24 04:50:14,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:14,524 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:50:14,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155613507] [2019-11-24 04:50:14,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:14,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:14,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751833373] [2019-11-24 04:50:14,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:14,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:14,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:14,526 INFO L87 Difference]: Start difference. First operand 1937 states and 3468 transitions. Second operand 3 states. [2019-11-24 04:50:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:14,752 INFO L93 Difference]: Finished difference Result 5231 states and 9348 transitions. [2019-11-24 04:50:14,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:14,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 04:50:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:14,771 INFO L225 Difference]: With dead ends: 5231 [2019-11-24 04:50:14,771 INFO L226 Difference]: Without dead ends: 3296 [2019-11-24 04:50:14,775 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:50:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states. [2019-11-24 04:50:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 3281. [2019-11-24 04:50:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2019-11-24 04:50:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 5780 transitions. [2019-11-24 04:50:15,033 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 5780 transitions. Word has length 26 [2019-11-24 04:50:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:15,033 INFO L462 AbstractCegarLoop]: Abstraction has 3281 states and 5780 transitions. [2019-11-24 04:50:15,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 5780 transitions. [2019-11-24 04:50:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:50:15,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:15,036 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 04:50:15,036 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash -532050861, now seen corresponding path program 1 times [2019-11-24 04:50:15,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:15,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522577823] [2019-11-24 04:50:15,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:15,229 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:50:15,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522577823] [2019-11-24 04:50:15,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447601937] [2019-11-24 04:50:15,230 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:50:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:15,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 04:50:15,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:50:15,678 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:50:15,678 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:50:15,699 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:50:15,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1291799850] [2019-11-24 04:50:15,733 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2019-11-24 04:50:15,733 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:50:15,740 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:50:15,747 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:50:15,747 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:51:09,288 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 686 [2019-11-24 04:51:13,415 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 324 DAG size of output: 263 [2019-11-24 04:51:13,896 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 732 [2019-11-24 04:51:16,486 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 1125