/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/Problem02_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:33:26,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:33:26,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:33:26,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:33:26,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:33:26,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:33:26,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:33:26,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:33:26,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:33:26,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:33:26,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:33:26,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:33:26,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:33:26,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:33:26,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:33:26,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:33:26,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:33:26,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:33:26,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:33:26,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:33:26,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:33:26,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:33:26,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:33:26,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:33:26,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:33:26,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:33:26,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:33:26,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:33:26,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:33:26,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:33:26,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:33:26,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:33:26,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:33:26,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:33:26,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:33:26,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:33:26,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:33:26,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:33:26,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:33:26,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:33:26,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:33:26,396 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:33:26,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:33:26,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:33:26,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:33:26,436 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:33:26,438 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:33:26,439 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:33:26,439 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:33:26,439 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:33:26,439 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:33:26,439 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:33:26,440 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:33:26,441 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:33:26,441 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:33:26,441 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:33:26,441 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:33:26,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:33:26,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:33:26,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:33:26,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:33:26,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:33:26,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:33:26,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:33:26,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:33:26,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:33:26,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:33:26,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:33:26,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:33:26,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:33:26,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:33:26,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:33:26,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:33:26,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:33:26,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:33:26,451 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:33:26,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:33:26,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:33:26,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:33:26,451 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:33:26,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:33:26,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:33:26,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:33:26,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:33:26,805 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:33:26,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label53.c [2019-11-23 23:33:26,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d970bbc/3a896c05ee7e45fbb6f2a6664d831ae6/FLAGd487ab599 [2019-11-23 23:33:27,468 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:33:27,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label53.c [2019-11-23 23:33:27,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d970bbc/3a896c05ee7e45fbb6f2a6664d831ae6/FLAGd487ab599 [2019-11-23 23:33:27,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d970bbc/3a896c05ee7e45fbb6f2a6664d831ae6 [2019-11-23 23:33:27,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:33:27,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:33:27,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:27,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:33:27,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:33:27,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:27" (1/1) ... [2019-11-23 23:33:27,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cddf010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27, skipping insertion in model container [2019-11-23 23:33:27,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:27" (1/1) ... [2019-11-23 23:33:27,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:33:27,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:33:28,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:28,309 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:33:28,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:28,496 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:33:28,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28 WrapperNode [2019-11-23 23:33:28,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:28,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:28,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:33:28,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:33:28,505 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:33:28" (1/1) ... [2019-11-23 23:33:28,528 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:33:28" (1/1) ... [2019-11-23 23:33:28,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:28,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:33:28,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:33:28,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:33:28,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28" (1/1) ... [2019-11-23 23:33:28,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28" (1/1) ... [2019-11-23 23:33:28,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28" (1/1) ... [2019-11-23 23:33:28,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28" (1/1) ... [2019-11-23 23:33:28,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28" (1/1) ... [2019-11-23 23:33:28,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28" (1/1) ... [2019-11-23 23:33:28,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28" (1/1) ... [2019-11-23 23:33:28,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:33:28,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:33:28,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:33:28,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:33:28,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28" (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:33:28,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:33:28,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:33:30,894 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:33:30,894 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:33:30,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:30 BoogieIcfgContainer [2019-11-23 23:33:30,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:33:30,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:33:30,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:33:30,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:33:30,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:27" (1/3) ... [2019-11-23 23:33:30,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6626424b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:30, skipping insertion in model container [2019-11-23 23:33:30,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:28" (2/3) ... [2019-11-23 23:33:30,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6626424b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:30, skipping insertion in model container [2019-11-23 23:33:30,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:30" (3/3) ... [2019-11-23 23:33:30,907 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label53.c [2019-11-23 23:33:30,917 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:33:30,925 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:33:30,937 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:33:30,969 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:33:30,969 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:33:30,969 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:33:30,969 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:33:30,969 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:33:30,970 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:33:30,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:33:30,970 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:33:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:33:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:33:31,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:31,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:31,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:31,012 INFO L82 PathProgramCache]: Analyzing trace with hash 925963023, now seen corresponding path program 1 times [2019-11-23 23:33:31,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:31,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440538793] [2019-11-23 23:33:31,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:31,398 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:33:31,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440538793] [2019-11-23 23:33:31,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:31,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:31,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946416181] [2019-11-23 23:33:31,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:31,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:31,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:31,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:31,424 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2019-11-23 23:33:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:32,029 INFO L93 Difference]: Finished difference Result 251 states and 482 transitions. [2019-11-23 23:33:32,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:32,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-23 23:33:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:32,050 INFO L225 Difference]: With dead ends: 251 [2019-11-23 23:33:32,050 INFO L226 Difference]: Without dead ends: 163 [2019-11-23 23:33:32,054 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:33:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-23 23:33:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-11-23 23:33:32,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-23 23:33:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 288 transitions. [2019-11-23 23:33:32,132 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 288 transitions. Word has length 80 [2019-11-23 23:33:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:32,132 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 288 transitions. [2019-11-23 23:33:32,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 288 transitions. [2019-11-23 23:33:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:33:32,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:32,137 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:32,138 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash 221763502, now seen corresponding path program 1 times [2019-11-23 23:33:32,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:32,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480101248] [2019-11-23 23:33:32,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:32,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480101248] [2019-11-23 23:33:32,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:32,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:32,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230314669] [2019-11-23 23:33:32,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:32,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:32,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:32,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:32,241 INFO L87 Difference]: Start difference. First operand 163 states and 288 transitions. Second operand 4 states. [2019-11-23 23:33:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:32,857 INFO L93 Difference]: Finished difference Result 645 states and 1147 transitions. [2019-11-23 23:33:32,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:32,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:33:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:32,863 INFO L225 Difference]: With dead ends: 645 [2019-11-23 23:33:32,863 INFO L226 Difference]: Without dead ends: 483 [2019-11-23 23:33:32,865 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:33:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-23 23:33:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 323. [2019-11-23 23:33:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 23:33:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 548 transitions. [2019-11-23 23:33:32,890 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 548 transitions. Word has length 98 [2019-11-23 23:33:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:32,891 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 548 transitions. [2019-11-23 23:33:32,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 548 transitions. [2019-11-23 23:33:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-23 23:33:32,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:32,897 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:32,897 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash -450003061, now seen corresponding path program 1 times [2019-11-23 23:33:32,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:32,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561710333] [2019-11-23 23:33:32,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:33,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561710333] [2019-11-23 23:33:33,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:33,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:33,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796568747] [2019-11-23 23:33:33,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:33,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:33,041 INFO L87 Difference]: Start difference. First operand 323 states and 548 transitions. Second operand 4 states. [2019-11-23 23:33:33,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:33,751 INFO L93 Difference]: Finished difference Result 1285 states and 2187 transitions. [2019-11-23 23:33:33,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:33,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-23 23:33:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:33,758 INFO L225 Difference]: With dead ends: 1285 [2019-11-23 23:33:33,758 INFO L226 Difference]: Without dead ends: 963 [2019-11-23 23:33:33,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:33,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-23 23:33:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 803. [2019-11-23 23:33:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-23 23:33:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1249 transitions. [2019-11-23 23:33:33,800 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1249 transitions. Word has length 109 [2019-11-23 23:33:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:33,800 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1249 transitions. [2019-11-23 23:33:33,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1249 transitions. [2019-11-23 23:33:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-23 23:33:33,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:33,810 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:33,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash -400978491, now seen corresponding path program 1 times [2019-11-23 23:33:33,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:33,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389990577] [2019-11-23 23:33:33,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 23:33:33,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389990577] [2019-11-23 23:33:33,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:33,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:33,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725498587] [2019-11-23 23:33:33,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:33,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:33,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:33,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:33,910 INFO L87 Difference]: Start difference. First operand 803 states and 1249 transitions. Second operand 4 states. [2019-11-23 23:33:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:34,662 INFO L93 Difference]: Finished difference Result 2885 states and 4419 transitions. [2019-11-23 23:33:34,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:34,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-23 23:33:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:34,673 INFO L225 Difference]: With dead ends: 2885 [2019-11-23 23:33:34,673 INFO L226 Difference]: Without dead ends: 2083 [2019-11-23 23:33:34,675 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:33:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-11-23 23:33:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1283. [2019-11-23 23:33:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:33:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1858 transitions. [2019-11-23 23:33:34,716 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1858 transitions. Word has length 125 [2019-11-23 23:33:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:34,716 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1858 transitions. [2019-11-23 23:33:34,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1858 transitions. [2019-11-23 23:33:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 23:33:34,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:34,725 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:34,725 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:34,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:34,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1423409937, now seen corresponding path program 1 times [2019-11-23 23:33:34,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:34,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088786985] [2019-11-23 23:33:34,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-23 23:33:34,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088786985] [2019-11-23 23:33:34,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:34,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:34,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573805090] [2019-11-23 23:33:34,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:34,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:34,803 INFO L87 Difference]: Start difference. First operand 1283 states and 1858 transitions. Second operand 3 states. [2019-11-23 23:33:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:35,236 INFO L93 Difference]: Finished difference Result 2805 states and 4060 transitions. [2019-11-23 23:33:35,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:35,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 23:33:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:35,244 INFO L225 Difference]: With dead ends: 2805 [2019-11-23 23:33:35,245 INFO L226 Difference]: Without dead ends: 1523 [2019-11-23 23:33:35,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-23 23:33:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1363. [2019-11-23 23:33:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-23 23:33:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1908 transitions. [2019-11-23 23:33:35,281 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1908 transitions. Word has length 133 [2019-11-23 23:33:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:35,281 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1908 transitions. [2019-11-23 23:33:35,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1908 transitions. [2019-11-23 23:33:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 23:33:35,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:35,285 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:33:35,286 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash 440377068, now seen corresponding path program 1 times [2019-11-23 23:33:35,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:35,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712536358] [2019-11-23 23:33:35,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 23:33:35,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712536358] [2019-11-23 23:33:35,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:35,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:33:35,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074837266] [2019-11-23 23:33:35,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:35,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:35,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:35,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:35,379 INFO L87 Difference]: Start difference. First operand 1363 states and 1908 transitions. Second operand 4 states. [2019-11-23 23:33:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:36,023 INFO L93 Difference]: Finished difference Result 3125 states and 4340 transitions. [2019-11-23 23:33:36,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:36,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 23:33:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:36,030 INFO L225 Difference]: With dead ends: 3125 [2019-11-23 23:33:36,031 INFO L226 Difference]: Without dead ends: 1523 [2019-11-23 23:33:36,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-23 23:33:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1363. [2019-11-23 23:33:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-23 23:33:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1651 transitions. [2019-11-23 23:33:36,068 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1651 transitions. Word has length 150 [2019-11-23 23:33:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:36,068 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1651 transitions. [2019-11-23 23:33:36,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1651 transitions. [2019-11-23 23:33:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 23:33:36,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:36,073 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:33:36,073 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:36,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:36,073 INFO L82 PathProgramCache]: Analyzing trace with hash -118806558, now seen corresponding path program 1 times [2019-11-23 23:33:36,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:36,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868930264] [2019-11-23 23:33:36,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 23:33:36,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868930264] [2019-11-23 23:33:36,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:36,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:36,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145310568] [2019-11-23 23:33:36,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:36,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:36,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:36,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:36,173 INFO L87 Difference]: Start difference. First operand 1363 states and 1651 transitions. Second operand 3 states. [2019-11-23 23:33:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:36,522 INFO L93 Difference]: Finished difference Result 2965 states and 3565 transitions. [2019-11-23 23:33:36,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:36,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 23:33:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:36,528 INFO L225 Difference]: With dead ends: 2965 [2019-11-23 23:33:36,530 INFO L226 Difference]: Without dead ends: 1523 [2019-11-23 23:33:36,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-23 23:33:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2019-11-23 23:33:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-11-23 23:33:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1734 transitions. [2019-11-23 23:33:36,564 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1734 transitions. Word has length 154 [2019-11-23 23:33:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:36,565 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 1734 transitions. [2019-11-23 23:33:36,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1734 transitions. [2019-11-23 23:33:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 23:33:36,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:36,569 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:36,570 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1933236694, now seen corresponding path program 1 times [2019-11-23 23:33:36,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:36,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552317622] [2019-11-23 23:33:36,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:36,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552317622] [2019-11-23 23:33:36,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:36,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:33:36,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697073010] [2019-11-23 23:33:36,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:36,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:36,760 INFO L87 Difference]: Start difference. First operand 1523 states and 1734 transitions. Second operand 4 states. [2019-11-23 23:33:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:37,328 INFO L93 Difference]: Finished difference Result 3045 states and 3467 transitions. [2019-11-23 23:33:37,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:37,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 23:33:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:37,335 INFO L225 Difference]: With dead ends: 3045 [2019-11-23 23:33:37,335 INFO L226 Difference]: Without dead ends: 1523 [2019-11-23 23:33:37,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-23 23:33:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2019-11-23 23:33:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-11-23 23:33:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1714 transitions. [2019-11-23 23:33:37,363 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1714 transitions. Word has length 157 [2019-11-23 23:33:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:37,364 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 1714 transitions. [2019-11-23 23:33:37,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1714 transitions. [2019-11-23 23:33:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-23 23:33:37,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:37,368 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:37,369 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1296448316, now seen corresponding path program 1 times [2019-11-23 23:33:37,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:37,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625759736] [2019-11-23 23:33:37,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 23:33:37,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625759736] [2019-11-23 23:33:37,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:37,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:33:37,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685128859] [2019-11-23 23:33:37,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:37,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:37,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:37,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:37,491 INFO L87 Difference]: Start difference. First operand 1523 states and 1714 transitions. Second operand 4 states. [2019-11-23 23:33:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:37,970 INFO L93 Difference]: Finished difference Result 3283 states and 3699 transitions. [2019-11-23 23:33:37,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:37,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-23 23:33:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:37,971 INFO L225 Difference]: With dead ends: 3283 [2019-11-23 23:33:37,971 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:33:37,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:33:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:33:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:33:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:33:37,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2019-11-23 23:33:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:37,977 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:33:37,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:33:37,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:33:37,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:33:38,401 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2019-11-23 23:33:38,692 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2019-11-23 23:33:38,695 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:33:38,696 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:33:38,696 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:33:38,696 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:33:38,696 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:33:38,696 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:33:38,696 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:33:38,697 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:33:38,697 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:33:38,697 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:33:38,697 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:33:38,697 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:33:38,697 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:33:38,697 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:33:38,697 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:33:38,698 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:33:38,698 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:33:38,698 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:33:38,698 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:33:38,698 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:33:38,698 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:33:38,699 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:33:38,699 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:33:38,699 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:33:38,699 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:33:38,699 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:33:38,699 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:33:38,699 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-23 23:33:38,699 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:33:38,700 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:33:38,700 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:33:38,700 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:33:38,700 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:33:38,700 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:33:38,700 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:33:38,700 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:33:38,700 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:33:38,701 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:33:38,701 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:33:38,701 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 586) no Hoare annotation was computed. [2019-11-23 23:33:38,701 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:33:38,701 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:33:38,701 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:33:38,701 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:33:38,702 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1))) (let ((.cse3 (not .cse1)) (.cse4 (not (= ~a11~0 1))) (.cse0 (not (= ~a28~0 8))) (.cse5 (= ~a19~0 1)) (.cse2 (not (= ~a28~0 11)))) (or (and (= ~a17~0 7) .cse0 .cse1 .cse2) (and .cse3 .cse4) (and (<= 10 ~a28~0) .cse3) (and (= ~a28~0 10) .cse4) (and .cse5 .cse4) (and .cse0 .cse5 .cse2) (and (<= ~a11~0 0) (not (= ~a28~0 9)) .cse2) (= ~a28~0 7) (and .cse5 .cse1 .cse2)))) [2019-11-23 23:33:38,702 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:33:38,702 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:33:38,702 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:33:38,702 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:33:38,703 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:33:38,703 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:33:38,703 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:33:38,703 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:33:38,703 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:33:38,703 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:33:38,703 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1))) (let ((.cse3 (not .cse1)) (.cse4 (not (= ~a11~0 1))) (.cse0 (not (= ~a28~0 8))) (.cse5 (= ~a19~0 1)) (.cse2 (not (= ~a28~0 11)))) (or (and (= ~a17~0 7) .cse0 .cse1 .cse2) (and .cse3 .cse4) (and (<= 10 ~a28~0) .cse3) (and (= ~a28~0 10) .cse4) (and .cse5 .cse4) (and .cse0 .cse5 .cse2) (and (<= ~a11~0 0) (not (= ~a28~0 9)) .cse2) (= ~a28~0 7) (and .cse5 .cse1 .cse2)))) [2019-11-23 23:33:38,703 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:33:38,704 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:33:38,704 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:33:38,704 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:33:38,704 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:33:38,704 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:33:38,704 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:33:38,704 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:33:38,704 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:33:38,705 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:33:38,706 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:33:38,706 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:33:38,706 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:33:38,706 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:33:38,706 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:33:38,706 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:33:38,706 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:33:38,706 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:33:38,707 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:33:38,707 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:33:38,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:33:38 BoogieIcfgContainer [2019-11-23 23:33:38,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:33:38,729 INFO L168 Benchmark]: Toolchain (without parser) took 10996.46 ms. Allocated memory was 138.4 MB in the beginning and 379.1 MB in the end (delta: 240.6 MB). Free memory was 101.0 MB in the beginning and 302.1 MB in the end (delta: -201.1 MB). Peak memory consumption was 255.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:38,730 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 23:33:38,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.29 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 100.7 MB in the beginning and 170.1 MB in the end (delta: -69.4 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:38,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.86 ms. Allocated memory is still 205.5 MB. Free memory was 170.1 MB in the beginning and 164.6 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:38,732 INFO L168 Benchmark]: Boogie Preprocessor took 65.24 ms. Allocated memory is still 205.5 MB. Free memory was 164.6 MB in the beginning and 160.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:38,733 INFO L168 Benchmark]: RCFGBuilder took 2238.71 ms. Allocated memory was 205.5 MB in the beginning and 250.1 MB in the end (delta: 44.6 MB). Free memory was 160.4 MB in the beginning and 192.7 MB in the end (delta: -32.3 MB). Peak memory consumption was 113.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:38,734 INFO L168 Benchmark]: TraceAbstraction took 7828.48 ms. Allocated memory was 250.1 MB in the beginning and 379.1 MB in the end (delta: 129.0 MB). Free memory was 192.7 MB in the beginning and 302.1 MB in the end (delta: -109.4 MB). Peak memory consumption was 235.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:38,738 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.29 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 100.7 MB in the beginning and 170.1 MB in the end (delta: -69.4 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 94.86 ms. Allocated memory is still 205.5 MB. Free memory was 170.1 MB in the beginning and 164.6 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.24 ms. Allocated memory is still 205.5 MB. Free memory was 164.6 MB in the beginning and 160.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2238.71 ms. Allocated memory was 205.5 MB in the beginning and 250.1 MB in the end (delta: 44.6 MB). Free memory was 160.4 MB in the beginning and 192.7 MB in the end (delta: -32.3 MB). Peak memory consumption was 113.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7828.48 ms. Allocated memory was 250.1 MB in the beginning and 379.1 MB in the end (delta: 129.0 MB). Free memory was 192.7 MB in the beginning and 302.1 MB in the end (delta: -109.4 MB). Peak memory consumption was 235.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 586]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a17 == 7 && !(a28 == 8)) && a25 == 1) && !(a28 == 11)) || (!(a25 == 1) && !(a11 == 1))) || (10 <= a28 && !(a25 == 1))) || (a28 == 10 && !(a11 == 1))) || (a19 == 1 && !(a11 == 1))) || ((!(a28 == 8) && a19 == 1) && !(a28 == 11))) || ((a11 <= 0 && !(a28 == 9)) && !(a28 == 11))) || a28 == 7) || ((a19 == 1 && a25 == 1) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((a17 == 7 && !(a28 == 8)) && a25 == 1) && !(a28 == 11)) || (!(a25 == 1) && !(a11 == 1))) || (10 <= a28 && !(a25 == 1))) || (a28 == 10 && !(a11 == 1))) || (a19 == 1 && !(a11 == 1))) || ((!(a28 == 8) && a19 == 1) && !(a28 == 11))) || ((a11 <= 0 && !(a28 == 9)) && !(a28 == 11))) || a28 == 7) || ((a19 == 1 && a25 == 1) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 7.7s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 694 SDtfs, 1037 SDslu, 110 SDs, 0 SdLazy, 3251 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1523occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1440 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 57 NumberOfFragments, 175 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1680 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 860 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1175 ConstructedInterpolants, 0 QuantifiedInterpolants, 327698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 692/692 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...