/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/Problem01_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:52,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:52,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:52,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:52,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:52,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:52,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:52,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:52,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:52,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:52,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:52,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:52,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:52,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:52,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:52,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:52,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:52,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:52,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:52,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:52,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:52,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:52,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:52,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:52,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:52,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:52,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:52,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:52,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:52,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:52,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:52,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:52,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:52,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:52,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:52,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:52,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:52,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:52,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:52,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:52,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:52,966 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:30:52,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:52,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:52,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:52,983 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:52,983 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:52,983 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:52,983 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:52,983 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:52,983 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:52,984 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:52,984 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:52,984 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:52,984 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:52,984 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:52,985 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:52,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:52,986 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:52,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:52,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:52,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:52,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:52,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:52,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:52,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:52,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:52,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:52,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:52,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:52,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:52,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:52,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:52,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:52,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:52,989 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:52,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:52,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:52,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:52,989 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:53,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:53,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:53,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:53,314 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:53,314 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:53,315 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29.c [2019-11-23 23:30:53,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bdc51b1e/1bdfb85648cb4544b915881e26d2089f/FLAG81f176df6 [2019-11-23 23:30:53,956 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:53,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label29.c [2019-11-23 23:30:53,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bdc51b1e/1bdfb85648cb4544b915881e26d2089f/FLAG81f176df6 [2019-11-23 23:30:54,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bdc51b1e/1bdfb85648cb4544b915881e26d2089f [2019-11-23 23:30:54,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:54,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:54,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:54,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:54,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:54,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d586000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54, skipping insertion in model container [2019-11-23 23:30:54,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:54,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:54,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:54,950 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:55,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:55,096 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:55,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55 WrapperNode [2019-11-23 23:30:55,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:55,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:55,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:55,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:55,106 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:30:55" (1/1) ... [2019-11-23 23:30:55,124 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:30:55" (1/1) ... [2019-11-23 23:30:55,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:55,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:55,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:55,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:55,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:55,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:55,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:55,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:55,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (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:30:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:55,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:57,235 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:57,236 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:57,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:57 BoogieIcfgContainer [2019-11-23 23:30:57,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:57,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:57,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:57,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:57,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:54" (1/3) ... [2019-11-23 23:30:57,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e463c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:57, skipping insertion in model container [2019-11-23 23:30:57,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (2/3) ... [2019-11-23 23:30:57,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e463c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:57, skipping insertion in model container [2019-11-23 23:30:57,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:57" (3/3) ... [2019-11-23 23:30:57,245 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label29.c [2019-11-23 23:30:57,255 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:57,262 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:57,274 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:57,300 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:57,300 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:57,300 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:57,300 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:57,300 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:57,301 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:57,301 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:57,301 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:57,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:57,328 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] [2019-11-23 23:30:57,329 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:57,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:57,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1323242271, now seen corresponding path program 1 times [2019-11-23 23:30:57,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:57,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342013290] [2019-11-23 23:30:57,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:57,835 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:30:57,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342013290] [2019-11-23 23:30:57,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:57,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:57,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386802071] [2019-11-23 23:30:57,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:57,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:57,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:57,864 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:58,652 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:58,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:58,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:58,669 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:58,670 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:58,673 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:30:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:30:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:30:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 372 transitions. [2019-11-23 23:30:58,739 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 372 transitions. Word has length 71 [2019-11-23 23:30:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:58,740 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 372 transitions. [2019-11-23 23:30:58,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 372 transitions. [2019-11-23 23:30:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:30:58,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:58,745 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] [2019-11-23 23:30:58,745 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:58,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2123299564, now seen corresponding path program 1 times [2019-11-23 23:30:58,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:58,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562265554] [2019-11-23 23:30:58,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:58,865 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:30:58,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562265554] [2019-11-23 23:30:58,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:58,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:58,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804526606] [2019-11-23 23:30:58,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:58,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:58,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:58,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:58,870 INFO L87 Difference]: Start difference. First operand 216 states and 372 transitions. Second operand 4 states. [2019-11-23 23:30:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:59,484 INFO L93 Difference]: Finished difference Result 786 states and 1358 transitions. [2019-11-23 23:30:59,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:59,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-23 23:30:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:59,490 INFO L225 Difference]: With dead ends: 786 [2019-11-23 23:30:59,491 INFO L226 Difference]: Without dead ends: 571 [2019-11-23 23:30:59,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:30:59,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-23 23:30:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 358. [2019-11-23 23:30:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-23 23:30:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2019-11-23 23:30:59,565 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 78 [2019-11-23 23:30:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:59,566 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2019-11-23 23:30:59,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2019-11-23 23:30:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-23 23:30:59,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:59,576 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:30:59,576 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1800587057, now seen corresponding path program 1 times [2019-11-23 23:30:59,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:59,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987805738] [2019-11-23 23:30:59,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:59,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987805738] [2019-11-23 23:30:59,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:59,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:59,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886697375] [2019-11-23 23:30:59,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:59,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:59,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:59,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:59,703 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2019-11-23 23:31:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:00,247 INFO L93 Difference]: Finished difference Result 857 states and 1277 transitions. [2019-11-23 23:31:00,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:00,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-23 23:31:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:00,252 INFO L225 Difference]: With dead ends: 857 [2019-11-23 23:31:00,253 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:31:00,255 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:31:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:31:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:31:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:31:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2019-11-23 23:31:00,273 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 92 [2019-11-23 23:31:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:00,273 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2019-11-23 23:31:00,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2019-11-23 23:31:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:31:00,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:00,277 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:00,278 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1032091212, now seen corresponding path program 1 times [2019-11-23 23:31:00,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:00,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466759079] [2019-11-23 23:31:00,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:00,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466759079] [2019-11-23 23:31:00,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:00,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:00,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20593358] [2019-11-23 23:31:00,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:00,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:00,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:00,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:00,341 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand 3 states. [2019-11-23 23:31:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:00,774 INFO L93 Difference]: Finished difference Result 1212 states and 1622 transitions. [2019-11-23 23:31:00,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:00,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 23:31:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:00,780 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:31:00,781 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:31:00,782 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:31:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:31:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-23 23:31:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:31:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 832 transitions. [2019-11-23 23:31:00,842 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 832 transitions. Word has length 93 [2019-11-23 23:31:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:00,842 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 832 transitions. [2019-11-23 23:31:00,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 832 transitions. [2019-11-23 23:31:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:31:00,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:00,846 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 23:31:00,847 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash 143196804, now seen corresponding path program 1 times [2019-11-23 23:31:00,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:00,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798746247] [2019-11-23 23:31:00,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:31:00,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798746247] [2019-11-23 23:31:00,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:00,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:00,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13343458] [2019-11-23 23:31:00,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:00,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:00,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:00,913 INFO L87 Difference]: Start difference. First operand 642 states and 832 transitions. Second operand 3 states. [2019-11-23 23:31:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:01,288 INFO L93 Difference]: Finished difference Result 1709 states and 2231 transitions. [2019-11-23 23:31:01,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:01,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 23:31:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:01,294 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:31:01,295 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:31:01,296 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:31:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:31:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-23 23:31:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1120 transitions. [2019-11-23 23:31:01,323 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1120 transitions. Word has length 97 [2019-11-23 23:31:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:01,323 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1120 transitions. [2019-11-23 23:31:01,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1120 transitions. [2019-11-23 23:31:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:31:01,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:01,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:01,328 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:01,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:01,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1126554846, now seen corresponding path program 1 times [2019-11-23 23:31:01,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:01,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358208872] [2019-11-23 23:31:01,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:31:01,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358208872] [2019-11-23 23:31:01,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:01,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:01,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463993049] [2019-11-23 23:31:01,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:01,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:01,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:01,393 INFO L87 Difference]: Start difference. First operand 855 states and 1120 transitions. Second operand 3 states. [2019-11-23 23:31:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:01,678 INFO L93 Difference]: Finished difference Result 1780 states and 2331 transitions. [2019-11-23 23:31:01,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:01,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 23:31:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:01,684 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:31:01,684 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:31:01,686 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:31:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:31:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 855. [2019-11-23 23:31:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1120 transitions. [2019-11-23 23:31:01,708 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1120 transitions. Word has length 99 [2019-11-23 23:31:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:01,709 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1120 transitions. [2019-11-23 23:31:01,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1120 transitions. [2019-11-23 23:31:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 23:31:01,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:01,711 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:01,712 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:01,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:01,712 INFO L82 PathProgramCache]: Analyzing trace with hash 397471261, now seen corresponding path program 1 times [2019-11-23 23:31:01,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:01,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722700855] [2019-11-23 23:31:01,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:01,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722700855] [2019-11-23 23:31:01,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:01,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:01,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648065303] [2019-11-23 23:31:01,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:01,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:01,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:01,799 INFO L87 Difference]: Start difference. First operand 855 states and 1120 transitions. Second operand 3 states. [2019-11-23 23:31:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:02,107 INFO L93 Difference]: Finished difference Result 1922 states and 2489 transitions. [2019-11-23 23:31:02,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:02,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 23:31:02,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:02,113 INFO L225 Difference]: With dead ends: 1922 [2019-11-23 23:31:02,113 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:31:02,115 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:31:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:31:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-23 23:31:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1283 transitions. [2019-11-23 23:31:02,139 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1283 transitions. Word has length 100 [2019-11-23 23:31:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:02,139 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1283 transitions. [2019-11-23 23:31:02,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1283 transitions. [2019-11-23 23:31:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 23:31:02,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:02,142 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:02,143 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2113450725, now seen corresponding path program 1 times [2019-11-23 23:31:02,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:02,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511443935] [2019-11-23 23:31:02,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:02,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511443935] [2019-11-23 23:31:02,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:02,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:31:02,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205251690] [2019-11-23 23:31:02,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:31:02,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:31:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:02,291 INFO L87 Difference]: Start difference. First operand 997 states and 1283 transitions. Second operand 8 states. [2019-11-23 23:31:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:03,038 INFO L93 Difference]: Finished difference Result 2106 states and 2697 transitions. [2019-11-23 23:31:03,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:31:03,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-11-23 23:31:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:03,045 INFO L225 Difference]: With dead ends: 2106 [2019-11-23 23:31:03,045 INFO L226 Difference]: Without dead ends: 1181 [2019-11-23 23:31:03,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-11-23 23:31:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 997. [2019-11-23 23:31:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1271 transitions. [2019-11-23 23:31:03,070 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1271 transitions. Word has length 104 [2019-11-23 23:31:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:03,070 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1271 transitions. [2019-11-23 23:31:03,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:31:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1271 transitions. [2019-11-23 23:31:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-23 23:31:03,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:03,073 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-23 23:31:03,074 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash 58783804, now seen corresponding path program 1 times [2019-11-23 23:31:03,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:03,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324058966] [2019-11-23 23:31:03,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-23 23:31:03,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324058966] [2019-11-23 23:31:03,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:03,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:03,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981235900] [2019-11-23 23:31:03,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:03,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:03,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:03,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:03,121 INFO L87 Difference]: Start difference. First operand 997 states and 1271 transitions. Second operand 3 states. [2019-11-23 23:31:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:03,396 INFO L93 Difference]: Finished difference Result 1993 states and 2539 transitions. [2019-11-23 23:31:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:03,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-23 23:31:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:03,401 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:31:03,401 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:31:03,403 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:31:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:31:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-23 23:31:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1158 transitions. [2019-11-23 23:31:03,424 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1158 transitions. Word has length 127 [2019-11-23 23:31:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:03,424 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1158 transitions. [2019-11-23 23:31:03,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1158 transitions. [2019-11-23 23:31:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-23 23:31:03,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:03,427 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:03,427 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:03,428 INFO L82 PathProgramCache]: Analyzing trace with hash -681224459, now seen corresponding path program 1 times [2019-11-23 23:31:03,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:03,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016991002] [2019-11-23 23:31:03,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:04,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016991002] [2019-11-23 23:31:04,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:04,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 23:31:04,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297760877] [2019-11-23 23:31:04,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 23:31:04,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:04,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 23:31:04,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-23 23:31:04,296 INFO L87 Difference]: Start difference. First operand 997 states and 1158 transitions. Second operand 12 states. [2019-11-23 23:31:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:05,440 INFO L93 Difference]: Finished difference Result 2051 states and 2407 transitions. [2019-11-23 23:31:05,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 23:31:05,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-11-23 23:31:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:05,448 INFO L225 Difference]: With dead ends: 2051 [2019-11-23 23:31:05,448 INFO L226 Difference]: Without dead ends: 1126 [2019-11-23 23:31:05,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-23 23:31:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-11-23 23:31:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 984. [2019-11-23 23:31:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-23 23:31:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1135 transitions. [2019-11-23 23:31:05,475 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1135 transitions. Word has length 137 [2019-11-23 23:31:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:05,476 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1135 transitions. [2019-11-23 23:31:05,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 23:31:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1135 transitions. [2019-11-23 23:31:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 23:31:05,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:05,480 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-23 23:31:05,481 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1012111852, now seen corresponding path program 1 times [2019-11-23 23:31:05,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:05,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059956113] [2019-11-23 23:31:05,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-23 23:31:05,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059956113] [2019-11-23 23:31:05,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:05,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:05,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407861389] [2019-11-23 23:31:05,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:05,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:05,587 INFO L87 Difference]: Start difference. First operand 984 states and 1135 transitions. Second operand 3 states. [2019-11-23 23:31:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:05,846 INFO L93 Difference]: Finished difference Result 1967 states and 2269 transitions. [2019-11-23 23:31:05,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:05,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-23 23:31:05,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:05,852 INFO L225 Difference]: With dead ends: 1967 [2019-11-23 23:31:05,852 INFO L226 Difference]: Without dead ends: 984 [2019-11-23 23:31:05,854 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:31:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-11-23 23:31:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 913. [2019-11-23 23:31:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-11-23 23:31:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1041 transitions. [2019-11-23 23:31:05,875 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1041 transitions. Word has length 165 [2019-11-23 23:31:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:05,876 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1041 transitions. [2019-11-23 23:31:05,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1041 transitions. [2019-11-23 23:31:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-23 23:31:05,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:05,880 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2019-11-23 23:31:05,880 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:05,880 INFO L82 PathProgramCache]: Analyzing trace with hash -241783688, now seen corresponding path program 1 times [2019-11-23 23:31:05,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:05,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651806886] [2019-11-23 23:31:05,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-23 23:31:06,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651806886] [2019-11-23 23:31:06,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:06,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:31:06,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704008397] [2019-11-23 23:31:06,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:31:06,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:06,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:31:06,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:06,071 INFO L87 Difference]: Start difference. First operand 913 states and 1041 transitions. Second operand 6 states. [2019-11-23 23:31:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:06,468 INFO L93 Difference]: Finished difference Result 1922 states and 2203 transitions. [2019-11-23 23:31:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:06,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2019-11-23 23:31:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:06,473 INFO L225 Difference]: With dead ends: 1922 [2019-11-23 23:31:06,473 INFO L226 Difference]: Without dead ends: 1081 [2019-11-23 23:31:06,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-11-23 23:31:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1055. [2019-11-23 23:31:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-11-23 23:31:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1179 transitions. [2019-11-23 23:31:06,492 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1179 transitions. Word has length 209 [2019-11-23 23:31:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:06,493 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 1179 transitions. [2019-11-23 23:31:06,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:31:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1179 transitions. [2019-11-23 23:31:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-23 23:31:06,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:06,497 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 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:31:06,497 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:06,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1191094894, now seen corresponding path program 1 times [2019-11-23 23:31:06,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:06,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165309428] [2019-11-23 23:31:06,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-23 23:31:06,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165309428] [2019-11-23 23:31:06,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:06,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:06,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208979029] [2019-11-23 23:31:06,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:31:06,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:06,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:31:06,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:06,698 INFO L87 Difference]: Start difference. First operand 1055 states and 1179 transitions. Second operand 5 states. [2019-11-23 23:31:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:07,431 INFO L93 Difference]: Finished difference Result 2109 states and 2355 transitions. [2019-11-23 23:31:07,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:07,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-11-23 23:31:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:07,437 INFO L225 Difference]: With dead ends: 2109 [2019-11-23 23:31:07,438 INFO L226 Difference]: Without dead ends: 984 [2019-11-23 23:31:07,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 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:31:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-11-23 23:31:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2019-11-23 23:31:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-23 23:31:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1101 transitions. [2019-11-23 23:31:07,473 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1101 transitions. Word has length 232 [2019-11-23 23:31:07,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:07,473 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1101 transitions. [2019-11-23 23:31:07,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:31:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1101 transitions. [2019-11-23 23:31:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-23 23:31:07,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:07,483 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:07,483 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash 103089892, now seen corresponding path program 1 times [2019-11-23 23:31:07,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:07,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252836065] [2019-11-23 23:31:07,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-11-23 23:31:07,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252836065] [2019-11-23 23:31:07,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:07,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:07,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127422803] [2019-11-23 23:31:07,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:07,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:07,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:07,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:07,831 INFO L87 Difference]: Start difference. First operand 984 states and 1101 transitions. Second operand 4 states. [2019-11-23 23:31:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:08,201 INFO L93 Difference]: Finished difference Result 1965 states and 2208 transitions. [2019-11-23 23:31:08,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:08,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-23 23:31:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:08,202 INFO L225 Difference]: With dead ends: 1965 [2019-11-23 23:31:08,202 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:08,204 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:31:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:08,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2019-11-23 23:31:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:08,205 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:08,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:08,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:08,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:08,567 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-23 23:31:08,732 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-23 23:31:08,736 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:08,736 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:08,736 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:08,736 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:08,736 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:08,737 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:08,737 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:08,737 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:08,737 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:08,737 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:08,737 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:08,737 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:08,737 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:08,737 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:08,738 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:08,738 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:08,738 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:08,740 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a17~0 1)) (.cse6 (= ~a16~0 5)) (.cse3 (not (= 1 ~a7~0))) (.cse4 (= ~a12~0 8)) (.cse5 (<= ~a17~0 0)) (.cse8 (= ~a16~0 4)) (.cse0 (not (= 15 ~a8~0))) (.cse2 (= ~a21~0 1)) (.cse7 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse2) (and .cse4 .cse5 .cse2 .cse6) (and .cse0 .cse1 .cse7 .cse6) (and .cse0 .cse6 (not (= 13 ~a8~0))) (and .cse8 .cse4 .cse5 .cse2) (and .cse0 .cse5) (and .cse3 .cse4 .cse5 .cse2) (and .cse8 .cse0) (and .cse0 .cse2 .cse7))) [2019-11-23 23:31:08,740 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:08,741 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:08,741 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:08,741 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:08,743 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:08,743 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:08,743 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:08,743 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:08,743 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:08,743 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:08,744 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:08,744 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:08,744 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:08,744 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:08,744 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 23:31:08,744 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:08,744 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:08,744 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:08,744 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:08,745 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:08,745 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:08,745 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:08,745 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:08,745 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:08,745 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:08,745 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:08,746 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a17~0 1)) (.cse6 (= ~a16~0 5)) (.cse3 (not (= 1 ~a7~0))) (.cse4 (= ~a12~0 8)) (.cse5 (<= ~a17~0 0)) (.cse8 (= ~a16~0 4)) (.cse0 (not (= 15 ~a8~0))) (.cse2 (= ~a21~0 1)) (.cse7 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse2) (and .cse4 .cse5 .cse2 .cse6) (and .cse0 .cse1 .cse7 .cse6) (and .cse0 .cse6 (not (= 13 ~a8~0))) (and .cse8 .cse4 .cse5 .cse2) (and .cse0 .cse5) (and .cse3 .cse4 .cse5 .cse2) (and .cse8 .cse0) (and .cse0 .cse2 .cse7))) [2019-11-23 23:31:08,748 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:08,748 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:08,748 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:08,748 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:08,748 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:08,748 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:08,748 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:08,749 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:08,749 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:08,749 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:08,749 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:08,749 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:08,749 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:08,749 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:08,749 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:08,749 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:08,750 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:08,750 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:08,750 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:08,750 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:08,750 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:08,750 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:08,750 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:08,750 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2019-11-23 23:31:08,751 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:08,751 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:08,751 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:08,751 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:08,751 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:08,751 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:08,751 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:08,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:08 BoogieIcfgContainer [2019-11-23 23:31:08,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:08,807 INFO L168 Benchmark]: Toolchain (without parser) took 14530.00 ms. Allocated memory was 144.7 MB in the beginning and 445.1 MB in the end (delta: 300.4 MB). Free memory was 100.7 MB in the beginning and 285.4 MB in the end (delta: -184.8 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:08,808 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:08,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.29 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 162.9 MB in the end (delta: -62.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:08,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.41 ms. Allocated memory is still 202.4 MB. Free memory was 162.9 MB in the beginning and 157.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:08,813 INFO L168 Benchmark]: Boogie Preprocessor took 70.22 ms. Allocated memory is still 202.4 MB. Free memory was 157.3 MB in the beginning and 152.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:08,815 INFO L168 Benchmark]: RCFGBuilder took 1975.41 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 152.4 MB in the beginning and 201.3 MB in the end (delta: -48.9 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:08,818 INFO L168 Benchmark]: TraceAbstraction took 11567.29 ms. Allocated memory was 250.1 MB in the beginning and 445.1 MB in the end (delta: 195.0 MB). Free memory was 201.3 MB in the beginning and 285.4 MB in the end (delta: -84.1 MB). Peak memory consumption was 110.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:08,824 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.29 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 162.9 MB in the end (delta: -62.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.41 ms. Allocated memory is still 202.4 MB. Free memory was 162.9 MB in the beginning and 157.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.22 ms. Allocated memory is still 202.4 MB. Free memory was 157.3 MB in the beginning and 152.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1975.41 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 152.4 MB in the beginning and 201.3 MB in the end (delta: -48.9 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11567.29 ms. Allocated memory was 250.1 MB in the beginning and 445.1 MB in the end (delta: 195.0 MB). Free memory was 201.3 MB in the beginning and 285.4 MB in the end (delta: -84.1 MB). Peak memory consumption was 110.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((!(15 == a8) && a17 == 1) && a21 == 1) || (((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((!(15 == a8) && a17 == 1) && a20 == 1) && a16 == 5)) || ((!(15 == a8) && a16 == 5) && !(13 == a8))) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (!(15 == a8) && a17 <= 0)) || (((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1)) || (a16 == 4 && !(15 == a8))) || ((!(15 == a8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((!(15 == a8) && a17 == 1) && a21 == 1) || (((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((!(15 == a8) && a17 == 1) && a20 == 1) && a16 == 5)) || ((!(15 == a8) && a16 == 5) && !(13 == a8))) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (!(15 == a8) && a17 <= 0)) || (((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1)) || (a16 == 4 && !(15 == a8))) || ((!(15 == a8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 11.4s, OverallIterations: 14, TraceHistogramMax: 8, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 704 SDtfs, 1611 SDslu, 124 SDs, 0 SdLazy, 4837 SolverSat, 846 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1055occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1133 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 239 HoareAnnotationTreeSize, 3 FomulaSimplifications, 17585 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 256 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1847 NumberOfCodeBlocks, 1847 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1833 ConstructedInterpolants, 0 QuantifiedInterpolants, 933466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1734/1734 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...