/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/eca-rers2012/Problem03_label30.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:34:59,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:34:59,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:34:59,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:34:59,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:34:59,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:34:59,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:34:59,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:34:59,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:34:59,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:34:59,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:34:59,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:34:59,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:34:59,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:34:59,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:34:59,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:34:59,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:34:59,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:34:59,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:34:59,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:34:59,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:34:59,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:34:59,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:34:59,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:34:59,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:34:59,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:34:59,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:34:59,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:34:59,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:34:59,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:34:59,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:34:59,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:34:59,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:34:59,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:34:59,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:34:59,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:34:59,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:34:59,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:34:59,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:34:59,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:34:59,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:34:59,417 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-23 23:34:59,431 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:34:59,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:34:59,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:34:59,432 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:34:59,433 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:34:59,433 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:34:59,433 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:34:59,433 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:34:59,433 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:34:59,434 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:34:59,434 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:34:59,434 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:34:59,434 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:34:59,434 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:34:59,435 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:34:59,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:34:59,436 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:34:59,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:34:59,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:34:59,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:34:59,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:34:59,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:34:59,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:34:59,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:34:59,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:34:59,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:34:59,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:34:59,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:34:59,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:34:59,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:34:59,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:34:59,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:34:59,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:34:59,439 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:34:59,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:34:59,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:34:59,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:34:59,440 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:34:59,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:34:59,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:34:59,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:34:59,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:34:59,726 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:34:59,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label30.c [2019-11-23 23:34:59,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b4cf797/6b2e47723db6463fa4361c349c4273b5/FLAG5839f42df [2019-11-23 23:35:00,424 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:35:00,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label30.c [2019-11-23 23:35:00,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b4cf797/6b2e47723db6463fa4361c349c4273b5/FLAG5839f42df [2019-11-23 23:35:00,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b4cf797/6b2e47723db6463fa4361c349c4273b5 [2019-11-23 23:35:00,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:35:00,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:35:00,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:00,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:35:00,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:35:00,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:00" (1/1) ... [2019-11-23 23:35:00,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6a1297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:00, skipping insertion in model container [2019-11-23 23:35:00,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:00" (1/1) ... [2019-11-23 23:35:00,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:35:00,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:35:01,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:01,635 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:35:01,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:02,017 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:35:02,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02 WrapperNode [2019-11-23 23:35:02,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:02,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:02,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:35:02,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:35:02,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (1/1) ... [2019-11-23 23:35:02,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (1/1) ... [2019-11-23 23:35:02,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:02,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:35:02,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:35:02,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:35:02,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (1/1) ... [2019-11-23 23:35:02,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (1/1) ... [2019-11-23 23:35:02,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (1/1) ... [2019-11-23 23:35:02,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (1/1) ... [2019-11-23 23:35:02,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (1/1) ... [2019-11-23 23:35:02,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (1/1) ... [2019-11-23 23:35:02,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (1/1) ... [2019-11-23 23:35:02,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:35:02,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:35:02,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:35:02,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:35:02,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (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-23 23:35:02,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:35:02,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:35:05,406 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:35:05,406 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:35:05,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:05 BoogieIcfgContainer [2019-11-23 23:35:05,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:35:05,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:35:05,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:35:05,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:35:05,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:35:00" (1/3) ... [2019-11-23 23:35:05,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e95df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:05, skipping insertion in model container [2019-11-23 23:35:05,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:02" (2/3) ... [2019-11-23 23:35:05,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e95df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:05, skipping insertion in model container [2019-11-23 23:35:05,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:05" (3/3) ... [2019-11-23 23:35:05,416 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label30.c [2019-11-23 23:35:05,426 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:35:05,435 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:35:05,447 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:35:05,475 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:35:05,475 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:35:05,476 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:35:05,476 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:35:05,476 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:35:05,476 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:35:05,476 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:35:05,476 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:35:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:35:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:35:05,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:05,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:05,513 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:05,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1467444959, now seen corresponding path program 1 times [2019-11-23 23:35:05,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:05,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593198765] [2019-11-23 23:35:05,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:06,219 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-23 23:35:06,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593198765] [2019-11-23 23:35:06,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:06,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:06,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855645892] [2019-11-23 23:35:06,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:06,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:06,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:06,247 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:35:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:08,019 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:35:08,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:08,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:35:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:08,050 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:35:08,050 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:35:08,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:35:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-11-23 23:35:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-23 23:35:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 728 transitions. [2019-11-23 23:35:08,127 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 728 transitions. Word has length 143 [2019-11-23 23:35:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:08,128 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 728 transitions. [2019-11-23 23:35:08,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 728 transitions. [2019-11-23 23:35:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:35:08,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:08,134 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:08,134 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1977871936, now seen corresponding path program 1 times [2019-11-23 23:35:08,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:08,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344724318] [2019-11-23 23:35:08,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:08,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344724318] [2019-11-23 23:35:08,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:08,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:08,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113416250] [2019-11-23 23:35:08,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:08,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:08,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:08,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:08,233 INFO L87 Difference]: Start difference. First operand 432 states and 728 transitions. Second operand 3 states. [2019-11-23 23:35:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:09,131 INFO L93 Difference]: Finished difference Result 1292 states and 2181 transitions. [2019-11-23 23:35:09,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:09,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:35:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:09,138 INFO L225 Difference]: With dead ends: 1292 [2019-11-23 23:35:09,138 INFO L226 Difference]: Without dead ends: 861 [2019-11-23 23:35:09,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-11-23 23:35:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2019-11-23 23:35:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-11-23 23:35:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1411 transitions. [2019-11-23 23:35:09,187 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1411 transitions. Word has length 151 [2019-11-23 23:35:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:09,187 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1411 transitions. [2019-11-23 23:35:09,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1411 transitions. [2019-11-23 23:35:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 23:35:09,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:09,196 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:09,196 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash 559042919, now seen corresponding path program 1 times [2019-11-23 23:35:09,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:09,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828472120] [2019-11-23 23:35:09,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 23:35:09,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828472120] [2019-11-23 23:35:09,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:09,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:09,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493780172] [2019-11-23 23:35:09,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:09,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:09,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:09,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:09,299 INFO L87 Difference]: Start difference. First operand 861 states and 1411 transitions. Second operand 3 states. [2019-11-23 23:35:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:09,776 INFO L93 Difference]: Finished difference Result 2581 states and 4231 transitions. [2019-11-23 23:35:09,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:09,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 23:35:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:09,793 INFO L225 Difference]: With dead ends: 2581 [2019-11-23 23:35:09,793 INFO L226 Difference]: Without dead ends: 1721 [2019-11-23 23:35:09,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-23 23:35:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2019-11-23 23:35:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:35:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2808 transitions. [2019-11-23 23:35:09,890 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2808 transitions. Word has length 163 [2019-11-23 23:35:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:09,891 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2808 transitions. [2019-11-23 23:35:09,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2808 transitions. [2019-11-23 23:35:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 23:35:09,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:09,904 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:09,904 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:09,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1010832429, now seen corresponding path program 1 times [2019-11-23 23:35:09,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:09,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587331781] [2019-11-23 23:35:09,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:35:10,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587331781] [2019-11-23 23:35:10,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:10,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:10,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827210553] [2019-11-23 23:35:10,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:10,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:10,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:10,093 INFO L87 Difference]: Start difference. First operand 1719 states and 2808 transitions. Second operand 3 states. [2019-11-23 23:35:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:10,686 INFO L93 Difference]: Finished difference Result 3437 states and 5615 transitions. [2019-11-23 23:35:10,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:10,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-23 23:35:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:10,698 INFO L225 Difference]: With dead ends: 3437 [2019-11-23 23:35:10,699 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:35:10,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:35:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:35:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:35:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2732 transitions. [2019-11-23 23:35:10,771 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2732 transitions. Word has length 171 [2019-11-23 23:35:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:10,772 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2732 transitions. [2019-11-23 23:35:10,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2732 transitions. [2019-11-23 23:35:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:35:10,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:10,777 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:10,777 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1690901851, now seen corresponding path program 1 times [2019-11-23 23:35:10,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:10,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181634486] [2019-11-23 23:35:10,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:11,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181634486] [2019-11-23 23:35:11,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:11,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:11,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547481598] [2019-11-23 23:35:11,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:35:11,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:11,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:35:11,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:11,015 INFO L87 Difference]: Start difference. First operand 1719 states and 2732 transitions. Second operand 5 states. [2019-11-23 23:35:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:12,754 INFO L93 Difference]: Finished difference Result 4156 states and 6691 transitions. [2019-11-23 23:35:12,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:35:12,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-23 23:35:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:12,767 INFO L225 Difference]: With dead ends: 4156 [2019-11-23 23:35:12,768 INFO L226 Difference]: Without dead ends: 2438 [2019-11-23 23:35:12,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2019-11-23 23:35:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2005. [2019-11-23 23:35:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-11-23 23:35:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 3202 transitions. [2019-11-23 23:35:12,816 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 3202 transitions. Word has length 181 [2019-11-23 23:35:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:12,816 INFO L462 AbstractCegarLoop]: Abstraction has 2005 states and 3202 transitions. [2019-11-23 23:35:12,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:35:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 3202 transitions. [2019-11-23 23:35:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-23 23:35:12,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:12,822 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:12,822 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1151906255, now seen corresponding path program 1 times [2019-11-23 23:35:12,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:12,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267988117] [2019-11-23 23:35:12,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 23:35:12,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267988117] [2019-11-23 23:35:12,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576755858] [2019-11-23 23:35:12,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:13,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:35:13,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 23:35:13,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 23:35:13,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:13,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 3 [2019-11-23 23:35:13,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594835114] [2019-11-23 23:35:13,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:13,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:13,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:13,375 INFO L87 Difference]: Start difference. First operand 2005 states and 3202 transitions. Second operand 3 states. [2019-11-23 23:35:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:13,767 INFO L93 Difference]: Finished difference Result 6013 states and 9604 transitions. [2019-11-23 23:35:13,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:13,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-11-23 23:35:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:13,789 INFO L225 Difference]: With dead ends: 6013 [2019-11-23 23:35:13,790 INFO L226 Difference]: Without dead ends: 4009 [2019-11-23 23:35:13,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2019-11-23 23:35:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4007. [2019-11-23 23:35:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2019-11-23 23:35:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 6380 transitions. [2019-11-23 23:35:13,879 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 6380 transitions. Word has length 215 [2019-11-23 23:35:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:13,879 INFO L462 AbstractCegarLoop]: Abstraction has 4007 states and 6380 transitions. [2019-11-23 23:35:13,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 6380 transitions. [2019-11-23 23:35:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-23 23:35:13,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:13,887 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:14,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:14,101 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:14,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:14,101 INFO L82 PathProgramCache]: Analyzing trace with hash -645083759, now seen corresponding path program 1 times [2019-11-23 23:35:14,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:14,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721664138] [2019-11-23 23:35:14,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:14,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721664138] [2019-11-23 23:35:14,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:14,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:14,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106570049] [2019-11-23 23:35:14,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:14,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:14,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:14,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:14,329 INFO L87 Difference]: Start difference. First operand 4007 states and 6380 transitions. Second operand 3 states. [2019-11-23 23:35:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:15,201 INFO L93 Difference]: Finished difference Result 12017 states and 19137 transitions. [2019-11-23 23:35:15,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:15,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-23 23:35:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:15,241 INFO L225 Difference]: With dead ends: 12017 [2019-11-23 23:35:15,241 INFO L226 Difference]: Without dead ends: 8011 [2019-11-23 23:35:15,249 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-23 23:35:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8011 states. [2019-11-23 23:35:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8011 to 8011. [2019-11-23 23:35:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2019-11-23 23:35:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 11614 transitions. [2019-11-23 23:35:15,411 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 11614 transitions. Word has length 216 [2019-11-23 23:35:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:15,411 INFO L462 AbstractCegarLoop]: Abstraction has 8011 states and 11614 transitions. [2019-11-23 23:35:15,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 11614 transitions. [2019-11-23 23:35:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-23 23:35:15,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:15,424 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:15,424 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash -867047614, now seen corresponding path program 1 times [2019-11-23 23:35:15,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:15,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2211067] [2019-11-23 23:35:15,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 23:35:15,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2211067] [2019-11-23 23:35:15,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:15,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:15,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115491063] [2019-11-23 23:35:15,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:15,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:15,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:15,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:15,632 INFO L87 Difference]: Start difference. First operand 8011 states and 11614 transitions. Second operand 3 states. [2019-11-23 23:35:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:16,465 INFO L93 Difference]: Finished difference Result 18023 states and 26568 transitions. [2019-11-23 23:35:16,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:16,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-23 23:35:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:16,507 INFO L225 Difference]: With dead ends: 18023 [2019-11-23 23:35:16,507 INFO L226 Difference]: Without dead ends: 10013 [2019-11-23 23:35:16,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2019-11-23 23:35:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 10013. [2019-11-23 23:35:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10013 states. [2019-11-23 23:35:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10013 states to 10013 states and 13724 transitions. [2019-11-23 23:35:16,719 INFO L78 Accepts]: Start accepts. Automaton has 10013 states and 13724 transitions. Word has length 220 [2019-11-23 23:35:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:16,719 INFO L462 AbstractCegarLoop]: Abstraction has 10013 states and 13724 transitions. [2019-11-23 23:35:16,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 10013 states and 13724 transitions. [2019-11-23 23:35:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 23:35:16,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:16,734 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:16,734 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:16,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2120059299, now seen corresponding path program 1 times [2019-11-23 23:35:16,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:16,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970924948] [2019-11-23 23:35:16,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:16,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970924948] [2019-11-23 23:35:16,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:16,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:16,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554531566] [2019-11-23 23:35:16,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:16,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:16,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:16,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:16,946 INFO L87 Difference]: Start difference. First operand 10013 states and 13724 transitions. Second operand 4 states. [2019-11-23 23:35:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:18,154 INFO L93 Difference]: Finished difference Result 33183 states and 45008 transitions. [2019-11-23 23:35:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:18,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-23 23:35:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:18,197 INFO L225 Difference]: With dead ends: 33183 [2019-11-23 23:35:18,197 INFO L226 Difference]: Without dead ends: 23171 [2019-11-23 23:35:18,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23171 states. [2019-11-23 23:35:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23171 to 17449. [2019-11-23 23:35:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17449 states. [2019-11-23 23:35:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17449 states to 17449 states and 22832 transitions. [2019-11-23 23:35:18,488 INFO L78 Accepts]: Start accepts. Automaton has 17449 states and 22832 transitions. Word has length 221 [2019-11-23 23:35:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:18,489 INFO L462 AbstractCegarLoop]: Abstraction has 17449 states and 22832 transitions. [2019-11-23 23:35:18,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 17449 states and 22832 transitions. [2019-11-23 23:35:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-23 23:35:18,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:18,507 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:18,507 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:18,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1442911105, now seen corresponding path program 1 times [2019-11-23 23:35:18,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:18,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574524155] [2019-11-23 23:35:18,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:18,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574524155] [2019-11-23 23:35:18,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336298047] [2019-11-23 23:35:18,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:19,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:35:19,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:35:19,227 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:35:19,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:19,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-11-23 23:35:19,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938636323] [2019-11-23 23:35:19,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:19,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:19,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:19,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:35:19,290 INFO L87 Difference]: Start difference. First operand 17449 states and 22832 transitions. Second operand 3 states. [2019-11-23 23:35:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:20,226 INFO L93 Difference]: Finished difference Result 45908 states and 59983 transitions. [2019-11-23 23:35:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:20,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-11-23 23:35:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:20,279 INFO L225 Difference]: With dead ends: 45908 [2019-11-23 23:35:20,279 INFO L226 Difference]: Without dead ends: 28460 [2019-11-23 23:35:20,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 470 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:35:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28460 states. [2019-11-23 23:35:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28460 to 28460. [2019-11-23 23:35:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28460 states. [2019-11-23 23:35:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28460 states to 28460 states and 36078 transitions. [2019-11-23 23:35:21,577 INFO L78 Accepts]: Start accepts. Automaton has 28460 states and 36078 transitions. Word has length 236 [2019-11-23 23:35:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:21,578 INFO L462 AbstractCegarLoop]: Abstraction has 28460 states and 36078 transitions. [2019-11-23 23:35:21,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 28460 states and 36078 transitions. [2019-11-23 23:35:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-23 23:35:21,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:21,602 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-23 23:35:21,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:21,814 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1261930605, now seen corresponding path program 1 times [2019-11-23 23:35:21,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:21,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517249263] [2019-11-23 23:35:21,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-23 23:35:21,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517249263] [2019-11-23 23:35:21,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:21,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:21,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216846419] [2019-11-23 23:35:21,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:21,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:21,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:21,944 INFO L87 Difference]: Start difference. First operand 28460 states and 36078 transitions. Second operand 3 states. [2019-11-23 23:35:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:23,077 INFO L93 Difference]: Finished difference Result 69789 states and 88413 transitions. [2019-11-23 23:35:23,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:23,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-23 23:35:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:23,155 INFO L225 Difference]: With dead ends: 69789 [2019-11-23 23:35:23,155 INFO L226 Difference]: Without dead ends: 41330 [2019-11-23 23:35:23,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41330 states. [2019-11-23 23:35:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41330 to 41330. [2019-11-23 23:35:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41330 states. [2019-11-23 23:35:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41330 states to 41330 states and 52218 transitions. [2019-11-23 23:35:23,855 INFO L78 Accepts]: Start accepts. Automaton has 41330 states and 52218 transitions. Word has length 245 [2019-11-23 23:35:23,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:23,855 INFO L462 AbstractCegarLoop]: Abstraction has 41330 states and 52218 transitions. [2019-11-23 23:35:23,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 41330 states and 52218 transitions. [2019-11-23 23:35:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 23:35:23,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:23,886 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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-23 23:35:23,886 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:23,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1387578864, now seen corresponding path program 1 times [2019-11-23 23:35:23,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:23,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178420553] [2019-11-23 23:35:23,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-23 23:35:24,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178420553] [2019-11-23 23:35:24,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980117335] [2019-11-23 23:35:24,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:24,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:35:24,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:24,241 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:24,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:24,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:24,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518817522] [2019-11-23 23:35:24,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:24,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:24,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:24,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:24,300 INFO L87 Difference]: Start difference. First operand 41330 states and 52218 transitions. Second operand 3 states. [2019-11-23 23:35:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:25,581 INFO L93 Difference]: Finished difference Result 89094 states and 113689 transitions. [2019-11-23 23:35:25,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:25,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-23 23:35:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:25,669 INFO L225 Difference]: With dead ends: 89094 [2019-11-23 23:35:25,670 INFO L226 Difference]: Without dead ends: 47765 [2019-11-23 23:35:25,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47765 states. [2019-11-23 23:35:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47765 to 47765. [2019-11-23 23:35:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47765 states. [2019-11-23 23:35:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47765 states to 47765 states and 59196 transitions. [2019-11-23 23:35:26,268 INFO L78 Accepts]: Start accepts. Automaton has 47765 states and 59196 transitions. Word has length 252 [2019-11-23 23:35:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:26,268 INFO L462 AbstractCegarLoop]: Abstraction has 47765 states and 59196 transitions. [2019-11-23 23:35:26,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 47765 states and 59196 transitions. [2019-11-23 23:35:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-23 23:35:26,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:26,298 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:26,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:26,502 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:26,502 INFO L82 PathProgramCache]: Analyzing trace with hash 507239645, now seen corresponding path program 1 times [2019-11-23 23:35:26,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:26,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468741402] [2019-11-23 23:35:26,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:27,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468741402] [2019-11-23 23:35:27,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:27,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:27,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053426149] [2019-11-23 23:35:27,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:27,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:27,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:27,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:27,825 INFO L87 Difference]: Start difference. First operand 47765 states and 59196 transitions. Second operand 4 states. [2019-11-23 23:35:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:28,998 INFO L93 Difference]: Finished difference Result 95529 states and 118391 transitions. [2019-11-23 23:35:28,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:28,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-11-23 23:35:28,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:29,049 INFO L225 Difference]: With dead ends: 95529 [2019-11-23 23:35:29,049 INFO L226 Difference]: Without dead ends: 47765 [2019-11-23 23:35:29,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47765 states. [2019-11-23 23:35:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47765 to 47765. [2019-11-23 23:35:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47765 states. [2019-11-23 23:35:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47765 states to 47765 states and 58656 transitions. [2019-11-23 23:35:29,802 INFO L78 Accepts]: Start accepts. Automaton has 47765 states and 58656 transitions. Word has length 282 [2019-11-23 23:35:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:29,802 INFO L462 AbstractCegarLoop]: Abstraction has 47765 states and 58656 transitions. [2019-11-23 23:35:29,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 47765 states and 58656 transitions. [2019-11-23 23:35:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-23 23:35:29,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:29,821 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:29,822 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:29,822 INFO L82 PathProgramCache]: Analyzing trace with hash 659485426, now seen corresponding path program 1 times [2019-11-23 23:35:29,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:29,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448494247] [2019-11-23 23:35:29,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 23:35:29,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448494247] [2019-11-23 23:35:29,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:29,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:29,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355802380] [2019-11-23 23:35:29,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:29,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:29,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:29,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:29,955 INFO L87 Difference]: Start difference. First operand 47765 states and 58656 transitions. Second operand 4 states. [2019-11-23 23:35:31,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:31,964 INFO L93 Difference]: Finished difference Result 169178 states and 207147 transitions. [2019-11-23 23:35:31,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:31,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2019-11-23 23:35:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:32,082 INFO L225 Difference]: With dead ends: 169178 [2019-11-23 23:35:32,082 INFO L226 Difference]: Without dead ends: 121414 [2019-11-23 23:35:32,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121414 states. [2019-11-23 23:35:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121414 to 121410. [2019-11-23 23:35:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121410 states. [2019-11-23 23:35:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121410 states to 121410 states and 147978 transitions. [2019-11-23 23:35:33,523 INFO L78 Accepts]: Start accepts. Automaton has 121410 states and 147978 transitions. Word has length 294 [2019-11-23 23:35:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:33,523 INFO L462 AbstractCegarLoop]: Abstraction has 121410 states and 147978 transitions. [2019-11-23 23:35:33,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 121410 states and 147978 transitions. [2019-11-23 23:35:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-23 23:35:33,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:33,545 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:33,545 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:33,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1358279132, now seen corresponding path program 1 times [2019-11-23 23:35:33,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:33,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468809262] [2019-11-23 23:35:33,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:35:34,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468809262] [2019-11-23 23:35:34,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043775190] [2019-11-23 23:35:34,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:34,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 23:35:34,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:35:34,318 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:34,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:35:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:35:34,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:34,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:34,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155744266] [2019-11-23 23:35:34,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:34,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:34,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:34,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:35:34,410 INFO L87 Difference]: Start difference. First operand 121410 states and 147978 transitions. Second operand 4 states. [2019-11-23 23:35:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:38,453 INFO L93 Difference]: Finished difference Result 326047 states and 397734 transitions. [2019-11-23 23:35:38,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:38,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-11-23 23:35:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:38,666 INFO L225 Difference]: With dead ends: 326047 [2019-11-23 23:35:38,667 INFO L226 Difference]: Without dead ends: 204638 [2019-11-23 23:35:38,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 600 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:35:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204638 states. [2019-11-23 23:35:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204638 to 204636. [2019-11-23 23:35:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204636 states. [2019-11-23 23:35:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204636 states to 204636 states and 247000 transitions. [2019-11-23 23:35:40,897 INFO L78 Accepts]: Start accepts. Automaton has 204636 states and 247000 transitions. Word has length 302 [2019-11-23 23:35:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:40,897 INFO L462 AbstractCegarLoop]: Abstraction has 204636 states and 247000 transitions. [2019-11-23 23:35:40,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 204636 states and 247000 transitions. [2019-11-23 23:35:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-11-23 23:35:40,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:40,928 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:41,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:41,133 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:41,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1275006270, now seen corresponding path program 1 times [2019-11-23 23:35:41,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:41,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657568536] [2019-11-23 23:35:41,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:35:41,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657568536] [2019-11-23 23:35:41,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:41,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:41,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42217298] [2019-11-23 23:35:41,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:41,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:41,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:41,301 INFO L87 Difference]: Start difference. First operand 204636 states and 247000 transitions. Second operand 4 states. [2019-11-23 23:35:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:45,902 INFO L93 Difference]: Finished difference Result 484346 states and 585201 transitions. [2019-11-23 23:35:45,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:45,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-11-23 23:35:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:46,202 INFO L225 Difference]: With dead ends: 484346 [2019-11-23 23:35:46,202 INFO L226 Difference]: Without dead ends: 279711 [2019-11-23 23:35:46,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279711 states. [2019-11-23 23:35:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279711 to 237669. [2019-11-23 23:35:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237669 states. [2019-11-23 23:35:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237669 states to 237669 states and 283729 transitions. [2019-11-23 23:35:54,470 INFO L78 Accepts]: Start accepts. Automaton has 237669 states and 283729 transitions. Word has length 318 [2019-11-23 23:35:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:54,470 INFO L462 AbstractCegarLoop]: Abstraction has 237669 states and 283729 transitions. [2019-11-23 23:35:54,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 237669 states and 283729 transitions. [2019-11-23 23:35:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-11-23 23:35:54,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:54,505 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:54,505 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash -359017464, now seen corresponding path program 1 times [2019-11-23 23:35:54,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:54,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043615502] [2019-11-23 23:35:54,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:35:54,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043615502] [2019-11-23 23:35:54,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:54,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:35:54,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368316044] [2019-11-23 23:35:54,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:35:54,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:35:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:54,874 INFO L87 Difference]: Start difference. First operand 237669 states and 283729 transitions. Second operand 6 states. [2019-11-23 23:36:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:02,900 INFO L93 Difference]: Finished difference Result 806098 states and 950016 transitions. [2019-11-23 23:36:02,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 23:36:02,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 345 [2019-11-23 23:36:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:03,577 INFO L225 Difference]: With dead ends: 806098 [2019-11-23 23:36:03,577 INFO L226 Difference]: Without dead ends: 568430 [2019-11-23 23:36:03,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568430 states.