/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_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:29:37,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:29:37,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:29:37,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:29:37,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:29:37,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:29:37,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:29:37,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:29:37,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:29:37,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:29:37,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:29:37,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:29:37,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:29:37,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:29:37,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:29:38,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:29:38,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:29:38,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:29:38,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:29:38,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:29:38,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:29:38,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:29:38,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:29:38,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:29:38,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:29:38,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:29:38,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:29:38,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:29:38,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:29:38,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:29:38,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:29:38,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:29:38,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:29:38,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:29:38,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:29:38,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:29:38,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:29:38,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:29:38,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:29:38,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:29:38,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:29:38,035 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:29:38,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:29:38,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:29:38,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:29:38,066 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:29:38,066 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:29:38,066 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:29:38,066 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:29:38,067 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:29:38,067 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:29:38,067 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:29:38,068 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:29:38,068 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:29:38,068 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:29:38,069 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:29:38,069 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:29:38,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:29:38,070 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:29:38,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:29:38,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:29:38,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:29:38,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:29:38,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:29:38,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:29:38,071 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:29:38,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:29:38,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:29:38,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:29:38,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:29:38,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:29:38,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:38,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:29:38,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:29:38,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:29:38,074 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:29:38,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:29:38,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:29:38,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:29:38,075 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:29:38,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:29:38,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:29:38,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:29:38,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:29:38,359 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:29:38,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06.c [2019-11-23 23:29:38,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175aa9a8b/ef5634610c4f4f4c8a043a6ae89ffa37/FLAGd58c3caf6 [2019-11-23 23:29:38,990 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:29:38,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label06.c [2019-11-23 23:29:39,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175aa9a8b/ef5634610c4f4f4c8a043a6ae89ffa37/FLAGd58c3caf6 [2019-11-23 23:29:39,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175aa9a8b/ef5634610c4f4f4c8a043a6ae89ffa37 [2019-11-23 23:29:39,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:29:39,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:29:39,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:39,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:29:39,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:29:39,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:39" (1/1) ... [2019-11-23 23:29:39,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577254a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:39, skipping insertion in model container [2019-11-23 23:29:39,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:39" (1/1) ... [2019-11-23 23:29:39,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:29:39,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:29:39,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:39,804 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:29:40,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:40,058 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:29:40,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40 WrapperNode [2019-11-23 23:29:40,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:40,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:40,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:29:40,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:29:40,068 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:29:40" (1/1) ... [2019-11-23 23:29:40,085 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:29:40" (1/1) ... [2019-11-23 23:29:40,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:40,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:29:40,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:29:40,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:29:40,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40" (1/1) ... [2019-11-23 23:29:40,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40" (1/1) ... [2019-11-23 23:29:40,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40" (1/1) ... [2019-11-23 23:29:40,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40" (1/1) ... [2019-11-23 23:29:40,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40" (1/1) ... [2019-11-23 23:29:40,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40" (1/1) ... [2019-11-23 23:29:40,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40" (1/1) ... [2019-11-23 23:29:40,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:29:40,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:29:40,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:29:40,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:29:40,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:29:40,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:29:42,398 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:29:42,398 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:29:42,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:42 BoogieIcfgContainer [2019-11-23 23:29:42,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:29:42,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:29:42,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:29:42,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:29:42,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:39" (1/3) ... [2019-11-23 23:29:42,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3274c937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:42, skipping insertion in model container [2019-11-23 23:29:42,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:40" (2/3) ... [2019-11-23 23:29:42,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3274c937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:42, skipping insertion in model container [2019-11-23 23:29:42,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:42" (3/3) ... [2019-11-23 23:29:42,411 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label06.c [2019-11-23 23:29:42,421 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:29:42,428 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:29:42,439 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:29:42,471 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:29:42,471 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:29:42,472 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:29:42,472 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:29:42,472 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:29:42,472 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:29:42,472 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:29:42,473 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:29:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:29:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:29:42,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:42,500 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:29:42,500 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:42,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -839555290, now seen corresponding path program 1 times [2019-11-23 23:29:42,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:42,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689818767] [2019-11-23 23:29:42,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:29:42,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689818767] [2019-11-23 23:29:42,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:42,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:42,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324186082] [2019-11-23 23:29:42,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:42,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:42,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:42,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:42,935 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:29:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:43,751 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:29:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:43,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:29:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:43,779 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:29:43,779 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:29:43,785 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:29:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:29:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:29:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:29:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:29:43,869 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:29:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:43,871 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:29:43,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:29:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:29:43,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:43,877 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:43,878 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1061916039, now seen corresponding path program 1 times [2019-11-23 23:29:43,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:43,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278037268] [2019-11-23 23:29:43,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:29:43,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278037268] [2019-11-23 23:29:43,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:43,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:43,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706413636] [2019-11-23 23:29:43,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:43,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:43,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:43,958 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:29:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:44,530 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:29:44,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:44,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:29:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:44,536 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:29:44,536 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:44,538 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:29:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:29:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-23 23:29:44,572 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-23 23:29:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:44,572 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-23 23:29:44,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-23 23:29:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:29:44,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:44,576 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:29:44,577 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1752162555, now seen corresponding path program 1 times [2019-11-23 23:29:44,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:44,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694833238] [2019-11-23 23:29:44,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:29:44,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694833238] [2019-11-23 23:29:44,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:44,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:44,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087058715] [2019-11-23 23:29:44,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:44,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:44,671 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 3 states. [2019-11-23 23:29:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:45,069 INFO L93 Difference]: Finished difference Result 1141 states and 1872 transitions. [2019-11-23 23:29:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:45,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-23 23:29:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:45,075 INFO L225 Difference]: With dead ends: 1141 [2019-11-23 23:29:45,075 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:29:45,078 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:29:45,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:29:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 571. [2019-11-23 23:29:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:29:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 847 transitions. [2019-11-23 23:29:45,106 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 847 transitions. Word has length 78 [2019-11-23 23:29:45,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:45,107 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 847 transitions. [2019-11-23 23:29:45,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 847 transitions. [2019-11-23 23:29:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 23:29:45,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:45,112 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:45,113 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:45,113 INFO L82 PathProgramCache]: Analyzing trace with hash 406859988, now seen corresponding path program 1 times [2019-11-23 23:29:45,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:45,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446937823] [2019-11-23 23:29:45,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:29:45,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446937823] [2019-11-23 23:29:45,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:45,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:45,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757668062] [2019-11-23 23:29:45,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:45,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:45,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:45,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:45,180 INFO L87 Difference]: Start difference. First operand 571 states and 847 transitions. Second operand 3 states. [2019-11-23 23:29:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:45,548 INFO L93 Difference]: Finished difference Result 1283 states and 1938 transitions. [2019-11-23 23:29:45,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:45,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 23:29:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:45,553 INFO L225 Difference]: With dead ends: 1283 [2019-11-23 23:29:45,554 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:29:45,557 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:29:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:29:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-23 23:29:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:29:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 961 transitions. [2019-11-23 23:29:45,607 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 961 transitions. Word has length 105 [2019-11-23 23:29:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:45,611 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 961 transitions. [2019-11-23 23:29:45,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 961 transitions. [2019-11-23 23:29:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-23 23:29:45,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:45,618 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, 2, 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] [2019-11-23 23:29:45,618 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:45,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:45,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1772108359, now seen corresponding path program 1 times [2019-11-23 23:29:45,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:45,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175786991] [2019-11-23 23:29:45,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:29:45,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175786991] [2019-11-23 23:29:45,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:45,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:45,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299399130] [2019-11-23 23:29:45,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:45,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:45,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:45,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:45,797 INFO L87 Difference]: Start difference. First operand 642 states and 961 transitions. Second operand 3 states. [2019-11-23 23:29:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:46,215 INFO L93 Difference]: Finished difference Result 1709 states and 2539 transitions. [2019-11-23 23:29:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:46,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-23 23:29:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:46,223 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:29:46,223 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:29:46,224 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:29:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:29:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-23 23:29:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1424 transitions. [2019-11-23 23:29:46,251 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1424 transitions. Word has length 129 [2019-11-23 23:29:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:46,251 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1424 transitions. [2019-11-23 23:29:46,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1424 transitions. [2019-11-23 23:29:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 23:29:46,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:46,255 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:29:46,255 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:46,256 INFO L82 PathProgramCache]: Analyzing trace with hash -473524474, now seen corresponding path program 1 times [2019-11-23 23:29:46,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:46,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25592087] [2019-11-23 23:29:46,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-23 23:29:46,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25592087] [2019-11-23 23:29:46,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:46,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:46,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118543409] [2019-11-23 23:29:46,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:46,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:46,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:46,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:46,332 INFO L87 Difference]: Start difference. First operand 997 states and 1424 transitions. Second operand 3 states. [2019-11-23 23:29:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:46,655 INFO L93 Difference]: Finished difference Result 2064 states and 2930 transitions. [2019-11-23 23:29:46,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:46,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-23 23:29:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:46,660 INFO L225 Difference]: With dead ends: 2064 [2019-11-23 23:29:46,661 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:29:46,662 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:29:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:29:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-23 23:29:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:29:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1234 transitions. [2019-11-23 23:29:46,685 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1234 transitions. Word has length 134 [2019-11-23 23:29:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:46,685 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1234 transitions. [2019-11-23 23:29:46,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1234 transitions. [2019-11-23 23:29:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-23 23:29:46,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:46,689 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:29:46,689 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash 985786610, now seen corresponding path program 1 times [2019-11-23 23:29:46,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:46,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355018724] [2019-11-23 23:29:46,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 23:29:46,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355018724] [2019-11-23 23:29:46,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:46,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:46,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859132466] [2019-11-23 23:29:46,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:46,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:46,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:46,828 INFO L87 Difference]: Start difference. First operand 855 states and 1234 transitions. Second operand 4 states. [2019-11-23 23:29:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:47,277 INFO L93 Difference]: Finished difference Result 1815 states and 2585 transitions. [2019-11-23 23:29:47,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:29:47,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-23 23:29:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:47,284 INFO L225 Difference]: With dead ends: 1815 [2019-11-23 23:29:47,284 INFO L226 Difference]: Without dead ends: 961 [2019-11-23 23:29:47,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:29:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-11-23 23:29:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 926. [2019-11-23 23:29:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:29:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1311 transitions. [2019-11-23 23:29:47,314 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1311 transitions. Word has length 142 [2019-11-23 23:29:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:47,314 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1311 transitions. [2019-11-23 23:29:47,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1311 transitions. [2019-11-23 23:29:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 23:29:47,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:47,317 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:47,318 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:47,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:47,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1551426758, now seen corresponding path program 1 times [2019-11-23 23:29:47,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:47,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133579790] [2019-11-23 23:29:47,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-23 23:29:47,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133579790] [2019-11-23 23:29:47,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:47,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:47,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282283784] [2019-11-23 23:29:47,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:47,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:47,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:47,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:47,381 INFO L87 Difference]: Start difference. First operand 926 states and 1311 transitions. Second operand 4 states. [2019-11-23 23:29:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:47,894 INFO L93 Difference]: Finished difference Result 1780 states and 2544 transitions. [2019-11-23 23:29:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:47,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-23 23:29:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:47,900 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:29:47,900 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:29:47,902 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:29:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:29:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-23 23:29:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:29:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1305 transitions. [2019-11-23 23:29:47,927 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1305 transitions. Word has length 146 [2019-11-23 23:29:47,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:47,927 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1305 transitions. [2019-11-23 23:29:47,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1305 transitions. [2019-11-23 23:29:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:29:47,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:47,932 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-11-23 23:29:47,932 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1130227943, now seen corresponding path program 1 times [2019-11-23 23:29:47,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:47,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304091125] [2019-11-23 23:29:47,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:29:48,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304091125] [2019-11-23 23:29:48,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:48,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:29:48,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649490024] [2019-11-23 23:29:48,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:29:48,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:48,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:29:48,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:48,187 INFO L87 Difference]: Start difference. First operand 926 states and 1305 transitions. Second operand 8 states. [2019-11-23 23:29:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:48,935 INFO L93 Difference]: Finished difference Result 1961 states and 2743 transitions. [2019-11-23 23:29:48,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:29:48,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-11-23 23:29:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:48,940 INFO L225 Difference]: With dead ends: 1961 [2019-11-23 23:29:48,941 INFO L226 Difference]: Without dead ends: 1107 [2019-11-23 23:29:48,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-11-23 23:29:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 997. [2019-11-23 23:29:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1376 transitions. [2019-11-23 23:29:48,972 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1376 transitions. Word has length 158 [2019-11-23 23:29:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:48,973 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1376 transitions. [2019-11-23 23:29:48,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:29:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1376 transitions. [2019-11-23 23:29:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 23:29:48,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:48,976 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:48,977 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:48,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:48,977 INFO L82 PathProgramCache]: Analyzing trace with hash -397128022, now seen corresponding path program 1 times [2019-11-23 23:29:48,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:48,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333393136] [2019-11-23 23:29:48,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:29:49,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333393136] [2019-11-23 23:29:49,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:49,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:49,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191269403] [2019-11-23 23:29:49,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:49,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:49,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:49,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:49,098 INFO L87 Difference]: Start difference. First operand 997 states and 1376 transitions. Second operand 4 states. [2019-11-23 23:29:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:49,649 INFO L93 Difference]: Finished difference Result 2348 states and 3226 transitions. [2019-11-23 23:29:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:49,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-23 23:29:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:49,663 INFO L225 Difference]: With dead ends: 2348 [2019-11-23 23:29:49,664 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:29:49,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:29:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:29:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-23 23:29:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1145 transitions. [2019-11-23 23:29:49,692 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1145 transitions. Word has length 161 [2019-11-23 23:29:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:49,692 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1145 transitions. [2019-11-23 23:29:49,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1145 transitions. [2019-11-23 23:29:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 23:29:49,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:49,697 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:29:49,697 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1210202600, now seen corresponding path program 1 times [2019-11-23 23:29:49,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:49,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033699818] [2019-11-23 23:29:49,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-23 23:29:49,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033699818] [2019-11-23 23:29:49,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590119044] [2019-11-23 23:29:49,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:50,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:29:50,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:29:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-23 23:29:50,239 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:29:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-23 23:29:50,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:29:50,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 5 [2019-11-23 23:29:50,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292547947] [2019-11-23 23:29:50,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:50,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:50,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:50,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:29:50,362 INFO L87 Difference]: Start difference. First operand 997 states and 1145 transitions. Second operand 3 states. [2019-11-23 23:29:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:50,616 INFO L93 Difference]: Finished difference Result 1709 states and 1965 transitions. [2019-11-23 23:29:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:50,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 23:29:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:50,623 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:29:50,623 INFO L226 Difference]: Without dead ends: 1707 [2019-11-23 23:29:50,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:29:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-23 23:29:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1565. [2019-11-23 23:29:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2019-11-23 23:29:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1819 transitions. [2019-11-23 23:29:50,660 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1819 transitions. Word has length 175 [2019-11-23 23:29:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:50,661 INFO L462 AbstractCegarLoop]: Abstraction has 1565 states and 1819 transitions. [2019-11-23 23:29:50,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1819 transitions. [2019-11-23 23:29:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-23 23:29:50,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:50,665 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:50,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:50,871 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:50,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:50,871 INFO L82 PathProgramCache]: Analyzing trace with hash 964514437, now seen corresponding path program 1 times [2019-11-23 23:29:50,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:50,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858558275] [2019-11-23 23:29:50,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 23:29:51,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858558275] [2019-11-23 23:29:51,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507643132] [2019-11-23 23:29:51,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:51,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:29:51,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:29:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-23 23:29:51,277 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:29:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-23 23:29:51,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:29:51,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:29:51,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729330589] [2019-11-23 23:29:51,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:51,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:51,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:51,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:51,321 INFO L87 Difference]: Start difference. First operand 1565 states and 1819 transitions. Second operand 3 states. [2019-11-23 23:29:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:51,556 INFO L93 Difference]: Finished difference Result 1567 states and 1820 transitions. [2019-11-23 23:29:51,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:51,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-23 23:29:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:51,562 INFO L225 Difference]: With dead ends: 1567 [2019-11-23 23:29:51,563 INFO L226 Difference]: Without dead ends: 1565 [2019-11-23 23:29:51,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 386 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-11-23 23:29:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1494. [2019-11-23 23:29:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-11-23 23:29:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1731 transitions. [2019-11-23 23:29:51,594 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1731 transitions. Word has length 193 [2019-11-23 23:29:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:51,594 INFO L462 AbstractCegarLoop]: Abstraction has 1494 states and 1731 transitions. [2019-11-23 23:29:51,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1731 transitions. [2019-11-23 23:29:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-23 23:29:51,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:51,599 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:29:51,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:51,804 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:51,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1019212946, now seen corresponding path program 1 times [2019-11-23 23:29:51,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:51,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109075803] [2019-11-23 23:29:51,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 215 proven. 27 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-23 23:29:51,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109075803] [2019-11-23 23:29:51,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321425836] [2019-11-23 23:29:51,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:52,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:29:52,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:29:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-23 23:29:52,220 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:29:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-23 23:29:52,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:29:52,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:29:52,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722073569] [2019-11-23 23:29:52,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:52,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:52,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:52,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:52,361 INFO L87 Difference]: Start difference. First operand 1494 states and 1731 transitions. Second operand 3 states. [2019-11-23 23:29:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:52,628 INFO L93 Difference]: Finished difference Result 2488 states and 2891 transitions. [2019-11-23 23:29:52,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:52,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-23 23:29:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:52,630 INFO L225 Difference]: With dead ends: 2488 [2019-11-23 23:29:52,630 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:29:52,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 435 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:29:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:29:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:29:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:29:52,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2019-11-23 23:29:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:52,634 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:29:52,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:29:52,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:29:52,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:52,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:29:52,955 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2019-11-23 23:29:53,063 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 82 [2019-11-23 23:29:53,321 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2019-11-23 23:29:53,799 WARN L192 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2019-11-23 23:29:53,803 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:29:53,803 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:29:53,803 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:29:53,803 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:29:53,803 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:29:53,803 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:29:53,803 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:29:53,804 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:29:53,804 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:29:53,804 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:29:53,804 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:29:53,804 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:29:53,804 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:29:53,804 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:29:53,804 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:29:53,804 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:29:53,805 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:29:53,805 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse8 (= 13 ~a8~0))) (let ((.cse1 (<= ~a7~0 0)) (.cse5 (not (= 15 ~a8~0))) (.cse0 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse4 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6))) (.cse6 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1) (and .cse4 .cse3 .cse0 .cse2) (and .cse5 .cse6 .cse0) (and .cse3 .cse5 .cse0 .cse2) (and .cse4 (let ((.cse7 (<= ~a21~0 0))) (or (and .cse7 .cse8 .cse3 (= ~a17~0 1)) (and .cse7 .cse8 .cse6))))))) [2019-11-23 23:29:53,805 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:29:53,805 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:29:53,805 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:29:53,806 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:29:53,806 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:29:53,806 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:29:53,807 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:29:53,807 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:29:53,807 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:29:53,807 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:53,807 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:29:53,807 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:29:53,807 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:29:53,808 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:29:53,808 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:53,808 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:29:53,808 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:29:53,808 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:29:53,808 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 23:29:53,808 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:29:53,808 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:29:53,809 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:29:53,809 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:29:53,809 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:29:53,809 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:29:53,809 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:29:53,809 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (= 13 ~a8~0))) (let ((.cse1 (<= ~a7~0 0)) (.cse5 (not (= 15 ~a8~0))) (.cse0 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse4 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6))) (.cse6 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1) (and .cse4 .cse3 .cse0 .cse2) (and .cse5 .cse6 .cse0) (and .cse3 .cse5 .cse0 .cse2) (and .cse4 (let ((.cse7 (<= ~a21~0 0))) (or (and .cse7 .cse8 .cse3 (= ~a17~0 1)) (and .cse7 .cse8 .cse6))))))) [2019-11-23 23:29:53,809 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:29:53,810 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:29:53,810 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:29:53,810 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:29:53,810 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:29:53,810 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:29:53,810 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:29:53,810 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:29:53,810 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:29:53,811 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:29:53,811 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:29:53,811 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:29:53,811 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:29:53,811 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:29:53,811 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:29:53,811 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:29:53,811 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:29:53,811 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:29:53,812 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:29:53,812 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:29:53,812 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:29:53,812 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:29:53,812 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:29:53,812 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-23 23:29:53,812 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:29:53,812 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:29:53,813 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:29:53,813 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:29:53,813 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:29:53,813 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:29:53,813 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:29:53,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:53 BoogieIcfgContainer [2019-11-23 23:29:53,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:29:53,835 INFO L168 Benchmark]: Toolchain (without parser) took 14568.78 ms. Allocated memory was 136.8 MB in the beginning and 458.2 MB in the end (delta: 321.4 MB). Free memory was 100.4 MB in the beginning and 189.2 MB in the end (delta: -88.8 MB). Peak memory consumption was 232.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:53,835 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.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:29:53,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.50 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 100.2 MB in the beginning and 169.9 MB in the end (delta: -69.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:53,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.24 ms. Allocated memory is still 203.4 MB. Free memory was 169.9 MB in the beginning and 164.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:53,838 INFO L168 Benchmark]: Boogie Preprocessor took 102.97 ms. Allocated memory is still 203.4 MB. Free memory was 164.1 MB in the beginning and 158.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:53,838 INFO L168 Benchmark]: RCFGBuilder took 2145.37 ms. Allocated memory was 203.4 MB in the beginning and 255.3 MB in the end (delta: 51.9 MB). Free memory was 158.9 MB in the beginning and 213.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:53,839 INFO L168 Benchmark]: TraceAbstraction took 11428.90 ms. Allocated memory was 255.3 MB in the beginning and 458.2 MB in the end (delta: 202.9 MB). Free memory was 213.7 MB in the beginning and 189.2 MB in the end (delta: 24.5 MB). Peak memory consumption was 227.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:53,843 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.28 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.50 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 100.2 MB in the beginning and 169.9 MB in the end (delta: -69.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.24 ms. Allocated memory is still 203.4 MB. Free memory was 169.9 MB in the beginning and 164.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.97 ms. Allocated memory is still 203.4 MB. Free memory was 164.1 MB in the beginning and 158.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2145.37 ms. Allocated memory was 203.4 MB in the beginning and 255.3 MB in the end (delta: 51.9 MB). Free memory was 158.9 MB in the beginning and 213.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11428.90 ms. Allocated memory was 255.3 MB in the beginning and 458.2 MB in the end (delta: 202.9 MB). Free memory was 213.7 MB in the beginning and 189.2 MB in the end (delta: 24.5 MB). Peak memory consumption was 227.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: ((((((a21 == 1 && a7 <= 0) && !(13 == a8)) || ((!(a16 == 6) && a21 == 1) && a7 <= 0)) || (((1 == a7 && !(a16 == 6)) && a21 == 1) && !(13 == a8))) || ((!(15 == a8) && a20 == 1) && a21 == 1)) || (((!(a16 == 6) && !(15 == a8)) && a21 == 1) && !(13 == a8))) || (1 == a7 && ((((a21 <= 0 && 13 == a8) && !(a16 == 6)) && a17 == 1) || ((a21 <= 0 && 13 == a8) && a20 == 1))) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((a21 == 1 && a7 <= 0) && !(13 == a8)) || ((!(a16 == 6) && a21 == 1) && a7 <= 0)) || (((1 == a7 && !(a16 == 6)) && a21 == 1) && !(13 == a8))) || ((!(15 == a8) && a20 == 1) && a21 == 1)) || (((!(a16 == 6) && !(15 == a8)) && a21 == 1) && !(13 == a8))) || (1 == a7 && ((((a21 <= 0 && 13 == a8) && !(a16 == 6)) && a17 == 1) || ((a21 <= 0 && 13 == a8) && a20 == 1))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 11.3s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 661 SDtfs, 1392 SDslu, 90 SDs, 0 SdLazy, 3703 SolverSat, 952 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1222 GetRequests, 1180 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1565occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 997 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 189 HoareAnnotationTreeSize, 3 FomulaSimplifications, 12995 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1688 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2373 NumberOfCodeBlocks, 2373 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2940 ConstructedInterpolants, 0 QuantifiedInterpolants, 1192541 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1266 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 2760/2861 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...