/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:38:26,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:38:26,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:38:26,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:38:26,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:38:26,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:38:26,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:38:26,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:38:26,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:38:26,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:38:26,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:38:26,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:38:26,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:38:26,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:38:26,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:38:26,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:38:26,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:38:26,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:38:26,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:38:26,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:38:26,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:38:26,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:38:26,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:38:26,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:38:26,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:38:26,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:38:26,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:38:26,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:38:26,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:38:26,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:38:26,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:38:26,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:38:26,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:38:26,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:38:26,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:38:26,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:38:26,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:38:26,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:38:26,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:38:26,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:38:26,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:38:26,232 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:38:26,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:38:26,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:38:26,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:38:26,268 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:38:26,273 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:38:26,274 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:38:26,274 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:38:26,274 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:38:26,274 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:38:26,275 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:38:26,275 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:38:26,275 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:38:26,275 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:38:26,275 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:38:26,276 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:38:26,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:38:26,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:38:26,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:38:26,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:38:26,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:38:26,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:38:26,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:38:26,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:38:26,279 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:38:26,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:38:26,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:38:26,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:38:26,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:38:26,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:38:26,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:38:26,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:38:26,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:38:26,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:38:26,281 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:38:26,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:38:26,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:38:26,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:38:26,283 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:38:26,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:38:26,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:38:26,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:38:26,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:38:26,605 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:38:26,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product25.cil.c [2019-11-24 04:38:26,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a5e8f1b4/6fc720212b204856be463269c79bc943/FLAG571b03ad6 [2019-11-24 04:38:27,359 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:38:27,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product25.cil.c [2019-11-24 04:38:27,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a5e8f1b4/6fc720212b204856be463269c79bc943/FLAG571b03ad6 [2019-11-24 04:38:27,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a5e8f1b4/6fc720212b204856be463269c79bc943 [2019-11-24 04:38:27,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:38:27,515 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:38:27,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:27,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:38:27,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:38:27,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:27" (1/1) ... [2019-11-24 04:38:27,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee337c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:27, skipping insertion in model container [2019-11-24 04:38:27,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:27" (1/1) ... [2019-11-24 04:38:27,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:38:27,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:38:28,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:28,301 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:38:28,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:28,577 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:38:28,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28 WrapperNode [2019-11-24 04:38:28,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:28,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:28,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:38:28,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:38:28,585 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:38:28" (1/1) ... [2019-11-24 04:38:28,619 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:38:28" (1/1) ... [2019-11-24 04:38:28,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:28,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:38:28,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:38:28,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:38:28,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28" (1/1) ... [2019-11-24 04:38:28,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28" (1/1) ... [2019-11-24 04:38:28,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28" (1/1) ... [2019-11-24 04:38:28,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28" (1/1) ... [2019-11-24 04:38:28,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28" (1/1) ... [2019-11-24 04:38:29,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28" (1/1) ... [2019-11-24 04:38:29,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28" (1/1) ... [2019-11-24 04:38:29,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:38:29,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:38:29,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:38:29,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:38:29,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28" (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:38:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:38:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:38:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:38:29,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:39:02,794 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:39:02,795 INFO L284 CfgBuilder]: Removed 589 assume(true) statements. [2019-11-24 04:39:02,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:39:02 BoogieIcfgContainer [2019-11-24 04:39:02,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:39:02,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:39:02,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:39:02,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:39:02,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:38:27" (1/3) ... [2019-11-24 04:39:02,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21402336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:39:02, skipping insertion in model container [2019-11-24 04:39:02,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:28" (2/3) ... [2019-11-24 04:39:02,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21402336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:39:02, skipping insertion in model container [2019-11-24 04:39:02,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:39:02" (3/3) ... [2019-11-24 04:39:02,804 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product25.cil.c [2019-11-24 04:39:02,814 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:39:02,822 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:39:02,832 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:39:02,863 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:39:02,864 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:39:02,864 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:39:02,864 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:39:02,864 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:39:02,864 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:39:02,865 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:39:02,865 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:39:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-11-24 04:39:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:39:02,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:02,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:02,906 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:02,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:02,913 INFO L82 PathProgramCache]: Analyzing trace with hash 121379742, now seen corresponding path program 1 times [2019-11-24 04:39:02,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:02,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466875567] [2019-11-24 04:39:02,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:03,348 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:39:03,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466875567] [2019-11-24 04:39:03,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:03,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:39:03,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725740679] [2019-11-24 04:39:03,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:39:03,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:39:03,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:39:03,373 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 2 states. [2019-11-24 04:39:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:03,454 INFO L93 Difference]: Finished difference Result 758 states and 1447 transitions. [2019-11-24 04:39:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:39:03,458 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-24 04:39:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:03,498 INFO L225 Difference]: With dead ends: 758 [2019-11-24 04:39:03,498 INFO L226 Difference]: Without dead ends: 739 [2019-11-24 04:39:03,508 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:39:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-11-24 04:39:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-11-24 04:39:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-11-24 04:39:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1417 transitions. [2019-11-24 04:39:03,650 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1417 transitions. Word has length 15 [2019-11-24 04:39:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:03,650 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1417 transitions. [2019-11-24 04:39:03,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:39:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1417 transitions. [2019-11-24 04:39:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:39:03,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:03,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:03,661 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:03,661 INFO L82 PathProgramCache]: Analyzing trace with hash -540200040, now seen corresponding path program 1 times [2019-11-24 04:39:03,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:03,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154210456] [2019-11-24 04:39:03,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:03,900 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:39:03,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154210456] [2019-11-24 04:39:03,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:03,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:03,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793502241] [2019-11-24 04:39:03,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:03,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:03,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:03,904 INFO L87 Difference]: Start difference. First operand 739 states and 1417 transitions. Second operand 4 states. [2019-11-24 04:39:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:04,307 INFO L93 Difference]: Finished difference Result 1493 states and 2802 transitions. [2019-11-24 04:39:04,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:04,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:39:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:04,315 INFO L225 Difference]: With dead ends: 1493 [2019-11-24 04:39:04,315 INFO L226 Difference]: Without dead ends: 1100 [2019-11-24 04:39:04,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-11-24 04:39:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 743. [2019-11-24 04:39:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-11-24 04:39:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1421 transitions. [2019-11-24 04:39:04,342 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1421 transitions. Word has length 16 [2019-11-24 04:39:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:04,343 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1421 transitions. [2019-11-24 04:39:04,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:39:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1421 transitions. [2019-11-24 04:39:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:39:04,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:04,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:04,345 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash -886434793, now seen corresponding path program 1 times [2019-11-24 04:39:04,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:04,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375792016] [2019-11-24 04:39:04,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:04,469 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:39:04,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375792016] [2019-11-24 04:39:04,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:04,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:04,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781419145] [2019-11-24 04:39:04,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:04,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:04,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:04,473 INFO L87 Difference]: Start difference. First operand 743 states and 1421 transitions. Second operand 5 states. [2019-11-24 04:39:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:04,955 INFO L93 Difference]: Finished difference Result 1605 states and 3017 transitions. [2019-11-24 04:39:04,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:04,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-24 04:39:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:04,965 INFO L225 Difference]: With dead ends: 1605 [2019-11-24 04:39:04,970 INFO L226 Difference]: Without dead ends: 1224 [2019-11-24 04:39:04,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-11-24 04:39:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 751. [2019-11-24 04:39:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-11-24 04:39:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1433 transitions. [2019-11-24 04:39:05,005 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1433 transitions. Word has length 19 [2019-11-24 04:39:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:05,005 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 1433 transitions. [2019-11-24 04:39:05,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1433 transitions. [2019-11-24 04:39:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:39:05,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:05,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:05,007 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1614927468, now seen corresponding path program 1 times [2019-11-24 04:39:05,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:05,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37903329] [2019-11-24 04:39:05,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:05,155 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:39:05,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37903329] [2019-11-24 04:39:05,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:05,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:05,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024309296] [2019-11-24 04:39:05,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:05,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:05,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:05,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:05,158 INFO L87 Difference]: Start difference. First operand 751 states and 1433 transitions. Second operand 5 states. [2019-11-24 04:39:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:05,668 INFO L93 Difference]: Finished difference Result 1597 states and 2997 transitions. [2019-11-24 04:39:05,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:05,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-24 04:39:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:05,676 INFO L225 Difference]: With dead ends: 1597 [2019-11-24 04:39:05,677 INFO L226 Difference]: Without dead ends: 1212 [2019-11-24 04:39:05,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-11-24 04:39:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 757. [2019-11-24 04:39:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-11-24 04:39:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1443 transitions. [2019-11-24 04:39:05,709 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1443 transitions. Word has length 20 [2019-11-24 04:39:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:05,710 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1443 transitions. [2019-11-24 04:39:05,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1443 transitions. [2019-11-24 04:39:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:39:05,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:05,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:05,712 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1555680547, now seen corresponding path program 1 times [2019-11-24 04:39:05,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:05,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773860606] [2019-11-24 04:39:05,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:05,832 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:39:05,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773860606] [2019-11-24 04:39:05,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:05,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:05,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420557507] [2019-11-24 04:39:05,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:05,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:05,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:05,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:05,835 INFO L87 Difference]: Start difference. First operand 757 states and 1443 transitions. Second operand 5 states. [2019-11-24 04:39:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:06,335 INFO L93 Difference]: Finished difference Result 1588 states and 2976 transitions. [2019-11-24 04:39:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:06,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-24 04:39:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:06,346 INFO L225 Difference]: With dead ends: 1588 [2019-11-24 04:39:06,346 INFO L226 Difference]: Without dead ends: 1200 [2019-11-24 04:39:06,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-11-24 04:39:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 763. [2019-11-24 04:39:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-11-24 04:39:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1453 transitions. [2019-11-24 04:39:06,401 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1453 transitions. Word has length 21 [2019-11-24 04:39:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:06,401 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1453 transitions. [2019-11-24 04:39:06,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1453 transitions. [2019-11-24 04:39:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:39:06,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:06,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:06,403 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:06,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:06,404 INFO L82 PathProgramCache]: Analyzing trace with hash 361470041, now seen corresponding path program 1 times [2019-11-24 04:39:06,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:06,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765239479] [2019-11-24 04:39:06,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:06,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765239479] [2019-11-24 04:39:06,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:06,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:06,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26001617] [2019-11-24 04:39:06,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:06,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:06,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:06,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:06,583 INFO L87 Difference]: Start difference. First operand 763 states and 1453 transitions. Second operand 5 states. [2019-11-24 04:39:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:06,749 INFO L93 Difference]: Finished difference Result 1168 states and 2203 transitions. [2019-11-24 04:39:06,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:06,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-24 04:39:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:06,757 INFO L225 Difference]: With dead ends: 1168 [2019-11-24 04:39:06,758 INFO L226 Difference]: Without dead ends: 1153 [2019-11-24 04:39:06,759 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:39:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2019-11-24 04:39:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 765. [2019-11-24 04:39:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-24 04:39:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1455 transitions. [2019-11-24 04:39:06,800 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1455 transitions. Word has length 21 [2019-11-24 04:39:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:06,801 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1455 transitions. [2019-11-24 04:39:06,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1455 transitions. [2019-11-24 04:39:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:39:06,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:06,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:06,807 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:06,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1509724304, now seen corresponding path program 1 times [2019-11-24 04:39:06,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:06,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080109344] [2019-11-24 04:39:06,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:06,918 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:39:06,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080109344] [2019-11-24 04:39:06,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:06,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:06,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803505886] [2019-11-24 04:39:06,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:06,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:06,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:06,922 INFO L87 Difference]: Start difference. First operand 765 states and 1455 transitions. Second operand 3 states. [2019-11-24 04:39:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:06,964 INFO L93 Difference]: Finished difference Result 780 states and 1469 transitions. [2019-11-24 04:39:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:06,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:39:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:06,970 INFO L225 Difference]: With dead ends: 780 [2019-11-24 04:39:06,970 INFO L226 Difference]: Without dead ends: 765 [2019-11-24 04:39:06,971 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:39:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-24 04:39:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2019-11-24 04:39:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-24 04:39:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1454 transitions. [2019-11-24 04:39:07,003 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1454 transitions. Word has length 22 [2019-11-24 04:39:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:07,003 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1454 transitions. [2019-11-24 04:39:07,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1454 transitions. [2019-11-24 04:39:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:39:07,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:07,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:07,005 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:07,006 INFO L82 PathProgramCache]: Analyzing trace with hash 658860602, now seen corresponding path program 1 times [2019-11-24 04:39:07,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:07,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550497557] [2019-11-24 04:39:07,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:07,224 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:39:07,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550497557] [2019-11-24 04:39:07,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:07,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:07,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372993196] [2019-11-24 04:39:07,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:07,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:07,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:07,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:07,226 INFO L87 Difference]: Start difference. First operand 765 states and 1454 transitions. Second operand 5 states. [2019-11-24 04:39:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:08,027 INFO L93 Difference]: Finished difference Result 1546 states and 2924 transitions. [2019-11-24 04:39:08,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:39:08,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:39:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:08,035 INFO L225 Difference]: With dead ends: 1546 [2019-11-24 04:39:08,035 INFO L226 Difference]: Without dead ends: 1015 [2019-11-24 04:39:08,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-24 04:39:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 998. [2019-11-24 04:39:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-11-24 04:39:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1856 transitions. [2019-11-24 04:39:08,095 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1856 transitions. Word has length 23 [2019-11-24 04:39:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:08,096 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 1856 transitions. [2019-11-24 04:39:08,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1856 transitions. [2019-11-24 04:39:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:39:08,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:08,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:08,098 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:08,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1050139848, now seen corresponding path program 1 times [2019-11-24 04:39:08,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:08,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573680817] [2019-11-24 04:39:08,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:08,324 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:39:08,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573680817] [2019-11-24 04:39:08,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:08,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:08,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483029972] [2019-11-24 04:39:08,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:08,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:08,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:08,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:08,326 INFO L87 Difference]: Start difference. First operand 998 states and 1856 transitions. Second operand 4 states. [2019-11-24 04:39:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:08,912 INFO L93 Difference]: Finished difference Result 1783 states and 3282 transitions. [2019-11-24 04:39:08,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:08,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-24 04:39:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:08,920 INFO L225 Difference]: With dead ends: 1783 [2019-11-24 04:39:08,920 INFO L226 Difference]: Without dead ends: 1325 [2019-11-24 04:39:08,922 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:39:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2019-11-24 04:39:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 998. [2019-11-24 04:39:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-11-24 04:39:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1852 transitions. [2019-11-24 04:39:08,965 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1852 transitions. Word has length 24 [2019-11-24 04:39:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:08,966 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 1852 transitions. [2019-11-24 04:39:08,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:39:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1852 transitions. [2019-11-24 04:39:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:39:08,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:08,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:08,968 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:08,968 INFO L82 PathProgramCache]: Analyzing trace with hash 75533298, now seen corresponding path program 1 times [2019-11-24 04:39:08,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:08,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817479459] [2019-11-24 04:39:08,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:09,046 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:39:09,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817479459] [2019-11-24 04:39:09,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:09,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:09,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134368056] [2019-11-24 04:39:09,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:09,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:09,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:09,049 INFO L87 Difference]: Start difference. First operand 998 states and 1852 transitions. Second operand 4 states. [2019-11-24 04:39:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:09,226 INFO L93 Difference]: Finished difference Result 1779 states and 3261 transitions. [2019-11-24 04:39:09,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:09,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-24 04:39:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:09,234 INFO L225 Difference]: With dead ends: 1779 [2019-11-24 04:39:09,235 INFO L226 Difference]: Without dead ends: 1319 [2019-11-24 04:39:09,236 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:39:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-24 04:39:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 994. [2019-11-24 04:39:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-11-24 04:39:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1846 transitions. [2019-11-24 04:39:09,281 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1846 transitions. Word has length 24 [2019-11-24 04:39:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:09,281 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1846 transitions. [2019-11-24 04:39:09,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:39:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1846 transitions. [2019-11-24 04:39:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:39:09,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:09,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:09,283 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:09,284 INFO L82 PathProgramCache]: Analyzing trace with hash 975513089, now seen corresponding path program 1 times [2019-11-24 04:39:09,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:09,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335078521] [2019-11-24 04:39:09,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:09,605 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:39:09,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335078521] [2019-11-24 04:39:09,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:09,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:39:09,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235757138] [2019-11-24 04:39:09,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:39:09,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:09,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:39:09,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:39:09,608 INFO L87 Difference]: Start difference. First operand 994 states and 1846 transitions. Second operand 8 states. [2019-11-24 04:39:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:12,750 INFO L93 Difference]: Finished difference Result 3044 states and 5584 transitions. [2019-11-24 04:39:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 04:39:12,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-24 04:39:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:12,765 INFO L225 Difference]: With dead ends: 3044 [2019-11-24 04:39:12,765 INFO L226 Difference]: Without dead ends: 1850 [2019-11-24 04:39:12,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-11-24 04:39:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-11-24 04:39:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1287. [2019-11-24 04:39:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2019-11-24 04:39:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2380 transitions. [2019-11-24 04:39:12,848 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2380 transitions. Word has length 26 [2019-11-24 04:39:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:12,849 INFO L462 AbstractCegarLoop]: Abstraction has 1287 states and 2380 transitions. [2019-11-24 04:39:12,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:39:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2380 transitions. [2019-11-24 04:39:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:39:12,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:12,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:12,852 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1306972805, now seen corresponding path program 1 times [2019-11-24 04:39:12,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:12,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090760890] [2019-11-24 04:39:12,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:13,041 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:39:13,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090760890] [2019-11-24 04:39:13,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:13,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:13,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549981822] [2019-11-24 04:39:13,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:13,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:13,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:13,043 INFO L87 Difference]: Start difference. First operand 1287 states and 2380 transitions. Second operand 3 states. [2019-11-24 04:39:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:14,131 INFO L93 Difference]: Finished difference Result 2948 states and 5409 transitions. [2019-11-24 04:39:14,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:14,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:39:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:14,140 INFO L225 Difference]: With dead ends: 2948 [2019-11-24 04:39:14,140 INFO L226 Difference]: Without dead ends: 1788 [2019-11-24 04:39:14,142 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:39:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-11-24 04:39:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1227. [2019-11-24 04:39:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-11-24 04:39:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 2230 transitions. [2019-11-24 04:39:14,248 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 2230 transitions. Word has length 34 [2019-11-24 04:39:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:14,248 INFO L462 AbstractCegarLoop]: Abstraction has 1227 states and 2230 transitions. [2019-11-24 04:39:14,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 2230 transitions. [2019-11-24 04:39:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:39:14,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:14,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:14,251 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1031387761, now seen corresponding path program 1 times [2019-11-24 04:39:14,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:14,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128356151] [2019-11-24 04:39:14,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:14,458 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:39:14,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128356151] [2019-11-24 04:39:14,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:14,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:14,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256109748] [2019-11-24 04:39:14,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:14,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:14,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:14,461 INFO L87 Difference]: Start difference. First operand 1227 states and 2230 transitions. Second operand 3 states. [2019-11-24 04:39:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:15,475 INFO L93 Difference]: Finished difference Result 2818 states and 5104 transitions. [2019-11-24 04:39:15,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:15,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:39:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:15,482 INFO L225 Difference]: With dead ends: 2818 [2019-11-24 04:39:15,483 INFO L226 Difference]: Without dead ends: 1740 [2019-11-24 04:39:15,485 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:39:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2019-11-24 04:39:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1182. [2019-11-24 04:39:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-11-24 04:39:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 2095 transitions. [2019-11-24 04:39:15,572 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 2095 transitions. Word has length 35 [2019-11-24 04:39:15,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:15,572 INFO L462 AbstractCegarLoop]: Abstraction has 1182 states and 2095 transitions. [2019-11-24 04:39:15,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 2095 transitions. [2019-11-24 04:39:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:39:15,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:15,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:15,575 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:15,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash 145390700, now seen corresponding path program 1 times [2019-11-24 04:39:15,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:15,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63691327] [2019-11-24 04:39:15,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:15,775 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:39:15,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63691327] [2019-11-24 04:39:15,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:15,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:39:15,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365869935] [2019-11-24 04:39:15,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:39:15,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:15,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:39:15,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:15,778 INFO L87 Difference]: Start difference. First operand 1182 states and 2095 transitions. Second operand 7 states. [2019-11-24 04:39:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:17,292 INFO L93 Difference]: Finished difference Result 2772 states and 4923 transitions. [2019-11-24 04:39:17,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:39:17,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-24 04:39:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:17,298 INFO L225 Difference]: With dead ends: 2772 [2019-11-24 04:39:17,298 INFO L226 Difference]: Without dead ends: 1665 [2019-11-24 04:39:17,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:39:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-11-24 04:39:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 689. [2019-11-24 04:39:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-24 04:39:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1214 transitions. [2019-11-24 04:39:17,372 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1214 transitions. Word has length 37 [2019-11-24 04:39:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:17,372 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1214 transitions. [2019-11-24 04:39:17,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:39:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1214 transitions. [2019-11-24 04:39:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:39:17,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:17,373 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:17,373 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:17,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:17,373 INFO L82 PathProgramCache]: Analyzing trace with hash 319230297, now seen corresponding path program 1 times [2019-11-24 04:39:17,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:17,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350061950] [2019-11-24 04:39:17,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:17,468 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:39:17,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350061950] [2019-11-24 04:39:17,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:17,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:39:17,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475365857] [2019-11-24 04:39:17,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:39:17,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:39:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:17,470 INFO L87 Difference]: Start difference. First operand 689 states and 1214 transitions. Second operand 6 states. [2019-11-24 04:39:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:18,564 INFO L93 Difference]: Finished difference Result 2465 states and 4423 transitions. [2019-11-24 04:39:18,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:39:18,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-24 04:39:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:18,572 INFO L225 Difference]: With dead ends: 2465 [2019-11-24 04:39:18,573 INFO L226 Difference]: Without dead ends: 1851 [2019-11-24 04:39:18,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:39:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2019-11-24 04:39:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1391. [2019-11-24 04:39:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2019-11-24 04:39:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 2326 transitions. [2019-11-24 04:39:18,741 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 2326 transitions. Word has length 43 [2019-11-24 04:39:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:18,741 INFO L462 AbstractCegarLoop]: Abstraction has 1391 states and 2326 transitions. [2019-11-24 04:39:18,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:39:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2326 transitions. [2019-11-24 04:39:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:39:18,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:18,743 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:18,743 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:18,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:18,744 INFO L82 PathProgramCache]: Analyzing trace with hash -808137385, now seen corresponding path program 1 times [2019-11-24 04:39:18,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:18,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315416064] [2019-11-24 04:39:18,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:18,856 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:39:18,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315416064] [2019-11-24 04:39:18,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:18,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:39:18,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345022675] [2019-11-24 04:39:18,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:39:18,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:39:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:18,861 INFO L87 Difference]: Start difference. First operand 1391 states and 2326 transitions. Second operand 6 states. [2019-11-24 04:39:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:19,511 INFO L93 Difference]: Finished difference Result 2180 states and 3707 transitions. [2019-11-24 04:39:19,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:39:19,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-24 04:39:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:19,516 INFO L225 Difference]: With dead ends: 2180 [2019-11-24 04:39:19,516 INFO L226 Difference]: Without dead ends: 860 [2019-11-24 04:39:19,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:39:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-11-24 04:39:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 857. [2019-11-24 04:39:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-11-24 04:39:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1457 transitions. [2019-11-24 04:39:19,601 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1457 transitions. Word has length 43 [2019-11-24 04:39:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:19,601 INFO L462 AbstractCegarLoop]: Abstraction has 857 states and 1457 transitions. [2019-11-24 04:39:19,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:39:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1457 transitions. [2019-11-24 04:39:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:39:19,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:19,602 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:19,602 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2118254570, now seen corresponding path program 1 times [2019-11-24 04:39:19,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:19,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614066687] [2019-11-24 04:39:19,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:19,693 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:39:19,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614066687] [2019-11-24 04:39:19,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:19,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:39:19,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441148106] [2019-11-24 04:39:19,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:39:19,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:19,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:39:19,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:19,695 INFO L87 Difference]: Start difference. First operand 857 states and 1457 transitions. Second operand 6 states. [2019-11-24 04:39:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:20,057 INFO L93 Difference]: Finished difference Result 2121 states and 3594 transitions. [2019-11-24 04:39:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:39:20,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-24 04:39:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:20,063 INFO L225 Difference]: With dead ends: 2121 [2019-11-24 04:39:20,063 INFO L226 Difference]: Without dead ends: 1274 [2019-11-24 04:39:20,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:39:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-11-24 04:39:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 763. [2019-11-24 04:39:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-11-24 04:39:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1239 transitions. [2019-11-24 04:39:20,139 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1239 transitions. Word has length 43 [2019-11-24 04:39:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:20,139 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1239 transitions. [2019-11-24 04:39:20,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:39:20,140 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1239 transitions. [2019-11-24 04:39:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:39:20,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:20,141 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:20,141 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:20,141 INFO L82 PathProgramCache]: Analyzing trace with hash -259959391, now seen corresponding path program 1 times [2019-11-24 04:39:20,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:20,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536782628] [2019-11-24 04:39:20,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:20,257 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:39:20,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536782628] [2019-11-24 04:39:20,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970105800] [2019-11-24 04:39:20,258 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:39:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:20,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:39:20,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:39:20,745 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:39:20,745 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:39:20,810 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:39:20,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1720355131] [2019-11-24 04:39:20,857 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2019-11-24 04:39:20,857 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:39:20,864 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:39:20,874 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:39:20,877 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs