/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_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:35:19,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:35:19,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:35:19,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:35:19,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:35:19,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:35:19,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:35:19,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:35:19,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:35:19,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:35:19,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:35:19,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:35:19,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:35:19,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:35:19,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:35:19,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:35:19,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:35:19,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:35:19,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:35:19,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:35:19,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:35:19,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:35:19,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:35:19,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:35:19,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:35:19,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:35:19,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:35:19,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:35:19,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:35:19,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:35:19,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:35:19,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:35:19,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:35:19,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:35:19,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:35:19,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:35:19,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:35:19,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:35:19,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:35:19,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:35:19,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:35:19,138 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:35:19,164 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:35:19,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:35:19,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:35:19,165 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:35:19,165 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:35:19,166 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:35:19,166 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:35:19,166 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:35:19,166 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:35:19,166 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:35:19,167 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:35:19,168 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:35:19,168 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:35:19,168 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:35:19,169 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:35:19,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:35:19,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:35:19,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:35:19,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:35:19,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:35:19,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:35:19,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:35:19,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:35:19,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:35:19,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:35:19,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:35:19,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:35:19,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:35:19,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:35:19,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:35:19,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:35:19,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:35:19,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:35:19,175 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:35:19,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:35:19,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:35:19,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:35:19,176 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:35:19,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:35:19,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:35:19,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:35:19,467 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:35:19,467 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:35:19,468 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label38.c [2019-11-23 23:35:19,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90335bac9/05dd579f9a1442ccab4c30da83307b0e/FLAGa36dd56be [2019-11-23 23:35:20,199 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:35:20,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label38.c [2019-11-23 23:35:20,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90335bac9/05dd579f9a1442ccab4c30da83307b0e/FLAGa36dd56be [2019-11-23 23:35:20,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90335bac9/05dd579f9a1442ccab4c30da83307b0e [2019-11-23 23:35:20,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:35:20,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:35:20,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:20,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:35:20,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:35:20,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:20" (1/1) ... [2019-11-23 23:35:20,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47757ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:20, skipping insertion in model container [2019-11-23 23:35:20,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:20" (1/1) ... [2019-11-23 23:35:20,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:35:20,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:35:21,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:21,502 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:35:21,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:21,789 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:35:21,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:21 WrapperNode [2019-11-23 23:35:21,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:21,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:21,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:35:21,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:35:21,801 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:21" (1/1) ... [2019-11-23 23:35:21,842 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:21" (1/1) ... [2019-11-23 23:35:21,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:21,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:35:21,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:35:21,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:35:21,952 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:21" (1/1) ... [2019-11-23 23:35:21,952 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:21" (1/1) ... [2019-11-23 23:35:21,959 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:21" (1/1) ... [2019-11-23 23:35:21,960 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:21" (1/1) ... [2019-11-23 23:35:22,012 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:21" (1/1) ... [2019-11-23 23:35:22,047 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:21" (1/1) ... [2019-11-23 23:35:22,076 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:21" (1/1) ... [2019-11-23 23:35:22,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:35:22,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:35:22,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:35:22,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:35:22,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:21" (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:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:35:22,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:35:25,150 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:35:25,150 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:35:25,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:25 BoogieIcfgContainer [2019-11-23 23:35:25,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:35:25,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:35:25,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:35:25,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:35:25,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:35:20" (1/3) ... [2019-11-23 23:35:25,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6027cb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:25, skipping insertion in model container [2019-11-23 23:35:25,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:21" (2/3) ... [2019-11-23 23:35:25,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6027cb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:25, skipping insertion in model container [2019-11-23 23:35:25,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:25" (3/3) ... [2019-11-23 23:35:25,168 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label38.c [2019-11-23 23:35:25,179 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:35:25,188 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:35:25,201 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:35:25,230 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:35:25,230 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:35:25,230 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:35:25,230 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:35:25,230 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:35:25,231 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:35:25,231 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:35:25,231 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:35:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:35:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:35:25,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:25,265 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:25,266 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:25,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1467438303, now seen corresponding path program 1 times [2019-11-23 23:35:25,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:25,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306321737] [2019-11-23 23:35:25,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:25,906 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:25,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306321737] [2019-11-23 23:35:25,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:25,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:25,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355744401] [2019-11-23 23:35:25,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:25,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:25,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:25,938 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-23 23:35:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:27,184 INFO L93 Difference]: Finished difference Result 440 states and 860 transitions. [2019-11-23 23:35:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:27,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-23 23:35:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:27,204 INFO L225 Difference]: With dead ends: 440 [2019-11-23 23:35:27,204 INFO L226 Difference]: Without dead ends: 289 [2019-11-23 23:35:27,209 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:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-23 23:35:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-11-23 23:35:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:35:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 549 transitions. [2019-11-23 23:35:27,275 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 549 transitions. Word has length 143 [2019-11-23 23:35:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:27,276 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 549 transitions. [2019-11-23 23:35:27,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 549 transitions. [2019-11-23 23:35:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 23:35:27,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:27,281 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-11-23 23:35:27,281 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:27,282 INFO L82 PathProgramCache]: Analyzing trace with hash 732730819, now seen corresponding path program 1 times [2019-11-23 23:35:27,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:27,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969678037] [2019-11-23 23:35:27,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:27,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969678037] [2019-11-23 23:35:27,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:27,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:27,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775242218] [2019-11-23 23:35:27,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:27,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:27,447 INFO L87 Difference]: Start difference. First operand 289 states and 549 transitions. Second operand 4 states. [2019-11-23 23:35:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:28,974 INFO L93 Difference]: Finished difference Result 1151 states and 2192 transitions. [2019-11-23 23:35:28,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:28,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 23:35:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:28,982 INFO L225 Difference]: With dead ends: 1151 [2019-11-23 23:35:28,982 INFO L226 Difference]: Without dead ends: 863 [2019-11-23 23:35:28,985 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:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-11-23 23:35:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 575. [2019-11-23 23:35:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:35:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1015 transitions. [2019-11-23 23:35:29,039 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1015 transitions. Word has length 148 [2019-11-23 23:35:29,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:29,048 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1015 transitions. [2019-11-23 23:35:29,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1015 transitions. [2019-11-23 23:35:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 23:35:29,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:29,054 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-23 23:35:29,054 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:29,055 INFO L82 PathProgramCache]: Analyzing trace with hash 760408926, now seen corresponding path program 1 times [2019-11-23 23:35:29,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:29,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596828795] [2019-11-23 23:35:29,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:29,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596828795] [2019-11-23 23:35:29,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:29,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:29,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532413630] [2019-11-23 23:35:29,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:29,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:29,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:29,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:29,348 INFO L87 Difference]: Start difference. First operand 575 states and 1015 transitions. Second operand 3 states. [2019-11-23 23:35:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:30,289 INFO L93 Difference]: Finished difference Result 1721 states and 3042 transitions. [2019-11-23 23:35:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:30,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-23 23:35:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:30,304 INFO L225 Difference]: With dead ends: 1721 [2019-11-23 23:35:30,304 INFO L226 Difference]: Without dead ends: 1147 [2019-11-23 23:35:30,307 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:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2019-11-23 23:35:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2019-11-23 23:35:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:35:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1879 transitions. [2019-11-23 23:35:30,390 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1879 transitions. Word has length 150 [2019-11-23 23:35:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:30,392 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1879 transitions. [2019-11-23 23:35:30,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1879 transitions. [2019-11-23 23:35:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:35:30,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:30,405 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-23 23:35:30,405 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:30,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:30,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1384671465, now seen corresponding path program 1 times [2019-11-23 23:35:30,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:30,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817994959] [2019-11-23 23:35:30,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 23:35:30,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817994959] [2019-11-23 23:35:30,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:30,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:30,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100254799] [2019-11-23 23:35:30,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:30,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:30,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:30,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:30,516 INFO L87 Difference]: Start difference. First operand 1147 states and 1879 transitions. Second operand 3 states. [2019-11-23 23:35:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:31,434 INFO L93 Difference]: Finished difference Result 2865 states and 4670 transitions. [2019-11-23 23:35:31,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:31,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 23:35:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:31,446 INFO L225 Difference]: With dead ends: 2865 [2019-11-23 23:35:31,446 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:35:31,448 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:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:35:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:35:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:35:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2736 transitions. [2019-11-23 23:35:31,486 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2736 transitions. Word has length 158 [2019-11-23 23:35:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:31,487 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2736 transitions. [2019-11-23 23:35:31,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2736 transitions. [2019-11-23 23:35:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 23:35:31,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:31,491 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:31,492 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash 559049575, now seen corresponding path program 1 times [2019-11-23 23:35:31,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:31,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868848425] [2019-11-23 23:35:31,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:31,557 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:31,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868848425] [2019-11-23 23:35:31,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:31,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:31,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309421690] [2019-11-23 23:35:31,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:31,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:31,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:31,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:31,560 INFO L87 Difference]: Start difference. First operand 1719 states and 2736 transitions. Second operand 3 states. [2019-11-23 23:35:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:32,043 INFO L93 Difference]: Finished difference Result 5155 states and 8206 transitions. [2019-11-23 23:35:32,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:32,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 23:35:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:32,061 INFO L225 Difference]: With dead ends: 5155 [2019-11-23 23:35:32,061 INFO L226 Difference]: Without dead ends: 3437 [2019-11-23 23:35:32,065 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:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2019-11-23 23:35:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3435. [2019-11-23 23:35:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-23 23:35:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5452 transitions. [2019-11-23 23:35:32,134 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5452 transitions. Word has length 163 [2019-11-23 23:35:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:32,135 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5452 transitions. [2019-11-23 23:35:32,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5452 transitions. [2019-11-23 23:35:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 23:35:32,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:32,141 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2019-11-23 23:35:32,142 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash -272220147, now seen corresponding path program 1 times [2019-11-23 23:35:32,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:32,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107570833] [2019-11-23 23:35:32,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 23:35:32,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107570833] [2019-11-23 23:35:32,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151384858] [2019-11-23 23:35:32,248 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:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:32,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:35:32,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:35:32,561 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:35:32,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:32,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 3 [2019-11-23 23:35:32,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130380708] [2019-11-23 23:35:32,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:32,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:32,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:32,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:32,599 INFO L87 Difference]: Start difference. First operand 3435 states and 5452 transitions. Second operand 3 states. [2019-11-23 23:35:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:33,027 INFO L93 Difference]: Finished difference Result 10303 states and 16354 transitions. [2019-11-23 23:35:33,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:33,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-23 23:35:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:33,068 INFO L225 Difference]: With dead ends: 10303 [2019-11-23 23:35:33,068 INFO L226 Difference]: Without dead ends: 6869 [2019-11-23 23:35:33,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 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:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2019-11-23 23:35:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 6867. [2019-11-23 23:35:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6867 states. [2019-11-23 23:35:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6867 states to 6867 states and 10872 transitions. [2019-11-23 23:35:33,235 INFO L78 Accepts]: Start accepts. Automaton has 6867 states and 10872 transitions. Word has length 172 [2019-11-23 23:35:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:33,235 INFO L462 AbstractCegarLoop]: Abstraction has 6867 states and 10872 transitions. [2019-11-23 23:35:33,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 6867 states and 10872 transitions. [2019-11-23 23:35:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:35:33,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:33,247 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:33,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:33,452 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:33,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1690895195, now seen corresponding path program 1 times [2019-11-23 23:35:33,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:33,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716596247] [2019-11-23 23:35:33,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:33,709 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:33,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716596247] [2019-11-23 23:35:33,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:33,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:33,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103968387] [2019-11-23 23:35:33,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:35:33,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:33,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:35:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:33,711 INFO L87 Difference]: Start difference. First operand 6867 states and 10872 transitions. Second operand 5 states. [2019-11-23 23:35:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:35,482 INFO L93 Difference]: Finished difference Result 15739 states and 25157 transitions. [2019-11-23 23:35:35,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:35:35,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-23 23:35:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:35,520 INFO L225 Difference]: With dead ends: 15739 [2019-11-23 23:35:35,520 INFO L226 Difference]: Without dead ends: 8873 [2019-11-23 23:35:35,531 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:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2019-11-23 23:35:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 8011. [2019-11-23 23:35:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2019-11-23 23:35:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 12674 transitions. [2019-11-23 23:35:35,728 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 12674 transitions. Word has length 181 [2019-11-23 23:35:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:35,728 INFO L462 AbstractCegarLoop]: Abstraction has 8011 states and 12674 transitions. [2019-11-23 23:35:35,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:35:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 12674 transitions. [2019-11-23 23:35:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:35:35,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:35,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,860 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash 142429754, now seen corresponding path program 1 times [2019-11-23 23:35:35,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:35,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422681653] [2019-11-23 23:35:35,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:35,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422681653] [2019-11-23 23:35:35,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:35,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:35,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140951823] [2019-11-23 23:35:35,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:35,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:35,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:35,967 INFO L87 Difference]: Start difference. First operand 8011 states and 12674 transitions. Second operand 3 states. [2019-11-23 23:35:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:36,958 INFO L93 Difference]: Finished difference Result 19882 states and 31822 transitions. [2019-11-23 23:35:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:36,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-23 23:35:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:36,990 INFO L225 Difference]: With dead ends: 19882 [2019-11-23 23:35:36,991 INFO L226 Difference]: Without dead ends: 11872 [2019-11-23 23:35:37,003 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:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11872 states. [2019-11-23 23:35:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11872 to 11872. [2019-11-23 23:35:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11872 states. [2019-11-23 23:35:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11872 states to 11872 states and 18363 transitions. [2019-11-23 23:35:37,184 INFO L78 Accepts]: Start accepts. Automaton has 11872 states and 18363 transitions. Word has length 181 [2019-11-23 23:35:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:37,185 INFO L462 AbstractCegarLoop]: Abstraction has 11872 states and 18363 transitions. [2019-11-23 23:35:37,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 11872 states and 18363 transitions. [2019-11-23 23:35:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:35:37,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:37,201 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:37,202 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:37,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:37,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1290435789, now seen corresponding path program 1 times [2019-11-23 23:35:37,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:37,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379462176] [2019-11-23 23:35:37,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 23:35:37,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379462176] [2019-11-23 23:35:37,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:37,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:37,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589784782] [2019-11-23 23:35:37,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:37,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:37,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:37,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:37,376 INFO L87 Difference]: Start difference. First operand 11872 states and 18363 transitions. Second operand 4 states. [2019-11-23 23:35:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:38,953 INFO L93 Difference]: Finished difference Result 37185 states and 57009 transitions. [2019-11-23 23:35:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:38,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-23 23:35:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:39,006 INFO L225 Difference]: With dead ends: 37185 [2019-11-23 23:35:39,006 INFO L226 Difference]: Without dead ends: 25314 [2019-11-23 23:35:39,026 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:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25314 states. [2019-11-23 23:35:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25314 to 19022. [2019-11-23 23:35:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19022 states. [2019-11-23 23:35:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19022 states to 19022 states and 28100 transitions. [2019-11-23 23:35:39,342 INFO L78 Accepts]: Start accepts. Automaton has 19022 states and 28100 transitions. Word has length 181 [2019-11-23 23:35:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:39,343 INFO L462 AbstractCegarLoop]: Abstraction has 19022 states and 28100 transitions. [2019-11-23 23:35:39,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 19022 states and 28100 transitions. [2019-11-23 23:35:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-23 23:35:39,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:39,374 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:39,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2131822554, now seen corresponding path program 1 times [2019-11-23 23:35:39,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:39,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34821581] [2019-11-23 23:35:39,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-23 23:35:39,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34821581] [2019-11-23 23:35:39,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:39,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:39,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773699073] [2019-11-23 23:35:39,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:39,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:39,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:39,603 INFO L87 Difference]: Start difference. First operand 19022 states and 28100 transitions. Second operand 3 states. [2019-11-23 23:35:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:40,634 INFO L93 Difference]: Finished difference Result 49626 states and 72683 transitions. [2019-11-23 23:35:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:40,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-23 23:35:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:40,681 INFO L225 Difference]: With dead ends: 49626 [2019-11-23 23:35:40,682 INFO L226 Difference]: Without dead ends: 30605 [2019-11-23 23:35:40,705 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:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30605 states. [2019-11-23 23:35:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30605 to 30605. [2019-11-23 23:35:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30605 states. [2019-11-23 23:35:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30605 states to 30605 states and 39420 transitions. [2019-11-23 23:35:42,166 INFO L78 Accepts]: Start accepts. Automaton has 30605 states and 39420 transitions. Word has length 200 [2019-11-23 23:35:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:42,166 INFO L462 AbstractCegarLoop]: Abstraction has 30605 states and 39420 transitions. [2019-11-23 23:35:42,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 30605 states and 39420 transitions. [2019-11-23 23:35:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-23 23:35:42,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:42,206 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,206 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:42,207 INFO L82 PathProgramCache]: Analyzing trace with hash 570980348, now seen corresponding path program 1 times [2019-11-23 23:35:42,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:42,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224897944] [2019-11-23 23:35:42,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 23:35:42,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224897944] [2019-11-23 23:35:42,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115733868] [2019-11-23 23:35:42,392 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:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:42,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:35:42,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:42,622 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:42,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:42,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:42,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915776246] [2019-11-23 23:35:42,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:42,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:42,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:42,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:42,661 INFO L87 Difference]: Start difference. First operand 30605 states and 39420 transitions. Second operand 3 states. [2019-11-23 23:35:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:43,936 INFO L93 Difference]: Finished difference Result 71505 states and 93560 transitions. [2019-11-23 23:35:43,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:43,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-23 23:35:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:43,986 INFO L225 Difference]: With dead ends: 71505 [2019-11-23 23:35:43,986 INFO L226 Difference]: Without dead ends: 40901 [2019-11-23 23:35:44,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40901 states. [2019-11-23 23:35:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40901 to 39185. [2019-11-23 23:35:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39185 states. [2019-11-23 23:35:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39185 states to 39185 states and 51706 transitions. [2019-11-23 23:35:44,544 INFO L78 Accepts]: Start accepts. Automaton has 39185 states and 51706 transitions. Word has length 209 [2019-11-23 23:35:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:44,544 INFO L462 AbstractCegarLoop]: Abstraction has 39185 states and 51706 transitions. [2019-11-23 23:35:44,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 39185 states and 51706 transitions. [2019-11-23 23:35:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 23:35:44,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:44,574 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:44,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:44,778 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash -769557355, now seen corresponding path program 1 times [2019-11-23 23:35:44,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:44,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894459331] [2019-11-23 23:35:44,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:44,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894459331] [2019-11-23 23:35:44,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457868339] [2019-11-23 23:35:44,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 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:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:45,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:35:45,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:45,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:35:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:45,510 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:45,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:35:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:45,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-23 23:35:45,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2019-11-23 23:35:45,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197756522] [2019-11-23 23:35:45,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:45,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:45,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:45,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:35:45,607 INFO L87 Difference]: Start difference. First operand 39185 states and 51706 transitions. Second operand 3 states. [2019-11-23 23:35:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:46,773 INFO L93 Difference]: Finished difference Result 93813 states and 122940 transitions. [2019-11-23 23:35:46,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:46,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-11-23 23:35:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:46,831 INFO L225 Difference]: With dead ends: 93813 [2019-11-23 23:35:46,832 INFO L226 Difference]: Without dead ends: 54629 [2019-11-23 23:35:46,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:35:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54629 states. [2019-11-23 23:35:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54629 to 53771. [2019-11-23 23:35:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53771 states. [2019-11-23 23:35:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53771 states to 53771 states and 69289 transitions. [2019-11-23 23:35:47,728 INFO L78 Accepts]: Start accepts. Automaton has 53771 states and 69289 transitions. Word has length 221 [2019-11-23 23:35:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:47,729 INFO L462 AbstractCegarLoop]: Abstraction has 53771 states and 69289 transitions. [2019-11-23 23:35:47,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 53771 states and 69289 transitions. [2019-11-23 23:35:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-23 23:35:47,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:47,760 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:47,965 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 121793668, now seen corresponding path program 1 times [2019-11-23 23:35:47,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:47,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766158496] [2019-11-23 23:35:47,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 23:35:48,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766158496] [2019-11-23 23:35:48,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:48,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:48,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594905524] [2019-11-23 23:35:48,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:48,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:48,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:48,118 INFO L87 Difference]: Start difference. First operand 53771 states and 69289 transitions. Second operand 3 states. [2019-11-23 23:35:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:48,789 INFO L93 Difference]: Finished difference Result 98675 states and 126903 transitions. [2019-11-23 23:35:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:48,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-11-23 23:35:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:48,829 INFO L225 Difference]: With dead ends: 98675 [2019-11-23 23:35:48,829 INFO L226 Difference]: Without dead ends: 44905 [2019-11-23 23:35:48,860 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:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44905 states. [2019-11-23 23:35:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44905 to 44905. [2019-11-23 23:35:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44905 states. [2019-11-23 23:35:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44905 states to 44905 states and 56995 transitions. [2019-11-23 23:35:50,546 INFO L78 Accepts]: Start accepts. Automaton has 44905 states and 56995 transitions. Word has length 228 [2019-11-23 23:35:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:50,547 INFO L462 AbstractCegarLoop]: Abstraction has 44905 states and 56995 transitions. [2019-11-23 23:35:50,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 44905 states and 56995 transitions. [2019-11-23 23:35:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-23 23:35:50,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:50,571 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:50,571 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:50,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1458396015, now seen corresponding path program 1 times [2019-11-23 23:35:50,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:50,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853141060] [2019-11-23 23:35:50,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:50,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853141060] [2019-11-23 23:35:50,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:50,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:50,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474414458] [2019-11-23 23:35:50,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:50,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:50,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:50,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:50,954 INFO L87 Difference]: Start difference. First operand 44905 states and 56995 transitions. Second operand 4 states. [2019-11-23 23:35:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:52,634 INFO L93 Difference]: Finished difference Result 94099 states and 119479 transitions. [2019-11-23 23:35:52,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:52,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 271 [2019-11-23 23:35:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:52,681 INFO L225 Difference]: With dead ends: 94099 [2019-11-23 23:35:52,681 INFO L226 Difference]: Without dead ends: 49195 [2019-11-23 23:35:52,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49195 states. [2019-11-23 23:35:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49195 to 46907. [2019-11-23 23:35:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46907 states. [2019-11-23 23:35:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46907 states to 46907 states and 59621 transitions. [2019-11-23 23:35:53,098 INFO L78 Accepts]: Start accepts. Automaton has 46907 states and 59621 transitions. Word has length 271 [2019-11-23 23:35:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:53,098 INFO L462 AbstractCegarLoop]: Abstraction has 46907 states and 59621 transitions. [2019-11-23 23:35:53,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 46907 states and 59621 transitions. [2019-11-23 23:35:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-23 23:35:53,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:53,126 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:53,127 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash -903992993, now seen corresponding path program 1 times [2019-11-23 23:35:53,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:53,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473151320] [2019-11-23 23:35:53,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:35:53,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473151320] [2019-11-23 23:35:53,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:53,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:53,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673048007] [2019-11-23 23:35:53,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:35:53,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:53,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:35:53,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:53,586 INFO L87 Difference]: Start difference. First operand 46907 states and 59621 transitions. Second operand 5 states. [2019-11-23 23:35:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:55,014 INFO L93 Difference]: Finished difference Result 135426 states and 171435 transitions. [2019-11-23 23:35:55,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:55,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2019-11-23 23:35:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:55,092 INFO L225 Difference]: With dead ends: 135426 [2019-11-23 23:35:55,093 INFO L226 Difference]: Without dead ends: 88520 [2019-11-23 23:35:55,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88520 states. [2019-11-23 23:35:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88520 to 88520. [2019-11-23 23:35:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88520 states. [2019-11-23 23:35:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88520 states to 88520 states and 111774 transitions. [2019-11-23 23:35:58,111 INFO L78 Accepts]: Start accepts. Automaton has 88520 states and 111774 transitions. Word has length 292 [2019-11-23 23:35:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:58,111 INFO L462 AbstractCegarLoop]: Abstraction has 88520 states and 111774 transitions. [2019-11-23 23:35:58,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:35:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 88520 states and 111774 transitions. [2019-11-23 23:35:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-23 23:35:58,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:58,156 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:58,156 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash -654991594, now seen corresponding path program 1 times [2019-11-23 23:35:58,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:58,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820936948] [2019-11-23 23:35:58,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-23 23:35:58,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820936948] [2019-11-23 23:35:58,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:58,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:58,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974686606] [2019-11-23 23:35:58,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:35:58,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:58,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:35:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:58,348 INFO L87 Difference]: Start difference. First operand 88520 states and 111774 transitions. Second operand 5 states. [2019-11-23 23:36:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:01,030 INFO L93 Difference]: Finished difference Result 329769 states and 415621 transitions. [2019-11-23 23:36:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:36:01,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 357 [2019-11-23 23:36:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:01,368 INFO L225 Difference]: With dead ends: 329769 [2019-11-23 23:36:01,368 INFO L226 Difference]: Without dead ends: 241250 [2019-11-23 23:36:01,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241250 states. [2019-11-23 23:36:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241250 to 232378. [2019-11-23 23:36:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232378 states. [2019-11-23 23:36:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232378 states to 232378 states and 291055 transitions. [2019-11-23 23:36:06,105 INFO L78 Accepts]: Start accepts. Automaton has 232378 states and 291055 transitions. Word has length 357 [2019-11-23 23:36:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:06,105 INFO L462 AbstractCegarLoop]: Abstraction has 232378 states and 291055 transitions. [2019-11-23 23:36:06,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:36:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 232378 states and 291055 transitions. [2019-11-23 23:36:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-23 23:36:06,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:06,175 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:06,176 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:06,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:06,176 INFO L82 PathProgramCache]: Analyzing trace with hash -911197664, now seen corresponding path program 1 times [2019-11-23 23:36:06,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:06,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438221286] [2019-11-23 23:36:06,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-23 23:36:06,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438221286] [2019-11-23 23:36:06,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:06,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:06,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413080410] [2019-11-23 23:36:06,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:06,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:06,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:07,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:07,002 INFO L87 Difference]: Start difference. First operand 232378 states and 291055 transitions. Second operand 4 states. [2019-11-23 23:36:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:09,231 INFO L93 Difference]: Finished difference Result 495071 states and 622196 transitions. [2019-11-23 23:36:09,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:09,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2019-11-23 23:36:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:09,490 INFO L225 Difference]: With dead ends: 495071 [2019-11-23 23:36:09,490 INFO L226 Difference]: Without dead ends: 262694 [2019-11-23 23:36:09,605 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:36:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262694 states. [2019-11-23 23:36:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262694 to 262694. [2019-11-23 23:36:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262694 states. [2019-11-23 23:36:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262694 states to 262694 states and 317767 transitions. [2019-11-23 23:36:16,678 INFO L78 Accepts]: Start accepts. Automaton has 262694 states and 317767 transitions. Word has length 370 [2019-11-23 23:36:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:16,678 INFO L462 AbstractCegarLoop]: Abstraction has 262694 states and 317767 transitions. [2019-11-23 23:36:16,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 262694 states and 317767 transitions. [2019-11-23 23:36:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-11-23 23:36:16,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:16,728 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:16,728 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash -595459671, now seen corresponding path program 1 times [2019-11-23 23:36:16,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:16,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880515783] [2019-11-23 23:36:16,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-11-23 23:36:16,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880515783] [2019-11-23 23:36:16,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:16,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:16,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929044668] [2019-11-23 23:36:16,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:16,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:16,949 INFO L87 Difference]: Start difference. First operand 262694 states and 317767 transitions. Second operand 4 states. [2019-11-23 23:36:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:19,909 INFO L93 Difference]: Finished difference Result 572148 states and 694370 transitions. [2019-11-23 23:36:19,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:19,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 445 [2019-11-23 23:36:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:20,225 INFO L225 Difference]: With dead ends: 572148 [2019-11-23 23:36:20,225 INFO L226 Difference]: Without dead ends: 309455 [2019-11-23 23:36:20,351 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:36:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309455 states. [2019-11-23 23:36:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309455 to 273419. [2019-11-23 23:36:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273419 states. [2019-11-23 23:36:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273419 states to 273419 states and 331662 transitions. [2019-11-23 23:36:28,647 INFO L78 Accepts]: Start accepts. Automaton has 273419 states and 331662 transitions. Word has length 445 [2019-11-23 23:36:28,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:28,647 INFO L462 AbstractCegarLoop]: Abstraction has 273419 states and 331662 transitions. [2019-11-23 23:36:28,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 273419 states and 331662 transitions. [2019-11-23 23:36:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-11-23 23:36:28,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:28,699 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:36:28,699 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:28,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2065909286, now seen corresponding path program 1 times [2019-11-23 23:36:28,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:28,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823136744] [2019-11-23 23:36:28,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-11-23 23:36:29,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823136744] [2019-11-23 23:36:29,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:29,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:29,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372116879] [2019-11-23 23:36:29,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:29,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:29,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:29,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:29,005 INFO L87 Difference]: Start difference. First operand 273419 states and 331662 transitions. Second operand 4 states.