/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_spec8_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:12:31,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:12:31,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:12:31,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:12:31,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:12:31,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:12:31,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:12:31,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:12:31,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:12:31,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:12:31,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:12:31,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:12:31,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:12:31,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:12:31,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:12:31,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:12:31,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:12:31,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:12:31,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:12:31,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:12:31,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:12:31,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:12:31,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:12:31,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:12:31,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:12:31,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:12:31,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:12:31,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:12:31,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:12:31,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:12:31,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:12:31,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:12:31,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:12:31,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:12:31,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:12:31,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:12:31,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:12:31,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:12:31,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:12:31,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:12:31,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:12:31,597 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:12:31,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:12:31,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:12:31,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:12:31,633 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:12:31,633 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:12:31,633 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:12:31,634 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:12:31,634 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:12:31,634 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:12:31,634 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:12:31,634 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:12:31,635 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:12:31,638 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:12:31,638 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:12:31,638 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:12:31,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:12:31,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:12:31,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:12:31,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:12:31,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:12:31,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:12:31,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:12:31,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:12:31,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:12:31,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:12:31,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:12:31,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:12:31,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:12:31,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:12:31,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:12:31,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:12:31,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:12:31,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:12:31,643 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:12:31,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:12:31,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:12:31,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:12:31,643 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:12:31,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:12:31,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:12:31,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:12:31,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:12:31,927 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:12:31,928 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product29.cil.c [2019-11-24 05:12:32,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982e3db64/ca5c8c951ac1413792d549e795ecff3b/FLAG801267c23 [2019-11-24 05:12:32,600 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:12:32,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product29.cil.c [2019-11-24 05:12:32,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982e3db64/ca5c8c951ac1413792d549e795ecff3b/FLAG801267c23 [2019-11-24 05:12:32,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982e3db64/ca5c8c951ac1413792d549e795ecff3b [2019-11-24 05:12:32,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:12:32,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:12:32,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:12:32,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:12:32,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:12:32,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:12:32" (1/1) ... [2019-11-24 05:12:32,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4fef14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:32, skipping insertion in model container [2019-11-24 05:12:32,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:12:32" (1/1) ... [2019-11-24 05:12:32,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:12:32,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:12:33,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:12:33,697 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:12:33,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:12:34,022 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:12:34,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34 WrapperNode [2019-11-24 05:12:34,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:12:34,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:12:34,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:12:34,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:12:34,033 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:12:34" (1/1) ... [2019-11-24 05:12:34,084 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:12:34" (1/1) ... [2019-11-24 05:12:34,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:12:34,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:12:34,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:12:34,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:12:34,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34" (1/1) ... [2019-11-24 05:12:34,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34" (1/1) ... [2019-11-24 05:12:34,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34" (1/1) ... [2019-11-24 05:12:34,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34" (1/1) ... [2019-11-24 05:12:34,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34" (1/1) ... [2019-11-24 05:12:34,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34" (1/1) ... [2019-11-24 05:12:34,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34" (1/1) ... [2019-11-24 05:12:34,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:12:34,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:12:34,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:12:34,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:12:34,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34" (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:12:34,522 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 05:12:34,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 05:12:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 05:12:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:12:34,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:12:49,107 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:12:49,107 INFO L284 CfgBuilder]: Removed 617 assume(true) statements. [2019-11-24 05:12:49,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:12:49 BoogieIcfgContainer [2019-11-24 05:12:49,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:12:49,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:12:49,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:12:49,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:12:49,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:12:32" (1/3) ... [2019-11-24 05:12:49,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129206ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:12:49, skipping insertion in model container [2019-11-24 05:12:49,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:12:34" (2/3) ... [2019-11-24 05:12:49,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129206ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:12:49, skipping insertion in model container [2019-11-24 05:12:49,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:12:49" (3/3) ... [2019-11-24 05:12:49,117 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product29.cil.c [2019-11-24 05:12:49,126 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:12:49,133 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:12:49,144 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:12:49,166 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:12:49,167 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:12:49,167 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:12:49,167 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:12:49,167 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:12:49,167 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:12:49,167 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:12:49,167 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:12:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 05:12:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 05:12:49,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:49,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:12:49,190 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:12:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash -788038842, now seen corresponding path program 1 times [2019-11-24 05:12:49,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:49,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428432894] [2019-11-24 05:12:49,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:49,575 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:12:49,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428432894] [2019-11-24 05:12:49,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:49,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:12:49,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373707903] [2019-11-24 05:12:49,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 05:12:49,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:49,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 05:12:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:12:49,606 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2019-11-24 05:12:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:49,650 INFO L93 Difference]: Finished difference Result 100 states and 153 transitions. [2019-11-24 05:12:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 05:12:49,652 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 05:12:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:49,668 INFO L225 Difference]: With dead ends: 100 [2019-11-24 05:12:49,668 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 05:12:49,673 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:12:49,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 05:12:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-24 05:12:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 05:12:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2019-11-24 05:12:49,721 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 8 [2019-11-24 05:12:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:49,722 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2019-11-24 05:12:49,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 05:12:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2019-11-24 05:12:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 05:12:49,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:49,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:12:49,724 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:12:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1229481694, now seen corresponding path program 1 times [2019-11-24 05:12:49,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:49,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068535040] [2019-11-24 05:12:49,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:49,896 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:12:49,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068535040] [2019-11-24 05:12:49,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:49,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:12:49,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363669747] [2019-11-24 05:12:49,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:12:49,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:49,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:12:49,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:12:49,900 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 3 states. [2019-11-24 05:12:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:49,917 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-24 05:12:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:12:49,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 05:12:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:49,919 INFO L225 Difference]: With dead ends: 94 [2019-11-24 05:12:49,919 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 05:12:49,921 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:12:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 05:12:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 05:12:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 05:12:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 05:12:49,930 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 9 [2019-11-24 05:12:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:49,931 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 05:12:49,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:12:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 05:12:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 05:12:49,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:49,932 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:12:49,932 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:12:49,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:49,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1153056690, now seen corresponding path program 1 times [2019-11-24 05:12:49,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:49,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833525035] [2019-11-24 05:12:49,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:50,037 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:12:50,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833525035] [2019-11-24 05:12:50,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:50,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:12:50,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841566817] [2019-11-24 05:12:50,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:12:50,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:50,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:12:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:12:50,040 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 05:12:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:50,154 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2019-11-24 05:12:50,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:12:50,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 05:12:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:50,160 INFO L225 Difference]: With dead ends: 86 [2019-11-24 05:12:50,161 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 05:12:50,161 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:12:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 05:12:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-24 05:12:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 05:12:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-24 05:12:50,175 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2019-11-24 05:12:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:50,177 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-24 05:12:50,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:12:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-24 05:12:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:12:50,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:50,178 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:12:50,179 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:12:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1823978448, now seen corresponding path program 1 times [2019-11-24 05:12:50,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:50,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225731295] [2019-11-24 05:12:50,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:50,868 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:12:50,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225731295] [2019-11-24 05:12:50,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:50,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:12:50,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491621182] [2019-11-24 05:12:50,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:12:50,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:50,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:12:50,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:12:50,871 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 8 states. [2019-11-24 05:12:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:51,793 INFO L93 Difference]: Finished difference Result 94 states and 145 transitions. [2019-11-24 05:12:51,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:12:51,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-24 05:12:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:51,797 INFO L225 Difference]: With dead ends: 94 [2019-11-24 05:12:51,797 INFO L226 Difference]: Without dead ends: 92 [2019-11-24 05:12:51,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:12:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-24 05:12:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2019-11-24 05:12:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-24 05:12:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2019-11-24 05:12:51,814 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 15 [2019-11-24 05:12:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:51,814 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2019-11-24 05:12:51,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:12:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2019-11-24 05:12:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:12:51,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:51,817 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:12:51,817 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:12:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:51,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1604556899, now seen corresponding path program 1 times [2019-11-24 05:12:51,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:51,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448281986] [2019-11-24 05:12:51,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:51,976 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:12:51,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448281986] [2019-11-24 05:12:51,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:51,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:12:51,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346511633] [2019-11-24 05:12:51,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:12:51,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:12:51,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:12:51,978 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand 4 states. [2019-11-24 05:12:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:52,002 INFO L93 Difference]: Finished difference Result 85 states and 135 transitions. [2019-11-24 05:12:52,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:12:52,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 05:12:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:52,005 INFO L225 Difference]: With dead ends: 85 [2019-11-24 05:12:52,005 INFO L226 Difference]: Without dead ends: 60 [2019-11-24 05:12:52,006 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:12:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-24 05:12:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-24 05:12:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-24 05:12:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2019-11-24 05:12:52,020 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 18 [2019-11-24 05:12:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:52,021 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2019-11-24 05:12:52,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:12:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2019-11-24 05:12:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 05:12:52,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:52,023 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:12:52,024 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:12:52,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:52,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2106985588, now seen corresponding path program 1 times [2019-11-24 05:12:52,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:52,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085059281] [2019-11-24 05:12:52,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:52,096 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:12:52,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085059281] [2019-11-24 05:12:52,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:52,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:12:52,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442117425] [2019-11-24 05:12:52,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:12:52,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:52,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:12:52,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:12:52,099 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 3 states. [2019-11-24 05:12:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:52,129 INFO L93 Difference]: Finished difference Result 168 states and 292 transitions. [2019-11-24 05:12:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:12:52,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 05:12:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:52,131 INFO L225 Difference]: With dead ends: 168 [2019-11-24 05:12:52,131 INFO L226 Difference]: Without dead ends: 112 [2019-11-24 05:12:52,132 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:12:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-24 05:12:52,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2019-11-24 05:12:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-24 05:12:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 185 transitions. [2019-11-24 05:12:52,163 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 185 transitions. Word has length 22 [2019-11-24 05:12:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:52,163 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 185 transitions. [2019-11-24 05:12:52,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:12:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 185 transitions. [2019-11-24 05:12:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 05:12:52,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:52,167 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:12:52,168 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:12:52,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1122723463, now seen corresponding path program 1 times [2019-11-24 05:12:52,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:52,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733214751] [2019-11-24 05:12:52,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:52,254 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:12:52,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733214751] [2019-11-24 05:12:52,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:52,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:12:52,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842701044] [2019-11-24 05:12:52,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:12:52,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:12:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:12:52,257 INFO L87 Difference]: Start difference. First operand 104 states and 185 transitions. Second operand 3 states. [2019-11-24 05:12:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:52,278 INFO L93 Difference]: Finished difference Result 304 states and 543 transitions. [2019-11-24 05:12:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:12:52,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 05:12:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:52,280 INFO L225 Difference]: With dead ends: 304 [2019-11-24 05:12:52,280 INFO L226 Difference]: Without dead ends: 202 [2019-11-24 05:12:52,284 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:12:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-24 05:12:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2019-11-24 05:12:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-24 05:12:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 349 transitions. [2019-11-24 05:12:52,322 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 349 transitions. Word has length 23 [2019-11-24 05:12:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:52,323 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 349 transitions. [2019-11-24 05:12:52,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:12:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 349 transitions. [2019-11-24 05:12:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:12:52,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:52,330 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:12:52,330 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:12:52,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:52,331 INFO L82 PathProgramCache]: Analyzing trace with hash 410383586, now seen corresponding path program 1 times [2019-11-24 05:12:52,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:52,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827982879] [2019-11-24 05:12:52,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:12:52,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827982879] [2019-11-24 05:12:52,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:52,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:12:52,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309031441] [2019-11-24 05:12:52,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:12:52,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:52,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:12:52,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:12:52,399 INFO L87 Difference]: Start difference. First operand 194 states and 349 transitions. Second operand 3 states. [2019-11-24 05:12:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:52,439 INFO L93 Difference]: Finished difference Result 570 states and 1027 transitions. [2019-11-24 05:12:52,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:12:52,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 05:12:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:52,442 INFO L225 Difference]: With dead ends: 570 [2019-11-24 05:12:52,442 INFO L226 Difference]: Without dead ends: 378 [2019-11-24 05:12:52,444 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:12:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-24 05:12:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-11-24 05:12:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-24 05:12:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 665 transitions. [2019-11-24 05:12:52,481 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 665 transitions. Word has length 24 [2019-11-24 05:12:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:52,482 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 665 transitions. [2019-11-24 05:12:52,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:12:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 665 transitions. [2019-11-24 05:12:52,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 05:12:52,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:52,484 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:12:52,485 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:12:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash -574713861, now seen corresponding path program 1 times [2019-11-24 05:12:52,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:52,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737523774] [2019-11-24 05:12:52,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:52,550 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:12:52,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737523774] [2019-11-24 05:12:52,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:52,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:12:52,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436879929] [2019-11-24 05:12:52,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:12:52,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:52,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:12:52,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:12:52,552 INFO L87 Difference]: Start difference. First operand 370 states and 665 transitions. Second operand 3 states. [2019-11-24 05:12:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:52,613 INFO L93 Difference]: Finished difference Result 1090 states and 1959 transitions. [2019-11-24 05:12:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:12:52,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 05:12:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:52,618 INFO L225 Difference]: With dead ends: 1090 [2019-11-24 05:12:52,618 INFO L226 Difference]: Without dead ends: 722 [2019-11-24 05:12:52,619 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:12:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-24 05:12:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 714. [2019-11-24 05:12:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-24 05:12:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1273 transitions. [2019-11-24 05:12:52,674 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1273 transitions. Word has length 25 [2019-11-24 05:12:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:52,674 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1273 transitions. [2019-11-24 05:12:52,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:12:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1273 transitions. [2019-11-24 05:12:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 05:12:52,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:52,676 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:12:52,676 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:12:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1625199731, now seen corresponding path program 1 times [2019-11-24 05:12:52,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:52,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062622137] [2019-11-24 05:12:52,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:52,728 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:12:52,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062622137] [2019-11-24 05:12:52,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:52,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:12:52,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781095390] [2019-11-24 05:12:52,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:12:52,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:52,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:12:52,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:12:52,730 INFO L87 Difference]: Start difference. First operand 714 states and 1273 transitions. Second operand 3 states. [2019-11-24 05:12:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:52,843 INFO L93 Difference]: Finished difference Result 2106 states and 3751 transitions. [2019-11-24 05:12:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:12:52,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 05:12:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:52,852 INFO L225 Difference]: With dead ends: 2106 [2019-11-24 05:12:52,852 INFO L226 Difference]: Without dead ends: 1394 [2019-11-24 05:12:52,854 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:12:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-11-24 05:12:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1386. [2019-11-24 05:12:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-11-24 05:12:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2441 transitions. [2019-11-24 05:12:52,977 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2441 transitions. Word has length 26 [2019-11-24 05:12:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:52,977 INFO L462 AbstractCegarLoop]: Abstraction has 1386 states and 2441 transitions. [2019-11-24 05:12:52,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:12:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2441 transitions. [2019-11-24 05:12:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 05:12:52,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:52,979 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:12:52,979 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:12:52,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:52,979 INFO L82 PathProgramCache]: Analyzing trace with hash -514636756, now seen corresponding path program 1 times [2019-11-24 05:12:52,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:52,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254867908] [2019-11-24 05:12:52,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:53,062 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:12:53,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254867908] [2019-11-24 05:12:53,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:53,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:12:53,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98350282] [2019-11-24 05:12:53,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:12:53,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:53,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:12:53,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:12:53,064 INFO L87 Difference]: Start difference. First operand 1386 states and 2441 transitions. Second operand 3 states. [2019-11-24 05:12:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:53,376 INFO L93 Difference]: Finished difference Result 4090 states and 7191 transitions. [2019-11-24 05:12:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:12:53,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 05:12:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:53,399 INFO L225 Difference]: With dead ends: 4090 [2019-11-24 05:12:53,399 INFO L226 Difference]: Without dead ends: 2706 [2019-11-24 05:12:53,403 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:12:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2019-11-24 05:12:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2698. [2019-11-24 05:12:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-11-24 05:12:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 4681 transitions. [2019-11-24 05:12:53,700 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 4681 transitions. Word has length 27 [2019-11-24 05:12:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:53,700 INFO L462 AbstractCegarLoop]: Abstraction has 2698 states and 4681 transitions. [2019-11-24 05:12:53,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:12:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4681 transitions. [2019-11-24 05:12:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 05:12:53,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:53,702 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:12:53,702 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:12:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:53,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2061599678, now seen corresponding path program 1 times [2019-11-24 05:12:53,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:53,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268143574] [2019-11-24 05:12:53,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:53,836 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:12:53,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268143574] [2019-11-24 05:12:53,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:53,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:12:53,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029324058] [2019-11-24 05:12:53,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:12:53,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:53,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:12:53,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:12:53,839 INFO L87 Difference]: Start difference. First operand 2698 states and 4681 transitions. Second operand 3 states. [2019-11-24 05:12:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:54,190 INFO L93 Difference]: Finished difference Result 7962 states and 13783 transitions. [2019-11-24 05:12:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:12:54,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 05:12:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:54,219 INFO L225 Difference]: With dead ends: 7962 [2019-11-24 05:12:54,220 INFO L226 Difference]: Without dead ends: 5266 [2019-11-24 05:12:54,227 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:12:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2019-11-24 05:12:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 5258. [2019-11-24 05:12:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5258 states. [2019-11-24 05:12:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 8969 transitions. [2019-11-24 05:12:55,607 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 8969 transitions. Word has length 28 [2019-11-24 05:12:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:55,608 INFO L462 AbstractCegarLoop]: Abstraction has 5258 states and 8969 transitions. [2019-11-24 05:12:55,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:12:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8969 transitions. [2019-11-24 05:12:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:12:55,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:55,610 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:12:55,610 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:12:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:55,610 INFO L82 PathProgramCache]: Analyzing trace with hash -668413618, now seen corresponding path program 1 times [2019-11-24 05:12:55,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:55,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407973907] [2019-11-24 05:12:55,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:55,915 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:12:55,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407973907] [2019-11-24 05:12:55,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:12:55,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:12:55,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011915678] [2019-11-24 05:12:55,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:12:55,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:12:55,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:12:55,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:12:55,917 INFO L87 Difference]: Start difference. First operand 5258 states and 8969 transitions. Second operand 7 states. [2019-11-24 05:12:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:12:56,800 INFO L93 Difference]: Finished difference Result 5970 states and 10144 transitions. [2019-11-24 05:12:56,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:12:56,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-24 05:12:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:12:56,835 INFO L225 Difference]: With dead ends: 5970 [2019-11-24 05:12:56,836 INFO L226 Difference]: Without dead ends: 5962 [2019-11-24 05:12:56,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:12:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2019-11-24 05:12:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 5930. [2019-11-24 05:12:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5930 states. [2019-11-24 05:12:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 10057 transitions. [2019-11-24 05:12:57,277 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 10057 transitions. Word has length 29 [2019-11-24 05:12:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:12:57,278 INFO L462 AbstractCegarLoop]: Abstraction has 5930 states and 10057 transitions. [2019-11-24 05:12:57,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:12:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 10057 transitions. [2019-11-24 05:12:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 05:12:57,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:12:57,281 INFO L410 BasicCegarLoop]: trace histogram [3, 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:12:57,282 INFO L410 AbstractCegarLoop]: === Iteration 14 === [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:12:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:12:57,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1926302585, now seen corresponding path program 1 times [2019-11-24 05:12:57,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:12:57,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140630849] [2019-11-24 05:12:57,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:12:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:12:57,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140630849] [2019-11-24 05:12:57,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090324371] [2019-11-24 05:12:57,571 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:12:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:12:57,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 05:12:57,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:12:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:12:58,023 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:12:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:12:58,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [333876471] [2019-11-24 05:12:58,112 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-11-24 05:12:58,112 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:12:58,119 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:12:58,128 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:12:58,129 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs