/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_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:39:34,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:39:34,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:39:34,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:39:34,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:39:34,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:39:34,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:39:34,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:39:34,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:39:34,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:39:34,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:39:34,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:39:34,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:39:34,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:39:34,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:39:34,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:39:34,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:39:34,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:39:34,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:39:34,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:39:34,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:39:34,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:39:34,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:39:34,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:39:34,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:39:34,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:39:34,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:39:34,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:39:34,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:39:34,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:39:34,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:39:34,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:39:34,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:39:34,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:39:34,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:39:34,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:39:34,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:39:34,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:39:34,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:39:34,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:39:34,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:39:34,239 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:34,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:39:34,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:39:34,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:39:34,268 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:39:34,269 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:39:34,269 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:39:34,269 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:39:34,269 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:39:34,269 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:39:34,269 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:39:34,271 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:39:34,271 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:39:34,271 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:39:34,272 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:39:34,272 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:39:34,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:39:34,274 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:39:34,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:39:34,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:39:34,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:39:34,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:39:34,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:39:34,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:39:34,275 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:39:34,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:39:34,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:39:34,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:39:34,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:39:34,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:39:34,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:39:34,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:39:34,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:39:34,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:39:34,279 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:39:34,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:39:34,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:39:34,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:39:34,281 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:39:34,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:39:34,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:39:34,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:39:34,578 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:39:34,578 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:39:34,579 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product29.cil.c [2019-11-24 04:39:34,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b71f3c49/eedcb116a16246568a23e2e0f1f61c82/FLAG1d6c04f04 [2019-11-24 04:39:35,244 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:39:35,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product29.cil.c [2019-11-24 04:39:35,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b71f3c49/eedcb116a16246568a23e2e0f1f61c82/FLAG1d6c04f04 [2019-11-24 04:39:35,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b71f3c49/eedcb116a16246568a23e2e0f1f61c82 [2019-11-24 04:39:35,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:39:35,430 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:39:35,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:39:35,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:39:35,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:39:35,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:35" (1/1) ... [2019-11-24 04:39:35,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57150996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:35, skipping insertion in model container [2019-11-24 04:39:35,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:35" (1/1) ... [2019-11-24 04:39:35,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:39:35,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:39:36,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:39:36,266 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:39:36,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:39:36,444 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:39:36,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:36 WrapperNode [2019-11-24 04:39:36,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:39:36,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:39:36,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:39:36,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:39:36,454 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:36" (1/1) ... [2019-11-24 04:39:36,488 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:36" (1/1) ... [2019-11-24 04:39:36,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:39:36,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:39:36,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:39:36,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:39:36,768 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:36" (1/1) ... [2019-11-24 04:39:36,769 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:36" (1/1) ... [2019-11-24 04:39:36,810 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:36" (1/1) ... [2019-11-24 04:39:36,811 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:36" (1/1) ... [2019-11-24 04:39:36,918 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:36" (1/1) ... [2019-11-24 04:39:37,069 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:36" (1/1) ... [2019-11-24 04:39:37,105 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:36" (1/1) ... [2019-11-24 04:39:37,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:39:37,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:39:37,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:39:37,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:39:37,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:36" (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:37,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:39:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:39:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:39:37,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:40:11,457 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:40:11,460 INFO L284 CfgBuilder]: Removed 809 assume(true) statements. [2019-11-24 04:40:11,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:11 BoogieIcfgContainer [2019-11-24 04:40:11,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:40:11,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:40:11,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:40:11,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:40:11,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:39:35" (1/3) ... [2019-11-24 04:40:11,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8d36a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:11, skipping insertion in model container [2019-11-24 04:40:11,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:36" (2/3) ... [2019-11-24 04:40:11,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8d36a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:11, skipping insertion in model container [2019-11-24 04:40:11,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:11" (3/3) ... [2019-11-24 04:40:11,473 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product29.cil.c [2019-11-24 04:40:11,481 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:40:11,489 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:40:11,500 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:40:11,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:40:11,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:40:11,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:40:11,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:40:11,546 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:40:11,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:40:11,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:40:11,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:40:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states. [2019-11-24 04:40:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:40:11,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:11,609 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:11,610 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:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:11,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1063579836, now seen corresponding path program 1 times [2019-11-24 04:40:11,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:11,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818739924] [2019-11-24 04:40:11,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:12,213 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:12,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818739924] [2019-11-24 04:40:12,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:12,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:12,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226246702] [2019-11-24 04:40:12,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:12,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:12,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:12,239 INFO L87 Difference]: Start difference. First operand 1233 states. Second operand 5 states. [2019-11-24 04:40:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:12,892 INFO L93 Difference]: Finished difference Result 3185 states and 6095 transitions. [2019-11-24 04:40:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:40:12,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:40:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:12,935 INFO L225 Difference]: With dead ends: 3185 [2019-11-24 04:40:12,935 INFO L226 Difference]: Without dead ends: 2261 [2019-11-24 04:40:12,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:40:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-11-24 04:40:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1406. [2019-11-24 04:40:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1406 states. [2019-11-24 04:40:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2701 transitions. [2019-11-24 04:40:13,113 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2701 transitions. Word has length 17 [2019-11-24 04:40:13,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:13,114 INFO L462 AbstractCegarLoop]: Abstraction has 1406 states and 2701 transitions. [2019-11-24 04:40:13,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2701 transitions. [2019-11-24 04:40:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:40:13,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:13,123 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:13,124 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:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1953835804, now seen corresponding path program 1 times [2019-11-24 04:40:13,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:13,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046324139] [2019-11-24 04:40:13,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:13,306 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:13,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046324139] [2019-11-24 04:40:13,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:13,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:40:13,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614736672] [2019-11-24 04:40:13,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:13,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:13,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:13,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:13,310 INFO L87 Difference]: Start difference. First operand 1406 states and 2701 transitions. Second operand 5 states. [2019-11-24 04:40:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:13,866 INFO L93 Difference]: Finished difference Result 2424 states and 4588 transitions. [2019-11-24 04:40:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:13,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:40:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:13,877 INFO L225 Difference]: With dead ends: 2424 [2019-11-24 04:40:13,877 INFO L226 Difference]: Without dead ends: 1785 [2019-11-24 04:40:13,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:40:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-11-24 04:40:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1416. [2019-11-24 04:40:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-11-24 04:40:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2711 transitions. [2019-11-24 04:40:13,926 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2711 transitions. Word has length 18 [2019-11-24 04:40:13,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:13,927 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2711 transitions. [2019-11-24 04:40:13,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2711 transitions. [2019-11-24 04:40:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:40:13,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:13,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:13,929 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:13,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:13,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1059155140, now seen corresponding path program 1 times [2019-11-24 04:40:13,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:13,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893642128] [2019-11-24 04:40:13,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:14,073 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:14,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893642128] [2019-11-24 04:40:14,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:14,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:40:14,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046147545] [2019-11-24 04:40:14,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:14,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:14,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:14,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:14,076 INFO L87 Difference]: Start difference. First operand 1416 states and 2711 transitions. Second operand 3 states. [2019-11-24 04:40:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:15,090 INFO L93 Difference]: Finished difference Result 2408 states and 4586 transitions. [2019-11-24 04:40:15,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:15,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:40:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:15,099 INFO L225 Difference]: With dead ends: 2408 [2019-11-24 04:40:15,100 INFO L226 Difference]: Without dead ends: 1495 [2019-11-24 04:40:15,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2019-11-24 04:40:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1467. [2019-11-24 04:40:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2019-11-24 04:40:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2690 transitions. [2019-11-24 04:40:15,147 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2690 transitions. Word has length 21 [2019-11-24 04:40:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:15,148 INFO L462 AbstractCegarLoop]: Abstraction has 1467 states and 2690 transitions. [2019-11-24 04:40:15,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2690 transitions. [2019-11-24 04:40:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:40:15,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:15,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:15,150 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:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash 619879674, now seen corresponding path program 1 times [2019-11-24 04:40:15,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:15,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242394032] [2019-11-24 04:40:15,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:15,266 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:15,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242394032] [2019-11-24 04:40:15,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:15,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:15,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548508044] [2019-11-24 04:40:15,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:15,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:15,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:15,269 INFO L87 Difference]: Start difference. First operand 1467 states and 2690 transitions. Second operand 5 states. [2019-11-24 04:40:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:15,748 INFO L93 Difference]: Finished difference Result 3294 states and 6062 transitions. [2019-11-24 04:40:15,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:40:15,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:40:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:15,763 INFO L225 Difference]: With dead ends: 3294 [2019-11-24 04:40:15,763 INFO L226 Difference]: Without dead ends: 2585 [2019-11-24 04:40:15,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2019-11-24 04:40:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 1471. [2019-11-24 04:40:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-24 04:40:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2695 transitions. [2019-11-24 04:40:15,824 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2695 transitions. Word has length 23 [2019-11-24 04:40:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:15,824 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2695 transitions. [2019-11-24 04:40:15,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2695 transitions. [2019-11-24 04:40:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:40:15,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:15,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:15,827 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:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2076713544, now seen corresponding path program 1 times [2019-11-24 04:40:15,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:15,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112212745] [2019-11-24 04:40:15,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:15,986 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:15,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112212745] [2019-11-24 04:40:15,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:15,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:15,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263303255] [2019-11-24 04:40:15,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:15,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:15,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:15,988 INFO L87 Difference]: Start difference. First operand 1471 states and 2695 transitions. Second operand 5 states. [2019-11-24 04:40:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:16,195 INFO L93 Difference]: Finished difference Result 2525 states and 4640 transitions. [2019-11-24 04:40:16,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:16,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 04:40:16,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:16,209 INFO L225 Difference]: With dead ends: 2525 [2019-11-24 04:40:16,209 INFO L226 Difference]: Without dead ends: 2510 [2019-11-24 04:40:16,210 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:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-11-24 04:40:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 1475. [2019-11-24 04:40:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-11-24 04:40:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2699 transitions. [2019-11-24 04:40:16,275 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2699 transitions. Word has length 24 [2019-11-24 04:40:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:16,276 INFO L462 AbstractCegarLoop]: Abstraction has 1475 states and 2699 transitions. [2019-11-24 04:40:16,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2699 transitions. [2019-11-24 04:40:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:40:16,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:16,278 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] [2019-11-24 04:40:16,278 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:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash 196120398, now seen corresponding path program 1 times [2019-11-24 04:40:16,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:16,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543097344] [2019-11-24 04:40:16,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:16,373 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:16,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543097344] [2019-11-24 04:40:16,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:16,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:16,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569671920] [2019-11-24 04:40:16,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:16,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:16,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:16,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:16,375 INFO L87 Difference]: Start difference. First operand 1475 states and 2699 transitions. Second operand 3 states. [2019-11-24 04:40:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:16,445 INFO L93 Difference]: Finished difference Result 1490 states and 2713 transitions. [2019-11-24 04:40:16,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:16,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:40:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:16,454 INFO L225 Difference]: With dead ends: 1490 [2019-11-24 04:40:16,455 INFO L226 Difference]: Without dead ends: 1475 [2019-11-24 04:40:16,455 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:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-11-24 04:40:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2019-11-24 04:40:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-11-24 04:40:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2697 transitions. [2019-11-24 04:40:16,517 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2697 transitions. Word has length 25 [2019-11-24 04:40:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:16,517 INFO L462 AbstractCegarLoop]: Abstraction has 1475 states and 2697 transitions. [2019-11-24 04:40:16,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2697 transitions. [2019-11-24 04:40:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:40:16,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:16,519 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:16,519 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:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2102805772, now seen corresponding path program 1 times [2019-11-24 04:40:16,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:16,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829688459] [2019-11-24 04:40:16,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:16,649 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:16,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829688459] [2019-11-24 04:40:16,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:16,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:16,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523161988] [2019-11-24 04:40:16,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:16,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:16,651 INFO L87 Difference]: Start difference. First operand 1475 states and 2697 transitions. Second operand 3 states. [2019-11-24 04:40:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:16,738 INFO L93 Difference]: Finished difference Result 2535 states and 4664 transitions. [2019-11-24 04:40:16,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:16,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 04:40:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:16,746 INFO L225 Difference]: With dead ends: 2535 [2019-11-24 04:40:16,747 INFO L226 Difference]: Without dead ends: 1468 [2019-11-24 04:40:16,749 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:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2019-11-24 04:40:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1465. [2019-11-24 04:40:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-11-24 04:40:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2678 transitions. [2019-11-24 04:40:16,813 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2678 transitions. Word has length 26 [2019-11-24 04:40:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:16,813 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 2678 transitions. [2019-11-24 04:40:16,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2678 transitions. [2019-11-24 04:40:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:40:16,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:16,815 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] [2019-11-24 04:40:16,815 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:16,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash 762492546, now seen corresponding path program 1 times [2019-11-24 04:40:16,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:16,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189675254] [2019-11-24 04:40:16,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:16,931 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:16,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189675254] [2019-11-24 04:40:16,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:16,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:16,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139132575] [2019-11-24 04:40:16,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:16,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:16,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:16,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:16,933 INFO L87 Difference]: Start difference. First operand 1465 states and 2678 transitions. Second operand 3 states. [2019-11-24 04:40:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:17,073 INFO L93 Difference]: Finished difference Result 3534 states and 6527 transitions. [2019-11-24 04:40:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:17,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 04:40:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:17,087 INFO L225 Difference]: With dead ends: 3534 [2019-11-24 04:40:17,087 INFO L226 Difference]: Without dead ends: 2503 [2019-11-24 04:40:17,089 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:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-11-24 04:40:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2503. [2019-11-24 04:40:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2019-11-24 04:40:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 4609 transitions. [2019-11-24 04:40:17,213 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 4609 transitions. Word has length 27 [2019-11-24 04:40:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:17,213 INFO L462 AbstractCegarLoop]: Abstraction has 2503 states and 4609 transitions. [2019-11-24 04:40:17,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4609 transitions. [2019-11-24 04:40:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:40:17,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:17,215 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] [2019-11-24 04:40:17,215 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:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:17,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2132511787, now seen corresponding path program 1 times [2019-11-24 04:40:17,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:17,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382634225] [2019-11-24 04:40:17,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:17,439 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,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382634225] [2019-11-24 04:40:17,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:17,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:17,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218437969] [2019-11-24 04:40:17,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:40:17,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:17,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:40:17,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:40:17,442 INFO L87 Difference]: Start difference. First operand 2503 states and 4609 transitions. Second operand 4 states. [2019-11-24 04:40:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:19,649 INFO L93 Difference]: Finished difference Result 4597 states and 8472 transitions. [2019-11-24 04:40:19,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:19,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 04:40:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:19,666 INFO L225 Difference]: With dead ends: 4597 [2019-11-24 04:40:19,666 INFO L226 Difference]: Without dead ends: 3081 [2019-11-24 04:40:19,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2019-11-24 04:40:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2498. [2019-11-24 04:40:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-11-24 04:40:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 4586 transitions. [2019-11-24 04:40:19,781 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 4586 transitions. Word has length 28 [2019-11-24 04:40:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:19,782 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 4586 transitions. [2019-11-24 04:40:19,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:40:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 4586 transitions. [2019-11-24 04:40:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:40:19,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:19,784 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] [2019-11-24 04:40:19,784 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:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2089664319, now seen corresponding path program 1 times [2019-11-24 04:40:19,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:19,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550941899] [2019-11-24 04:40:19,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:20,014 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,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550941899] [2019-11-24 04:40:20,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:20,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:20,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108260648] [2019-11-24 04:40:20,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:20,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:20,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:20,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:20,017 INFO L87 Difference]: Start difference. First operand 2498 states and 4586 transitions. Second operand 5 states. [2019-11-24 04:40:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:20,616 INFO L93 Difference]: Finished difference Result 4323 states and 7932 transitions. [2019-11-24 04:40:20,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:40:20,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-24 04:40:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:20,650 INFO L225 Difference]: With dead ends: 4323 [2019-11-24 04:40:20,651 INFO L226 Difference]: Without dead ends: 3618 [2019-11-24 04:40:20,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3618 states. [2019-11-24 04:40:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3618 to 2504. [2019-11-24 04:40:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-11-24 04:40:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 4594 transitions. [2019-11-24 04:40:20,779 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 4594 transitions. Word has length 28 [2019-11-24 04:40:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:20,779 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 4594 transitions. [2019-11-24 04:40:20,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 4594 transitions. [2019-11-24 04:40:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:40:20,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:20,781 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] [2019-11-24 04:40:20,781 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:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash 358825439, now seen corresponding path program 1 times [2019-11-24 04:40:20,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:20,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086733038] [2019-11-24 04:40:20,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:20,866 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,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086733038] [2019-11-24 04:40:20,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:20,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:20,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878738577] [2019-11-24 04:40:20,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:20,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:20,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:20,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:20,868 INFO L87 Difference]: Start difference. First operand 2504 states and 4594 transitions. Second operand 5 states. [2019-11-24 04:40:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:21,342 INFO L93 Difference]: Finished difference Result 6044 states and 11127 transitions. [2019-11-24 04:40:21,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:40:21,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-24 04:40:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:21,357 INFO L225 Difference]: With dead ends: 6044 [2019-11-24 04:40:21,357 INFO L226 Difference]: Without dead ends: 4634 [2019-11-24 04:40:21,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2019-11-24 04:40:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 2515. [2019-11-24 04:40:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2515 states. [2019-11-24 04:40:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 4609 transitions. [2019-11-24 04:40:21,524 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 4609 transitions. Word has length 28 [2019-11-24 04:40:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:21,525 INFO L462 AbstractCegarLoop]: Abstraction has 2515 states and 4609 transitions. [2019-11-24 04:40:21,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 4609 transitions. [2019-11-24 04:40:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:40:21,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:21,526 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] [2019-11-24 04:40:21,527 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:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1795980854, now seen corresponding path program 1 times [2019-11-24 04:40:21,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:21,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180284009] [2019-11-24 04:40:21,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:21,956 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:21,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180284009] [2019-11-24 04:40:21,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:21,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:40:21,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234856175] [2019-11-24 04:40:21,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 04:40:21,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:21,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 04:40:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:40:21,959 INFO L87 Difference]: Start difference. First operand 2515 states and 4609 transitions. Second operand 10 states. [2019-11-24 04:40:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:25,313 INFO L93 Difference]: Finished difference Result 5981 states and 10862 transitions. [2019-11-24 04:40:25,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-24 04:40:25,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-24 04:40:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:25,323 INFO L225 Difference]: With dead ends: 5981 [2019-11-24 04:40:25,323 INFO L226 Difference]: Without dead ends: 4403 [2019-11-24 04:40:25,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2019-11-24 04:40:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2019-11-24 04:40:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 3454. [2019-11-24 04:40:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3454 states. [2019-11-24 04:40:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 6211 transitions. [2019-11-24 04:40:25,552 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 6211 transitions. Word has length 28 [2019-11-24 04:40:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:25,552 INFO L462 AbstractCegarLoop]: Abstraction has 3454 states and 6211 transitions. [2019-11-24 04:40:25,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 04:40:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 6211 transitions. [2019-11-24 04:40:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:40:25,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:25,555 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:25,555 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:25,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash -50073265, now seen corresponding path program 1 times [2019-11-24 04:40:25,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:25,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338115294] [2019-11-24 04:40:25,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:25,737 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:25,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338115294] [2019-11-24 04:40:25,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:25,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:25,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132851899] [2019-11-24 04:40:25,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:25,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:25,739 INFO L87 Difference]: Start difference. First operand 3454 states and 6211 transitions. Second operand 3 states. [2019-11-24 04:40:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:26,854 INFO L93 Difference]: Finished difference Result 6845 states and 12378 transitions. [2019-11-24 04:40:26,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:26,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:40:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:26,863 INFO L225 Difference]: With dead ends: 6845 [2019-11-24 04:40:26,863 INFO L226 Difference]: Without dead ends: 4583 [2019-11-24 04:40:26,868 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:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-24 04:40:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 3354. [2019-11-24 04:40:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3354 states. [2019-11-24 04:40:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5961 transitions. [2019-11-24 04:40:27,079 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5961 transitions. Word has length 35 [2019-11-24 04:40:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:27,080 INFO L462 AbstractCegarLoop]: Abstraction has 3354 states and 5961 transitions. [2019-11-24 04:40:27,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5961 transitions. [2019-11-24 04:40:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:40:27,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:27,083 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:27,083 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:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1564704497, now seen corresponding path program 1 times [2019-11-24 04:40:27,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:27,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147077848] [2019-11-24 04:40:27,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:27,261 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,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147077848] [2019-11-24 04:40:27,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:27,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:27,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974041581] [2019-11-24 04:40:27,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:27,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:27,263 INFO L87 Difference]: Start difference. First operand 3354 states and 5961 transitions. Second operand 3 states. [2019-11-24 04:40:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:28,329 INFO L93 Difference]: Finished difference Result 6643 states and 11891 transitions. [2019-11-24 04:40:28,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:28,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:40:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:28,342 INFO L225 Difference]: With dead ends: 6643 [2019-11-24 04:40:28,342 INFO L226 Difference]: Without dead ends: 4503 [2019-11-24 04:40:28,347 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:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2019-11-24 04:40:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 3279. [2019-11-24 04:40:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3279 states. [2019-11-24 04:40:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 5736 transitions. [2019-11-24 04:40:28,568 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 5736 transitions. Word has length 36 [2019-11-24 04:40:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:28,569 INFO L462 AbstractCegarLoop]: Abstraction has 3279 states and 5736 transitions. [2019-11-24 04:40:28,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 5736 transitions. [2019-11-24 04:40:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 04:40:28,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:28,572 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:28,572 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:28,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:28,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2043061546, now seen corresponding path program 1 times [2019-11-24 04:40:28,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:28,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65998432] [2019-11-24 04:40:28,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:28,821 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:28,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65998432] [2019-11-24 04:40:28,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:28,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:28,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959359734] [2019-11-24 04:40:28,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:28,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:28,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:28,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:28,824 INFO L87 Difference]: Start difference. First operand 3279 states and 5736 transitions. Second operand 3 states. [2019-11-24 04:40:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:29,833 INFO L93 Difference]: Finished difference Result 6486 states and 11449 transitions. [2019-11-24 04:40:29,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:29,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 04:40:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:29,840 INFO L225 Difference]: With dead ends: 6486 [2019-11-24 04:40:29,841 INFO L226 Difference]: Without dead ends: 4448 [2019-11-24 04:40:29,845 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:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2019-11-24 04:40:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 3229. [2019-11-24 04:40:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2019-11-24 04:40:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 5536 transitions. [2019-11-24 04:40:30,088 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 5536 transitions. Word has length 38 [2019-11-24 04:40:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:30,088 INFO L462 AbstractCegarLoop]: Abstraction has 3229 states and 5536 transitions. [2019-11-24 04:40:30,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 5536 transitions. [2019-11-24 04:40:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:40:30,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:30,092 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:30,092 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:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:30,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2122096967, now seen corresponding path program 1 times [2019-11-24 04:40:30,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:30,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651586785] [2019-11-24 04:40:30,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:30,284 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:30,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651586785] [2019-11-24 04:40:30,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:30,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:30,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380111174] [2019-11-24 04:40:30,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:30,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:30,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:30,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:30,286 INFO L87 Difference]: Start difference. First operand 3229 states and 5536 transitions. Second operand 3 states. [2019-11-24 04:40:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:31,189 INFO L93 Difference]: Finished difference Result 6374 states and 11052 transitions. [2019-11-24 04:40:31,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:31,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:40:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:31,193 INFO L225 Difference]: With dead ends: 6374 [2019-11-24 04:40:31,193 INFO L226 Difference]: Without dead ends: 4418 [2019-11-24 04:40:31,197 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:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states. [2019-11-24 04:40:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 3204. [2019-11-24 04:40:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3204 states. [2019-11-24 04:40:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 5361 transitions. [2019-11-24 04:40:31,369 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 5361 transitions. Word has length 41 [2019-11-24 04:40:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:31,370 INFO L462 AbstractCegarLoop]: Abstraction has 3204 states and 5361 transitions. [2019-11-24 04:40:31,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 5361 transitions. [2019-11-24 04:40:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:40:31,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:31,374 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, 1, 1, 1, 1] [2019-11-24 04:40:31,374 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:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:31,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1872867345, now seen corresponding path program 1 times [2019-11-24 04:40:31,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:31,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395396421] [2019-11-24 04:40:31,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:31,594 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:31,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395396421] [2019-11-24 04:40:31,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:31,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:31,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441320492] [2019-11-24 04:40:31,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:31,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:31,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:31,597 INFO L87 Difference]: Start difference. First operand 3204 states and 5361 transitions. Second operand 3 states. [2019-11-24 04:40:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:32,383 INFO L93 Difference]: Finished difference Result 5118 states and 8572 transitions. [2019-11-24 04:40:32,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:32,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-24 04:40:32,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:32,387 INFO L225 Difference]: With dead ends: 5118 [2019-11-24 04:40:32,387 INFO L226 Difference]: Without dead ends: 3224 [2019-11-24 04:40:32,389 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:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2019-11-24 04:40:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3204. [2019-11-24 04:40:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3204 states. [2019-11-24 04:40:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 5211 transitions. [2019-11-24 04:40:32,690 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 5211 transitions. Word has length 45 [2019-11-24 04:40:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:32,691 INFO L462 AbstractCegarLoop]: Abstraction has 3204 states and 5211 transitions. [2019-11-24 04:40:32,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 5211 transitions. [2019-11-24 04:40:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:40:32,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:32,695 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:32,695 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:40:32,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash -487885844, now seen corresponding path program 1 times [2019-11-24 04:40:32,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:32,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856979615] [2019-11-24 04:40:32,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:32,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856979615] [2019-11-24 04:40:32,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:32,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:40:32,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728452415] [2019-11-24 04:40:32,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:40:32,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:32,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:40:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:32,863 INFO L87 Difference]: Start difference. First operand 3204 states and 5211 transitions. Second operand 7 states. [2019-11-24 04:40:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:34,398 INFO L93 Difference]: Finished difference Result 5535 states and 9098 transitions. [2019-11-24 04:40:34,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:40:34,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-24 04:40:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:34,401 INFO L225 Difference]: With dead ends: 5535 [2019-11-24 04:40:34,402 INFO L226 Difference]: Without dead ends: 3281 [2019-11-24 04:40:34,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:40:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2019-11-24 04:40:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3012. [2019-11-24 04:40:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3012 states. [2019-11-24 04:40:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 4699 transitions. [2019-11-24 04:40:34,752 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 4699 transitions. Word has length 47 [2019-11-24 04:40:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:34,752 INFO L462 AbstractCegarLoop]: Abstraction has 3012 states and 4699 transitions. [2019-11-24 04:40:34,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:40:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 4699 transitions. [2019-11-24 04:40:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:40:34,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:34,758 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:34,758 INFO L410 AbstractCegarLoop]: === Iteration 19 === [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:34,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2107743927, now seen corresponding path program 1 times [2019-11-24 04:40:34,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:34,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606604941] [2019-11-24 04:40:34,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:34,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606604941] [2019-11-24 04:40:34,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:34,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:40:34,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930672766] [2019-11-24 04:40:34,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:40:34,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:40:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:34,922 INFO L87 Difference]: Start difference. First operand 3012 states and 4699 transitions. Second operand 7 states. [2019-11-24 04:40:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:37,216 INFO L93 Difference]: Finished difference Result 6825 states and 10785 transitions. [2019-11-24 04:40:37,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 04:40:37,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-24 04:40:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:37,222 INFO L225 Difference]: With dead ends: 6825 [2019-11-24 04:40:37,222 INFO L226 Difference]: Without dead ends: 4739 [2019-11-24 04:40:37,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:40:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4739 states. [2019-11-24 04:40:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4739 to 3519. [2019-11-24 04:40:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3519 states. [2019-11-24 04:40:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 3519 states and 5406 transitions. [2019-11-24 04:40:37,547 INFO L78 Accepts]: Start accepts. Automaton has 3519 states and 5406 transitions. Word has length 47 [2019-11-24 04:40:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:37,547 INFO L462 AbstractCegarLoop]: Abstraction has 3519 states and 5406 transitions. [2019-11-24 04:40:37,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:40:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3519 states and 5406 transitions. [2019-11-24 04:40:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:40:37,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:37,550 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:37,550 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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:37,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash -669370498, now seen corresponding path program 1 times [2019-11-24 04:40:37,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:37,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665782011] [2019-11-24 04:40:37,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:37,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665782011] [2019-11-24 04:40:37,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:37,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:40:37,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771108180] [2019-11-24 04:40:37,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:40:37,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:37,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:40:37,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:40:37,680 INFO L87 Difference]: Start difference. First operand 3519 states and 5406 transitions. Second operand 9 states. [2019-11-24 04:40:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:39,194 INFO L93 Difference]: Finished difference Result 11257 states and 16810 transitions. [2019-11-24 04:40:39,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-24 04:40:39,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-11-24 04:40:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:39,202 INFO L225 Difference]: With dead ends: 11257 [2019-11-24 04:40:39,202 INFO L226 Difference]: Without dead ends: 8499 [2019-11-24 04:40:39,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2019-11-24 04:40:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8499 states. [2019-11-24 04:40:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8499 to 3494. [2019-11-24 04:40:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2019-11-24 04:40:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5264 transitions. [2019-11-24 04:40:39,457 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5264 transitions. Word has length 49 [2019-11-24 04:40:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:39,457 INFO L462 AbstractCegarLoop]: Abstraction has 3494 states and 5264 transitions. [2019-11-24 04:40:39,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:40:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5264 transitions. [2019-11-24 04:40:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:40:39,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:39,460 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:39,460 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:39,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1297122388, now seen corresponding path program 1 times [2019-11-24 04:40:39,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:39,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907694352] [2019-11-24 04:40:39,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:39,694 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,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907694352] [2019-11-24 04:40:39,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:39,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:39,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340967985] [2019-11-24 04:40:39,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:39,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:39,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:39,697 INFO L87 Difference]: Start difference. First operand 3494 states and 5264 transitions. Second operand 5 states. [2019-11-24 04:40:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:41,691 INFO L93 Difference]: Finished difference Result 7499 states and 11458 transitions. [2019-11-24 04:40:41,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:41,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-24 04:40:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:41,698 INFO L225 Difference]: With dead ends: 7499 [2019-11-24 04:40:41,698 INFO L226 Difference]: Without dead ends: 5074 [2019-11-24 04:40:41,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:40:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2019-11-24 04:40:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 3095. [2019-11-24 04:40:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3095 states. [2019-11-24 04:40:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 4703 transitions. [2019-11-24 04:40:41,984 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 4703 transitions. Word has length 49 [2019-11-24 04:40:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:41,984 INFO L462 AbstractCegarLoop]: Abstraction has 3095 states and 4703 transitions. [2019-11-24 04:40:41,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 4703 transitions. [2019-11-24 04:40:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:40:41,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:41,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:41,986 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:41,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1698971551, now seen corresponding path program 1 times [2019-11-24 04:40:41,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:41,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948083357] [2019-11-24 04:40:41,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:42,210 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:42,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948083357] [2019-11-24 04:40:42,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:42,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:42,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66588494] [2019-11-24 04:40:42,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:40:42,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:42,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:40:42,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:40:42,212 INFO L87 Difference]: Start difference. First operand 3095 states and 4703 transitions. Second operand 4 states. [2019-11-24 04:40:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:43,465 INFO L93 Difference]: Finished difference Result 8421 states and 12882 transitions. [2019-11-24 04:40:43,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:43,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 04:40:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:43,474 INFO L225 Difference]: With dead ends: 8421 [2019-11-24 04:40:43,474 INFO L226 Difference]: Without dead ends: 5473 [2019-11-24 04:40:43,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2019-11-24 04:40:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 2949. [2019-11-24 04:40:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2019-11-24 04:40:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4477 transitions. [2019-11-24 04:40:43,816 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4477 transitions. Word has length 50 [2019-11-24 04:40:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:43,816 INFO L462 AbstractCegarLoop]: Abstraction has 2949 states and 4477 transitions. [2019-11-24 04:40:43,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:40:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4477 transitions. [2019-11-24 04:40:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:40:43,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:43,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:43,818 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1405288086, now seen corresponding path program 1 times [2019-11-24 04:40:43,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:43,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078171274] [2019-11-24 04:40:43,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:44,282 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,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078171274] [2019-11-24 04:40:44,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:44,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:44,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597558159] [2019-11-24 04:40:44,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:40:44,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:44,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:40:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:40:44,285 INFO L87 Difference]: Start difference. First operand 2949 states and 4477 transitions. Second operand 4 states. [2019-11-24 04:40:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:45,773 INFO L93 Difference]: Finished difference Result 7291 states and 11051 transitions. [2019-11-24 04:40:45,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:45,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 04:40:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:45,778 INFO L225 Difference]: With dead ends: 7291 [2019-11-24 04:40:45,778 INFO L226 Difference]: Without dead ends: 5461 [2019-11-24 04:40:45,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2019-11-24 04:40:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 2949. [2019-11-24 04:40:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2019-11-24 04:40:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4475 transitions. [2019-11-24 04:40:46,027 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4475 transitions. Word has length 50 [2019-11-24 04:40:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:46,027 INFO L462 AbstractCegarLoop]: Abstraction has 2949 states and 4475 transitions. [2019-11-24 04:40:46,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:40:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4475 transitions. [2019-11-24 04:40:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:40:46,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:46,028 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:46,028 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash -368404062, now seen corresponding path program 1 times [2019-11-24 04:40:46,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:46,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425187248] [2019-11-24 04:40:46,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:46,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425187248] [2019-11-24 04:40:46,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:46,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:40:46,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217089259] [2019-11-24 04:40:46,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:40:46,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:46,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:40:46,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:40:46,167 INFO L87 Difference]: Start difference. First operand 2949 states and 4475 transitions. Second operand 6 states.