/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_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:39:38,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:39:38,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:39:38,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:39:38,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:39:38,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:39:38,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:39:38,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:39:38,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:39:38,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:39:38,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:39:38,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:39:38,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:39:38,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:39:38,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:39:38,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:39:38,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:39:38,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:39:38,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:39:38,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:39:38,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:39:38,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:39:38,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:39:38,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:39:38,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:39:38,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:39:38,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:39:38,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:39:38,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:39:38,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:39:38,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:39:38,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:39:38,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:39:38,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:39:38,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:39:38,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:39:38,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:39:38,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:39:38,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:39:38,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:39:38,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:39:38,184 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:39:38,207 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:39:38,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:39:38,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:39:38,209 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:39:38,209 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:39:38,209 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:39:38,210 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:39:38,211 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:39:38,211 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:39:38,211 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:39:38,211 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:39:38,212 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:39:38,212 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:39:38,212 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:39:38,212 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:39:38,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:39:38,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:39:38,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:39:38,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:39:38,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:39:38,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:39:38,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:39:38,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:39:38,216 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:39:38,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:39:38,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:39:38,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:39:38,217 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:39:38,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:39:38,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:39:38,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:39:38,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:39:38,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:39:38,220 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:39:38,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:39:38,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:39:38,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:39:38,221 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:39:38,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:39:38,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:39:38,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:39:38,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:39:38,522 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:39:38,523 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product31.cil.c [2019-11-24 04:39:38,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8886106d0/828c992716a94b9baeb38f5817e136d6/FLAG75f17c6a2 [2019-11-24 04:39:39,166 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:39:39,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product31.cil.c [2019-11-24 04:39:39,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8886106d0/828c992716a94b9baeb38f5817e136d6/FLAG75f17c6a2 [2019-11-24 04:39:39,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8886106d0/828c992716a94b9baeb38f5817e136d6 [2019-11-24 04:39:39,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:39:39,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:39:39,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:39:39,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:39:39,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:39:39,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:39" (1/1) ... [2019-11-24 04:39:39,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584faea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:39, skipping insertion in model container [2019-11-24 04:39:39,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:39" (1/1) ... [2019-11-24 04:39:39,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:39:39,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:39:40,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:39:40,219 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:39:40,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:39:40,493 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:39:40,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40 WrapperNode [2019-11-24 04:39:40,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:39:40,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:39:40,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:39:40,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:39:40,504 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:39:40" (1/1) ... [2019-11-24 04:39:40,538 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:39:40" (1/1) ... [2019-11-24 04:39:40,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:39:40,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:39:40,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:39:40,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:39:40,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40" (1/1) ... [2019-11-24 04:39:40,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40" (1/1) ... [2019-11-24 04:39:40,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40" (1/1) ... [2019-11-24 04:39:40,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40" (1/1) ... [2019-11-24 04:39:41,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40" (1/1) ... [2019-11-24 04:39:41,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40" (1/1) ... [2019-11-24 04:39:41,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40" (1/1) ... [2019-11-24 04:39:41,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:39:41,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:39:41,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:39:41,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:39:41,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40" (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:39:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:39:41,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:39:41,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:39:41,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:40:17,320 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:40:17,320 INFO L284 CfgBuilder]: Removed 881 assume(true) statements. [2019-11-24 04:40:17,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:17 BoogieIcfgContainer [2019-11-24 04:40:17,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:40:17,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:40:17,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:40:17,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:40:17,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:39:39" (1/3) ... [2019-11-24 04:40:17,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@829b293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:17, skipping insertion in model container [2019-11-24 04:40:17,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:40" (2/3) ... [2019-11-24 04:40:17,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@829b293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:17, skipping insertion in model container [2019-11-24 04:40:17,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:17" (3/3) ... [2019-11-24 04:40:17,332 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product31.cil.c [2019-11-24 04:40:17,341 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:40:17,349 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:40:17,361 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:40:17,399 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:40:17,399 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:40:17,399 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:40:17,400 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:40:17,400 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:40:17,400 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:40:17,400 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:40:17,400 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:40:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states. [2019-11-24 04:40:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:40:17,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:17,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:17,454 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:40:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2096909405, now seen corresponding path program 1 times [2019-11-24 04:40:17,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:17,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735177923] [2019-11-24 04:40:17,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:17,927 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:40:17,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735177923] [2019-11-24 04:40:17,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:17,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:40:17,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349286540] [2019-11-24 04:40:17,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:40:17,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:40:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:40:17,952 INFO L87 Difference]: Start difference. First operand 1241 states. Second operand 2 states. [2019-11-24 04:40:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:18,059 INFO L93 Difference]: Finished difference Result 1258 states and 2415 transitions. [2019-11-24 04:40:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:40:18,061 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:40:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:18,093 INFO L225 Difference]: With dead ends: 1258 [2019-11-24 04:40:18,093 INFO L226 Difference]: Without dead ends: 1239 [2019-11-24 04:40:18,099 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:40:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-11-24 04:40:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2019-11-24 04:40:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-11-24 04:40:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2385 transitions. [2019-11-24 04:40:18,234 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2385 transitions. Word has length 14 [2019-11-24 04:40:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:18,234 INFO L462 AbstractCegarLoop]: Abstraction has 1239 states and 2385 transitions. [2019-11-24 04:40:18,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:40:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2385 transitions. [2019-11-24 04:40:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:40:18,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:18,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:18,239 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:40:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:18,239 INFO L82 PathProgramCache]: Analyzing trace with hash 554281107, now seen corresponding path program 1 times [2019-11-24 04:40:18,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:18,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419057015] [2019-11-24 04:40:18,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:18,465 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:40:18,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419057015] [2019-11-24 04:40:18,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:18,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:18,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239823] [2019-11-24 04:40:18,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:18,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:18,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:18,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:18,474 INFO L87 Difference]: Start difference. First operand 1239 states and 2385 transitions. Second operand 3 states. [2019-11-24 04:40:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:18,578 INFO L93 Difference]: Finished difference Result 1875 states and 3604 transitions. [2019-11-24 04:40:18,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:18,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:40:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:18,585 INFO L225 Difference]: With dead ends: 1875 [2019-11-24 04:40:18,585 INFO L226 Difference]: Without dead ends: 1235 [2019-11-24 04:40:18,589 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:40:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-24 04:40:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1235. [2019-11-24 04:40:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-11-24 04:40:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2377 transitions. [2019-11-24 04:40:18,625 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2377 transitions. Word has length 15 [2019-11-24 04:40:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:18,625 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2377 transitions. [2019-11-24 04:40:18,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2377 transitions. [2019-11-24 04:40:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:40:18,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:18,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:18,629 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:40:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:18,629 INFO L82 PathProgramCache]: Analyzing trace with hash 783646817, now seen corresponding path program 1 times [2019-11-24 04:40:18,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:18,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212491284] [2019-11-24 04:40:18,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:18,741 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:40:18,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212491284] [2019-11-24 04:40:18,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:18,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:18,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752255244] [2019-11-24 04:40:18,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:18,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:18,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:18,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:18,744 INFO L87 Difference]: Start difference. First operand 1235 states and 2377 transitions. Second operand 3 states. [2019-11-24 04:40:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:18,896 INFO L93 Difference]: Finished difference Result 2481 states and 4774 transitions. [2019-11-24 04:40:18,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:18,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:40:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:18,907 INFO L225 Difference]: With dead ends: 2481 [2019-11-24 04:40:18,908 INFO L226 Difference]: Without dead ends: 1856 [2019-11-24 04:40:18,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2019-11-24 04:40:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1856. [2019-11-24 04:40:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-11-24 04:40:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 3575 transitions. [2019-11-24 04:40:18,974 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 3575 transitions. Word has length 17 [2019-11-24 04:40:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:18,975 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 3575 transitions. [2019-11-24 04:40:18,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 3575 transitions. [2019-11-24 04:40:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:40:18,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:18,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:18,978 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:40:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1476728944, now seen corresponding path program 1 times [2019-11-24 04:40:18,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:18,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385862784] [2019-11-24 04:40:18,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:19,175 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:40:19,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385862784] [2019-11-24 04:40:19,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:19,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:19,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656244033] [2019-11-24 04:40:19,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:19,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:19,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:19,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:19,178 INFO L87 Difference]: Start difference. First operand 1856 states and 3575 transitions. Second operand 5 states. [2019-11-24 04:40:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:19,511 INFO L93 Difference]: Finished difference Result 3109 states and 5970 transitions. [2019-11-24 04:40:19,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:19,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:40:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:19,530 INFO L225 Difference]: With dead ends: 3109 [2019-11-24 04:40:19,531 INFO L226 Difference]: Without dead ends: 3094 [2019-11-24 04:40:19,533 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:40:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2019-11-24 04:40:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 1860. [2019-11-24 04:40:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2019-11-24 04:40:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 3579 transitions. [2019-11-24 04:40:19,626 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 3579 transitions. Word has length 18 [2019-11-24 04:40:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:19,627 INFO L462 AbstractCegarLoop]: Abstraction has 1860 states and 3579 transitions. [2019-11-24 04:40:19,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3579 transitions. [2019-11-24 04:40:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:40:19,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:19,632 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:40:19,632 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:40:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash 243917747, now seen corresponding path program 1 times [2019-11-24 04:40:19,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:19,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364650946] [2019-11-24 04:40:19,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:19,754 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:40:19,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364650946] [2019-11-24 04:40:19,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:19,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:19,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962099155] [2019-11-24 04:40:19,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:19,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:19,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:19,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:19,757 INFO L87 Difference]: Start difference. First operand 1860 states and 3579 transitions. Second operand 3 states. [2019-11-24 04:40:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:19,844 INFO L93 Difference]: Finished difference Result 1875 states and 3593 transitions. [2019-11-24 04:40:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:19,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:40:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:19,864 INFO L225 Difference]: With dead ends: 1875 [2019-11-24 04:40:19,864 INFO L226 Difference]: Without dead ends: 1860 [2019-11-24 04:40:19,865 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:40:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2019-11-24 04:40:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1860. [2019-11-24 04:40:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2019-11-24 04:40:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 3577 transitions. [2019-11-24 04:40:19,947 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 3577 transitions. Word has length 19 [2019-11-24 04:40:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:19,948 INFO L462 AbstractCegarLoop]: Abstraction has 1860 states and 3577 transitions. [2019-11-24 04:40:19,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3577 transitions. [2019-11-24 04:40:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:40:19,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:19,950 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:40:19,951 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:40:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1292319041, now seen corresponding path program 1 times [2019-11-24 04:40:19,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:19,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533278283] [2019-11-24 04:40:19,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:20,573 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-24 04:40:20,608 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:40:20,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533278283] [2019-11-24 04:40:20,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:20,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:40:20,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092397227] [2019-11-24 04:40:20,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:40:20,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:40:20,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:20,612 INFO L87 Difference]: Start difference. First operand 1860 states and 3577 transitions. Second operand 7 states. [2019-11-24 04:40:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:23,063 INFO L93 Difference]: Finished difference Result 6331 states and 12127 transitions. [2019-11-24 04:40:23,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:40:23,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-24 04:40:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:23,092 INFO L225 Difference]: With dead ends: 6331 [2019-11-24 04:40:23,093 INFO L226 Difference]: Without dead ends: 4876 [2019-11-24 04:40:23,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:40:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4876 states. [2019-11-24 04:40:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4876 to 4691. [2019-11-24 04:40:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4691 states. [2019-11-24 04:40:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4691 states to 4691 states and 8950 transitions. [2019-11-24 04:40:23,326 INFO L78 Accepts]: Start accepts. Automaton has 4691 states and 8950 transitions. Word has length 20 [2019-11-24 04:40:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:23,327 INFO L462 AbstractCegarLoop]: Abstraction has 4691 states and 8950 transitions. [2019-11-24 04:40:23,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:40:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4691 states and 8950 transitions. [2019-11-24 04:40:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:40:23,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:23,329 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:40:23,330 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:40:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1810695183, now seen corresponding path program 1 times [2019-11-24 04:40:23,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:23,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964252211] [2019-11-24 04:40:23,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:23,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:40:23,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964252211] [2019-11-24 04:40:23,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:23,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:23,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925262450] [2019-11-24 04:40:23,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:23,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:23,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:23,460 INFO L87 Difference]: Start difference. First operand 4691 states and 8950 transitions. Second operand 5 states. [2019-11-24 04:40:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:26,091 INFO L93 Difference]: Finished difference Result 19326 states and 36708 transitions. [2019-11-24 04:40:26,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:26,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-24 04:40:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:26,158 INFO L225 Difference]: With dead ends: 19326 [2019-11-24 04:40:26,158 INFO L226 Difference]: Without dead ends: 14883 [2019-11-24 04:40:26,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14883 states. [2019-11-24 04:40:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14883 to 8476. [2019-11-24 04:40:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8476 states. [2019-11-24 04:40:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8476 states to 8476 states and 15212 transitions. [2019-11-24 04:40:26,666 INFO L78 Accepts]: Start accepts. Automaton has 8476 states and 15212 transitions. Word has length 20 [2019-11-24 04:40:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:26,666 INFO L462 AbstractCegarLoop]: Abstraction has 8476 states and 15212 transitions. [2019-11-24 04:40:26,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8476 states and 15212 transitions. [2019-11-24 04:40:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:40:26,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:26,668 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:40:26,669 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:40:26,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1735737162, now seen corresponding path program 1 times [2019-11-24 04:40:26,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:26,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378738991] [2019-11-24 04:40:26,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:27,070 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:40:27,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378738991] [2019-11-24 04:40:27,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:27,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:40:27,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255802777] [2019-11-24 04:40:27,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:40:27,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:27,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:40:27,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:40:27,073 INFO L87 Difference]: Start difference. First operand 8476 states and 15212 transitions. Second operand 9 states. [2019-11-24 04:40:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:32,751 INFO L93 Difference]: Finished difference Result 34196 states and 60924 transitions. [2019-11-24 04:40:32,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 04:40:32,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-24 04:40:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:32,803 INFO L225 Difference]: With dead ends: 34196 [2019-11-24 04:40:32,804 INFO L226 Difference]: Without dead ends: 19076 [2019-11-24 04:40:32,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-11-24 04:40:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19076 states. [2019-11-24 04:40:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19076 to 10316. [2019-11-24 04:40:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10316 states. [2019-11-24 04:40:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10316 states to 10316 states and 18188 transitions. [2019-11-24 04:40:33,376 INFO L78 Accepts]: Start accepts. Automaton has 10316 states and 18188 transitions. Word has length 20 [2019-11-24 04:40:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:33,377 INFO L462 AbstractCegarLoop]: Abstraction has 10316 states and 18188 transitions. [2019-11-24 04:40:33,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:40:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 10316 states and 18188 transitions. [2019-11-24 04:40:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:40:33,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:33,379 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:40:33,379 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:40:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:33,380 INFO L82 PathProgramCache]: Analyzing trace with hash 820391414, now seen corresponding path program 1 times [2019-11-24 04:40:33,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:33,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673366030] [2019-11-24 04:40:33,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:33,474 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:40:33,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673366030] [2019-11-24 04:40:33,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:33,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:40:33,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320448530] [2019-11-24 04:40:33,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:40:33,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:33,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:40:33,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:40:33,476 INFO L87 Difference]: Start difference. First operand 10316 states and 18188 transitions. Second operand 6 states. [2019-11-24 04:40:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:34,644 INFO L93 Difference]: Finished difference Result 25418 states and 44991 transitions. [2019-11-24 04:40:34,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:40:34,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-24 04:40:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:34,680 INFO L225 Difference]: With dead ends: 25418 [2019-11-24 04:40:34,680 INFO L226 Difference]: Without dead ends: 16355 [2019-11-24 04:40:34,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:40:34,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16355 states. [2019-11-24 04:40:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16355 to 10466. [2019-11-24 04:40:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10466 states. [2019-11-24 04:40:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10466 states to 10466 states and 18330 transitions. [2019-11-24 04:40:35,496 INFO L78 Accepts]: Start accepts. Automaton has 10466 states and 18330 transitions. Word has length 26 [2019-11-24 04:40:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:35,496 INFO L462 AbstractCegarLoop]: Abstraction has 10466 states and 18330 transitions. [2019-11-24 04:40:35,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:40:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 10466 states and 18330 transitions. [2019-11-24 04:40:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:40:35,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:35,499 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] [2019-11-24 04:40:35,499 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:40:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:35,499 INFO L82 PathProgramCache]: Analyzing trace with hash -118949131, now seen corresponding path program 1 times [2019-11-24 04:40:35,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:35,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302122981] [2019-11-24 04:40:35,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:35,679 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:40:35,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302122981] [2019-11-24 04:40:35,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:35,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:40:35,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466970160] [2019-11-24 04:40:35,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:40:35,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:35,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:40:35,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:40:35,682 INFO L87 Difference]: Start difference. First operand 10466 states and 18330 transitions. Second operand 9 states. [2019-11-24 04:40:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:36,254 INFO L93 Difference]: Finished difference Result 17944 states and 31673 transitions. [2019-11-24 04:40:36,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:36,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-24 04:40:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:36,284 INFO L225 Difference]: With dead ends: 17944 [2019-11-24 04:40:36,284 INFO L226 Difference]: Without dead ends: 10456 [2019-11-24 04:40:36,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:40:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10456 states. [2019-11-24 04:40:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10456 to 10456. [2019-11-24 04:40:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10456 states. [2019-11-24 04:40:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10456 states to 10456 states and 18304 transitions. [2019-11-24 04:40:36,847 INFO L78 Accepts]: Start accepts. Automaton has 10456 states and 18304 transitions. Word has length 31 [2019-11-24 04:40:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:36,847 INFO L462 AbstractCegarLoop]: Abstraction has 10456 states and 18304 transitions. [2019-11-24 04:40:36,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:40:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 10456 states and 18304 transitions. [2019-11-24 04:40:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:40:36,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:36,849 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] [2019-11-24 04:40:36,850 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:40:36,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:36,850 INFO L82 PathProgramCache]: Analyzing trace with hash 607567758, now seen corresponding path program 1 times [2019-11-24 04:40:36,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:36,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371360411] [2019-11-24 04:40:36,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:37,051 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:40:37,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371360411] [2019-11-24 04:40:37,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:37,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 04:40:37,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163060202] [2019-11-24 04:40:37,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 04:40:37,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:37,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 04:40:37,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:40:37,054 INFO L87 Difference]: Start difference. First operand 10456 states and 18304 transitions. Second operand 10 states. [2019-11-24 04:40:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:39,022 INFO L93 Difference]: Finished difference Result 10456 states and 18304 transitions. [2019-11-24 04:40:39,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:39,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-24 04:40:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:39,036 INFO L225 Difference]: With dead ends: 10456 [2019-11-24 04:40:39,036 INFO L226 Difference]: Without dead ends: 8019 [2019-11-24 04:40:39,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:40:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8019 states. [2019-11-24 04:40:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8019 to 8019. [2019-11-24 04:40:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8019 states. [2019-11-24 04:40:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8019 states to 8019 states and 14044 transitions. [2019-11-24 04:40:39,452 INFO L78 Accepts]: Start accepts. Automaton has 8019 states and 14044 transitions. Word has length 32 [2019-11-24 04:40:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:39,453 INFO L462 AbstractCegarLoop]: Abstraction has 8019 states and 14044 transitions. [2019-11-24 04:40:39,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 04:40:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 8019 states and 14044 transitions. [2019-11-24 04:40:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:40:39,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:39,455 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] [2019-11-24 04:40:39,455 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:40:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash 111208241, now seen corresponding path program 1 times [2019-11-24 04:40:39,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:39,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925653544] [2019-11-24 04:40:39,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:39,919 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:40:39,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925653544] [2019-11-24 04:40:39,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:39,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 04:40:39,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225759538] [2019-11-24 04:40:39,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 04:40:39,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:39,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 04:40:39,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:40:39,921 INFO L87 Difference]: Start difference. First operand 8019 states and 14044 transitions. Second operand 11 states. [2019-11-24 04:40:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:43,676 INFO L93 Difference]: Finished difference Result 17287 states and 30187 transitions. [2019-11-24 04:40:43,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-24 04:40:43,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-11-24 04:40:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:43,687 INFO L225 Difference]: With dead ends: 17287 [2019-11-24 04:40:43,687 INFO L226 Difference]: Without dead ends: 10403 [2019-11-24 04:40:43,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=390, Unknown=0, NotChecked=0, Total=600 [2019-11-24 04:40:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10403 states. [2019-11-24 04:40:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10403 to 8019. [2019-11-24 04:40:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8019 states. [2019-11-24 04:40:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8019 states to 8019 states and 13829 transitions. [2019-11-24 04:40:44,180 INFO L78 Accepts]: Start accepts. Automaton has 8019 states and 13829 transitions. Word has length 32 [2019-11-24 04:40:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:44,180 INFO L462 AbstractCegarLoop]: Abstraction has 8019 states and 13829 transitions. [2019-11-24 04:40:44,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 04:40:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8019 states and 13829 transitions. [2019-11-24 04:40:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:40:44,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:44,182 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:40:44,182 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:40:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:44,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1712217324, now seen corresponding path program 1 times [2019-11-24 04:40:44,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:44,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73031038] [2019-11-24 04:40:44,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:44,356 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:40:44,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73031038] [2019-11-24 04:40:44,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:44,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:44,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619041344] [2019-11-24 04:40:44,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:44,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:44,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:44,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:44,359 INFO L87 Difference]: Start difference. First operand 8019 states and 13829 transitions. Second operand 3 states. [2019-11-24 04:40:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:46,025 INFO L93 Difference]: Finished difference Result 16068 states and 27816 transitions. [2019-11-24 04:40:46,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:46,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:40:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:46,040 INFO L225 Difference]: With dead ends: 16068 [2019-11-24 04:40:46,040 INFO L226 Difference]: Without dead ends: 10766 [2019-11-24 04:40:46,047 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:40:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10766 states. [2019-11-24 04:40:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10766 to 7799. [2019-11-24 04:40:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7799 states. [2019-11-24 04:40:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7799 states to 7799 states and 13279 transitions. [2019-11-24 04:40:46,574 INFO L78 Accepts]: Start accepts. Automaton has 7799 states and 13279 transitions. Word has length 35 [2019-11-24 04:40:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:46,574 INFO L462 AbstractCegarLoop]: Abstraction has 7799 states and 13279 transitions. [2019-11-24 04:40:46,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7799 states and 13279 transitions. [2019-11-24 04:40:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:40:46,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:46,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:46,577 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:40:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:46,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1495610519, now seen corresponding path program 1 times [2019-11-24 04:40:46,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:46,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227450515] [2019-11-24 04:40:46,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:46,745 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:40:46,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227450515] [2019-11-24 04:40:46,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:46,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:46,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295535811] [2019-11-24 04:40:46,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:46,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:46,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:46,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:46,747 INFO L87 Difference]: Start difference. First operand 7799 states and 13279 transitions. Second operand 3 states. [2019-11-24 04:40:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:48,309 INFO L93 Difference]: Finished difference Result 15650 states and 26783 transitions. [2019-11-24 04:40:48,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:48,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:40:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:48,321 INFO L225 Difference]: With dead ends: 15650 [2019-11-24 04:40:48,322 INFO L226 Difference]: Without dead ends: 10590 [2019-11-24 04:40:48,328 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:40:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2019-11-24 04:40:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 7634. [2019-11-24 04:40:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7634 states. [2019-11-24 04:40:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7634 states to 7634 states and 12784 transitions. [2019-11-24 04:40:48,873 INFO L78 Accepts]: Start accepts. Automaton has 7634 states and 12784 transitions. Word has length 36 [2019-11-24 04:40:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:48,873 INFO L462 AbstractCegarLoop]: Abstraction has 7634 states and 12784 transitions. [2019-11-24 04:40:48,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7634 states and 12784 transitions. [2019-11-24 04:40:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 04:40:48,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:48,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:48,877 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:40:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1908931356, now seen corresponding path program 1 times [2019-11-24 04:40:48,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:48,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126407844] [2019-11-24 04:40:48,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:49,072 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:40:49,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126407844] [2019-11-24 04:40:49,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:49,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:49,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960199110] [2019-11-24 04:40:49,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:49,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:49,074 INFO L87 Difference]: Start difference. First operand 7634 states and 12784 transitions. Second operand 3 states. [2019-11-24 04:40:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:50,439 INFO L93 Difference]: Finished difference Result 15337 states and 25855 transitions. [2019-11-24 04:40:50,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:50,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 04:40:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:50,451 INFO L225 Difference]: With dead ends: 15337 [2019-11-24 04:40:50,452 INFO L226 Difference]: Without dead ends: 10469 [2019-11-24 04:40:50,459 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:40:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10469 states. [2019-11-24 04:40:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10469 to 7524. [2019-11-24 04:40:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7524 states. [2019-11-24 04:40:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7524 states to 7524 states and 12344 transitions. [2019-11-24 04:40:50,934 INFO L78 Accepts]: Start accepts. Automaton has 7524 states and 12344 transitions. Word has length 38 [2019-11-24 04:40:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:50,935 INFO L462 AbstractCegarLoop]: Abstraction has 7524 states and 12344 transitions. [2019-11-24 04:40:50,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 7524 states and 12344 transitions. [2019-11-24 04:40:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:40:50,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:50,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:50,937 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:40:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:50,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1437938602, now seen corresponding path program 1 times [2019-11-24 04:40:50,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:50,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322336898] [2019-11-24 04:40:50,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:51,252 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:40:51,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322336898] [2019-11-24 04:40:51,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:51,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:51,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99626292] [2019-11-24 04:40:51,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:51,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:51,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:51,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:51,258 INFO L87 Difference]: Start difference. First operand 7524 states and 12344 transitions. Second operand 3 states. [2019-11-24 04:40:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:52,490 INFO L93 Difference]: Finished difference Result 15129 states and 25032 transitions. [2019-11-24 04:40:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:52,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:40:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:52,501 INFO L225 Difference]: With dead ends: 15129 [2019-11-24 04:40:52,501 INFO L226 Difference]: Without dead ends: 10403 [2019-11-24 04:40:52,508 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:40:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10403 states. [2019-11-24 04:40:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10403 to 7469. [2019-11-24 04:40:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2019-11-24 04:40:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 11959 transitions. [2019-11-24 04:40:52,968 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 11959 transitions. Word has length 41 [2019-11-24 04:40:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:52,968 INFO L462 AbstractCegarLoop]: Abstraction has 7469 states and 11959 transitions. [2019-11-24 04:40:52,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 11959 transitions. [2019-11-24 04:40:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:40:52,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:52,970 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:40:52,970 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:40:52,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash 801798814, now seen corresponding path program 1 times [2019-11-24 04:40:52,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:52,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383523167] [2019-11-24 04:40:52,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:53,094 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:40:53,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383523167] [2019-11-24 04:40:53,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167843749] [2019-11-24 04:40:53,095 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