/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/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:03:49,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:03:49,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:03:49,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:03:49,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:03:49,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:03:49,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:03:49,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:03:49,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:03:49,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:03:49,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:03:49,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:03:49,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:03:49,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:03:49,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:03:49,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:03:49,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:03:49,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:03:49,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:03:49,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:03:49,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:03:49,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:03:49,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:03:49,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:03:49,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:03:49,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:03:49,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:03:49,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:03:49,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:03:49,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:03:49,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:03:49,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:03:49,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:03:49,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:03:49,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:03:49,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:03:49,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:03:49,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:03:49,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:03:49,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:03:49,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:03:49,577 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-24 06:03:49,599 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:03:49,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:03:49,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:03:49,601 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:03:49,601 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:03:49,602 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:03:49,602 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:03:49,602 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:03:49,602 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:03:49,602 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:03:49,603 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:03:49,604 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:03:49,604 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:03:49,605 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:03:49,605 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:03:49,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:03:49,606 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:03:49,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:03:49,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:03:49,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:03:49,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:03:49,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:03:49,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:03:49,608 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:03:49,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:03:49,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:03:49,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:03:49,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:03:49,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:03:49,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:03:49,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:03:49,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:03:49,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:03:49,611 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:03:49,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:03:49,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:03:49,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:03:49,612 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:03:49,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:03:49,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:03:49,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:03:49,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:03:49,940 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:03:49,940 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2019-11-24 06:03:49,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429589bad/ea4877bfb1b94ded8e2c99db9693f1ea/FLAG4a2cf2be3 [2019-11-24 06:03:50,430 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:03:50,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2019-11-24 06:03:50,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429589bad/ea4877bfb1b94ded8e2c99db9693f1ea/FLAG4a2cf2be3 [2019-11-24 06:03:50,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429589bad/ea4877bfb1b94ded8e2c99db9693f1ea [2019-11-24 06:03:50,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:03:50,827 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:03:50,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:03:50,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:03:50,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:03:50,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:03:50" (1/1) ... [2019-11-24 06:03:50,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547409a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:50, skipping insertion in model container [2019-11-24 06:03:50,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:03:50" (1/1) ... [2019-11-24 06:03:50,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:03:50,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:03:51,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:03:51,133 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:03:51,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:03:51,287 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:03:51,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51 WrapperNode [2019-11-24 06:03:51,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:03:51,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:03:51,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:03:51,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:03:51,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (1/1) ... [2019-11-24 06:03:51,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (1/1) ... [2019-11-24 06:03:51,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:03:51,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:03:51,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:03:51,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:03:51,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (1/1) ... [2019-11-24 06:03:51,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (1/1) ... [2019-11-24 06:03:51,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (1/1) ... [2019-11-24 06:03:51,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (1/1) ... [2019-11-24 06:03:51,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (1/1) ... [2019-11-24 06:03:51,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (1/1) ... [2019-11-24 06:03:51,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (1/1) ... [2019-11-24 06:03:51,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:03:51,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:03:51,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:03:51,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:03:51,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (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-24 06:03:51,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:03:51,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:03:52,920 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:03:52,921 INFO L284 CfgBuilder]: Removed 64 assume(true) statements. [2019-11-24 06:03:52,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:03:52 BoogieIcfgContainer [2019-11-24 06:03:52,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:03:52,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:03:52,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:03:52,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:03:52,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:03:50" (1/3) ... [2019-11-24 06:03:52,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76db8543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:03:52, skipping insertion in model container [2019-11-24 06:03:52,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:51" (2/3) ... [2019-11-24 06:03:52,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76db8543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:03:52, skipping insertion in model container [2019-11-24 06:03:52,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:03:52" (3/3) ... [2019-11-24 06:03:52,930 INFO L109 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2019-11-24 06:03:52,939 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:03:52,947 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:03:52,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:03:52,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:03:52,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:03:52,983 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:03:52,983 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:03:52,983 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:03:52,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:03:52,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:03:52,984 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:03:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-11-24 06:03:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-24 06:03:53,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:53,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-24 06:03:53,005 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash 21078784, now seen corresponding path program 1 times [2019-11-24 06:03:53,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:53,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469881500] [2019-11-24 06:03:53,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:53,161 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-24 06:03:53,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469881500] [2019-11-24 06:03:53,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:53,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:03:53,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229907763] [2019-11-24 06:03:53,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 06:03:53,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:53,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 06:03:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 06:03:53,187 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2019-11-24 06:03:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:53,204 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-11-24 06:03:53,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 06:03:53,206 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-11-24 06:03:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:53,216 INFO L225 Difference]: With dead ends: 21 [2019-11-24 06:03:53,216 INFO L226 Difference]: Without dead ends: 9 [2019-11-24 06:03:53,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 06:03:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-11-24 06:03:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-24 06:03:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-24 06:03:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-24 06:03:53,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2019-11-24 06:03:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:53,253 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-24 06:03:53,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 06:03:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-11-24 06:03:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 06:03:53,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:53,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:53,254 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:53,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1470956098, now seen corresponding path program 1 times [2019-11-24 06:03:53,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:53,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483196276] [2019-11-24 06:03:53,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:53,386 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-24 06:03:53,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483196276] [2019-11-24 06:03:53,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:53,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:03:53,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318842110] [2019-11-24 06:03:53,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:03:53,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:53,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:03:53,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:03:53,393 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-11-24 06:03:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:53,445 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-24 06:03:53,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:03:53,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-24 06:03:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:53,446 INFO L225 Difference]: With dead ends: 20 [2019-11-24 06:03:53,447 INFO L226 Difference]: Without dead ends: 17 [2019-11-24 06:03:53,448 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-24 06:03:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-24 06:03:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-11-24 06:03:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-24 06:03:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-24 06:03:53,458 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2019-11-24 06:03:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:53,459 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-24 06:03:53,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:03:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-24 06:03:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 06:03:53,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:53,460 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:53,461 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:53,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:53,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1453025083, now seen corresponding path program 1 times [2019-11-24 06:03:53,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:53,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193177922] [2019-11-24 06:03:53,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:53,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193177922] [2019-11-24 06:03:53,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721068169] [2019-11-24 06:03:53,761 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-24 06:03:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:53,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-24 06:03:53,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:03:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:53,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:54,046 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:03:54,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:54,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1715243262] [2019-11-24 06:03:54,368 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-11-24 06:03:54,371 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 06:03:54,379 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 06:03:54,386 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 06:03:54,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 06:03:54,645 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 192 [2019-11-24 06:03:55,477 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 240 [2019-11-24 06:03:56,930 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 278 [2019-11-24 06:03:57,106 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 278 [2019-11-24 06:03:57,244 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 259 [2019-11-24 06:03:57,246 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 06:03:57,609 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 60 [2019-11-24 06:03:59,186 WARN L192 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 251 DAG size of output: 143 [2019-11-24 06:04:00,566 WARN L192 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 239 DAG size of output: 121 [2019-11-24 06:04:01,585 WARN L192 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 84 [2019-11-24 06:04:02,709 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 334 DAG size of output: 98 [2019-11-24 06:04:02,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 06:04:02,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 6, 6] total 17 [2019-11-24 06:04:02,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905562415] [2019-11-24 06:04:02,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 06:04:02,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 06:04:02,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-11-24 06:04:02,856 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2019-11-24 06:04:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:02,966 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-24 06:04:02,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 06:04:02,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-24 06:04:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:02,969 INFO L225 Difference]: With dead ends: 24 [2019-11-24 06:04:02,969 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 06:04:02,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-11-24 06:04:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 06:04:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 06:04:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 06:04:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 06:04:02,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-11-24 06:04:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:02,973 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 06:04:02,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 06:04:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 06:04:02,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 06:04:03,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:04:03,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 06:04:03,965 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 137 [2019-11-24 06:04:04,183 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-24 06:04:04,187 INFO L440 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (and (= ~z_val~0 0) (<= ULTIMATE.start_eval_~tmp~0 2147483647) (= ~d0_val_t~0 ~d0_val~0) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) (= 2 ~comp_m1_st~0) (= ~b1_ev~0 2) (= 0 ~b1_req_up~0) (= 1 ~b0_val_t~0) (= ~b0_val_t~0 ~b0_val~0) (= ~b0_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= 0 ULTIMATE.start_method1_~s2~0) (= 0 ~z_val_t~0) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~z_req_up~0 1) (= ULTIMATE.start_eval_~tmp___0~0 |ULTIMATE.start_exists_runnable_thread_#res|) (= ~d1_req_up~0 0) (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~b1_val_t~0 1) (= ~z_ev~0 2) (= 2 ~d1_ev~0) (= 2 ~d0_ev~0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 |ULTIMATE.start_exists_runnable_thread_#res|) (= ~b0_ev~0 2) (= 1 ULTIMATE.start_method1_~s3~0) (= 0 ULTIMATE.start_eval_~tmp___0~0) (= 0 ULTIMATE.start_method1_~s1~0) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 |ULTIMATE.start_is_method1_triggered_#res|) (= ~d1_val_t~0 1) (= ~b1_val~0 ~b1_val_t~0) (= 1 ~d0_val_t~0) (= ~d0_req_up~0 0) (<= 0 (+ ULTIMATE.start_eval_~tmp~0 2147483648)) (= |ULTIMATE.start_is_method1_triggered_#res| ULTIMATE.start_activate_threads_~tmp~1) (= 0 ~comp_m1_i~0)) [2019-11-24 06:04:04,187 INFO L444 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-24 06:04:04,187 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-11-24 06:04:04,187 INFO L440 ceAbstractionStarter]: At program point L445(lines 491 497) the Hoare annotation is: (and (= ~z_val~0 0) (= ~z_val~0 ~z_val_t~0)) [2019-11-24 06:04:04,187 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-11-24 06:04:04,188 INFO L447 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-24 06:04:04,188 INFO L440 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse0 (= ~z_val~0 0)) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (let ((.cse9 (= 0 ~d0_val_t~0)) (.cse11 (= ~b1_val_t~0 0)) (.cse18 (= ~d0_val_t~0 ~d0_val~0)) (.cse8 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse12 (= ~b1_ev~0 2)) (.cse19 (= ~b1_val~0 ~b1_val_t~0)) (.cse4 (= ~b0_ev~0 2)) (.cse3 (= 0 ~b0_val_t~0)) (.cse10 (= 2 ~d0_ev~0))) (let ((.cse15 (and .cse18 .cse8 .cse12 .cse19 .cse4 (= ~b0_val_t~0 ~b0_val~0) (not .cse3) .cse10)) (.cse5 (and (not .cse11) .cse18 .cse8 .cse12 .cse19 .cse10)) (.cse6 (and .cse18 .cse8 .cse10 (not .cse9))) (.cse7 (= 0 ~d0_val~0)) (.cse13 (= ~b1_val~0 0)) (.cse14 (= 0 ~b0_val~0)) (.cse16 (= ~d1_val_t~0 0)) (.cse17 (= 2 ~d1_ev~0))) (or (and (or (and .cse3 .cse4 (or .cse5 (and (or .cse6 (and .cse7 .cse8 .cse9 .cse10)) .cse11 .cse12 .cse13)) .cse14) .cse15) (not .cse16) (= ~d1_val_t~0 ~d1_val~0) .cse17) (and (or .cse15 (and .cse3 (or .cse5 (and .cse11 .cse12 (or .cse6 (and .cse7 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0) .cse9 .cse10)) .cse13)) .cse4 .cse14)) (= 0 ~d1_val~0) .cse16 .cse17)))))) (or (and .cse0 (= 0 ~b1_req_up~0) (= 1 ~b0_val_t~0) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= 0 ~comp_m1_st~0) .cse1 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 |ULTIMATE.start_is_method1_triggered_#res|) .cse2 (= ~d1_val_t~0 1) (= ~d1_req_up~0 0) (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~b1_val_t~0 1) (= 1 ~d0_val_t~0) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (= |ULTIMATE.start_is_method1_triggered_#res| ULTIMATE.start_activate_threads_~tmp~1) (= 0 ~comp_m1_i~0)) (and .cse0 (<= ULTIMATE.start_eval_~tmp~0 2147483647) (<= ~b0_val_t~0 1) (= 2 ~comp_m1_st~0) (<= 0 ~d0_req_up~0) (<= ~d0_req_up~0 0) (<= ~d1_val~0 1) (= 0 ULTIMATE.start_method1_~s2~0) (<= 0 ~d1_req_up~0) .cse1 (not (= ULTIMATE.start_eval_~tmp~0 0)) (<= ~b1_val~0 1) (<= |ULTIMATE.start_is_method1_triggered_#res| 1) (= ~z_req_up~0 1) (= ULTIMATE.start_eval_~tmp___0~0 |ULTIMATE.start_exists_runnable_thread_#res|) .cse2 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1) (<= 1 ~b1_val~0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 |ULTIMATE.start_exists_runnable_thread_#res|) (<= 1 ULTIMATE.start_activate_threads_~tmp~1) (<= ULTIMATE.start_activate_threads_~tmp~1 1) (<= 1 ~b0_val_t~0) (<= ~z_ev~0 2) (= 1 ULTIMATE.start_method1_~s3~0) (<= 1 |ULTIMATE.start_is_method1_triggered_#res|) (= 0 ULTIMATE.start_method1_~s1~0) (<= ~comp_m1_i~0 0) (<= 1 ~d1_val~0) (<= 0 ~b0_req_up~0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 1) (<= 1 ~d0_val_t~0) (<= ~d0_val_t~0 1) (<= 0 ~b1_req_up~0) (<= 0 ~comp_m1_i~0) (<= ~b0_req_up~0 0) (<= ~d1_req_up~0 0) (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (<= ~b1_req_up~0 0) (<= 0 (+ ULTIMATE.start_eval_~tmp~0 2147483648)) (<= 2 ~z_ev~0)))) [2019-11-24 06:04:04,189 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 06:04:04,189 INFO L440 ceAbstractionStarter]: At program point L422-1(lines 340 444) the Hoare annotation is: (and (= ~d0_val_t~0 ~d0_val~0) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) (= ~b1_ev~0 2) (= 0 ~b1_req_up~0) (= 1 ~b0_val_t~0) (= ~b0_val_t~0 ~b0_val~0) (= ~b0_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= 0 ~comp_m1_st~0) (= 0 ~z_val_t~0) (= ~d1_req_up~0 0) (= ~z_val~0 ~z_val_t~0) (= ~b1_val_t~0 1) (= ~z_ev~0 2) (= 0 ULTIMATE.start_start_simulation_~kernel_st~0) (= 2 ~d1_ev~0) (= 2 ~d0_ev~0) (= ~b0_ev~0 2) (= ~z_req_up~0 0) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 |ULTIMATE.start_is_method1_triggered_#res|) (= ~d1_val_t~0 1) (= ~b1_val~0 ~b1_val_t~0) (= 1 ~d0_val_t~0) (= ~d0_req_up~0 0) (= |ULTIMATE.start_is_method1_triggered_#res| ULTIMATE.start_activate_threads_~tmp~1) (= 0 ~comp_m1_i~0)) [2019-11-24 06:04:04,189 INFO L447 ceAbstractionStarter]: At program point L491(lines 491 497) the Hoare annotation is: true [2019-11-24 06:04:04,189 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-24 06:04:04,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:04:04 BoogieIcfgContainer [2019-11-24 06:04:04,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:04:04,228 INFO L168 Benchmark]: Toolchain (without parser) took 13401.33 ms. Allocated memory was 136.8 MB in the beginning and 465.6 MB in the end (delta: 328.7 MB). Free memory was 101.6 MB in the beginning and 256.6 MB in the end (delta: -155.0 MB). Peak memory consumption was 342.3 MB. Max. memory is 7.1 GB. [2019-11-24 06:04:04,229 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 06:04:04,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.19 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 178.1 MB in the end (delta: -76.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:04:04,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.30 ms. Allocated memory is still 200.3 MB. Free memory was 178.1 MB in the beginning and 175.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:04:04,232 INFO L168 Benchmark]: Boogie Preprocessor took 38.30 ms. Allocated memory is still 200.3 MB. Free memory was 175.2 MB in the beginning and 173.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:04:04,233 INFO L168 Benchmark]: RCFGBuilder took 1539.69 ms. Allocated memory was 200.3 MB in the beginning and 231.2 MB in the end (delta: 30.9 MB). Free memory was 173.1 MB in the beginning and 131.8 MB in the end (delta: 41.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 7.1 GB. [2019-11-24 06:04:04,234 INFO L168 Benchmark]: TraceAbstraction took 11303.22 ms. Allocated memory was 231.2 MB in the beginning and 465.6 MB in the end (delta: 234.4 MB). Free memory was 130.4 MB in the beginning and 256.6 MB in the end (delta: -126.2 MB). Peak memory consumption was 276.8 MB. Max. memory is 7.1 GB. [2019-11-24 06:04:04,239 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 136.8 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 460.19 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 178.1 MB in the end (delta: -76.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.30 ms. Allocated memory is still 200.3 MB. Free memory was 178.1 MB in the beginning and 175.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.30 ms. Allocated memory is still 200.3 MB. Free memory was 175.2 MB in the beginning and 173.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1539.69 ms. Allocated memory was 200.3 MB in the beginning and 231.2 MB in the end (delta: 30.9 MB). Free memory was 173.1 MB in the beginning and 131.8 MB in the end (delta: 41.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11303.22 ms. Allocated memory was 231.2 MB in the beginning and 465.6 MB in the end (delta: 234.4 MB). Free memory was 130.4 MB in the beginning and 256.6 MB in the end (delta: -126.2 MB). Peak memory consumption was 276.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: z_val == 0 && z_val == z_val_t - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((z_val == 0 && tmp <= 2147483647) && d0_val_t == d0_val) && __retres1 == 1) && 2 == comp_m1_st) && b1_ev == 2) && 0 == b1_req_up) && 1 == b0_val_t) && b0_val_t == b0_val) && b0_req_up == 0) && d1_val_t == d1_val) && 0 == s2) && 0 == z_val_t) && !(tmp == 0)) && z_req_up == 1) && tmp___0 == \result) && d1_req_up == 0) && 1 == kernel_st) && b1_val_t == 1) && z_ev == 2) && 2 == d1_ev) && 2 == d0_ev) && __retres1 == \result) && b0_ev == 2) && 1 == s3) && 0 == tmp___0) && 0 == s1) && __retres1 == \result) && d1_val_t == 1) && b1_val == b1_val_t) && 1 == d0_val_t) && d0_req_up == 0) && 0 <= tmp + 2147483648) && \result == tmp) && 0 == comp_m1_i - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((z_val == 0 && 0 == b1_req_up) && 1 == b0_val_t) && z_req_up == 0) && b0_req_up == 0) && 0 == comp_m1_st) && 0 == z_val_t) && __retres1 == \result) && ((((((((0 == b0_val_t && b0_ev == 2) && ((((((!(b1_val_t == 0) && d0_val_t == d0_val) && __retres1 == 1) && b1_ev == 2) && b1_val == b1_val_t) && 2 == d0_ev) || (((((((d0_val_t == d0_val && __retres1 == 1) && 2 == d0_ev) && !(0 == d0_val_t)) || (((0 == d0_val && __retres1 == 1) && 0 == d0_val_t) && 2 == d0_ev)) && b1_val_t == 0) && b1_ev == 2) && b1_val == 0))) && 0 == b0_val) || (((((((d0_val_t == d0_val && __retres1 == 1) && b1_ev == 2) && b1_val == b1_val_t) && b0_ev == 2) && b0_val_t == b0_val) && !(0 == b0_val_t)) && 2 == d0_ev)) && !(d1_val_t == 0)) && d1_val_t == d1_val) && 2 == d1_ev) || (((((((((((d0_val_t == d0_val && __retres1 == 1) && b1_ev == 2) && b1_val == b1_val_t) && b0_ev == 2) && b0_val_t == b0_val) && !(0 == b0_val_t)) && 2 == d0_ev) || (((0 == b0_val_t && ((((((!(b1_val_t == 0) && d0_val_t == d0_val) && __retres1 == 1) && b1_ev == 2) && b1_val == b1_val_t) && 2 == d0_ev) || (((b1_val_t == 0 && b1_ev == 2) && ((((d0_val_t == d0_val && __retres1 == 1) && 2 == d0_ev) && !(0 == d0_val_t)) || (((0 == d0_val && __retres1 == 0) && 0 == d0_val_t) && 2 == d0_ev))) && b1_val == 0))) && b0_ev == 2) && 0 == b0_val)) && 0 == d1_val) && d1_val_t == 0) && 2 == d1_ev))) && d1_val_t == 1) && d1_req_up == 0) && 1 == kernel_st) && b1_val_t == 1) && 1 == d0_val_t) && d0_req_up == 0) && z_ev == 2) && \result == tmp) && 0 == comp_m1_i) || (((((((((((((((((((((((((((((((((((((((z_val == 0 && tmp <= 2147483647) && b0_val_t <= 1) && 2 == comp_m1_st) && 0 <= d0_req_up) && d0_req_up <= 0) && d1_val <= 1) && 0 == s2) && 0 <= d1_req_up) && 0 == z_val_t) && !(tmp == 0)) && b1_val <= 1) && \result <= 1) && z_req_up == 1) && tmp___0 == \result) && ((((((((0 == b0_val_t && b0_ev == 2) && ((((((!(b1_val_t == 0) && d0_val_t == d0_val) && __retres1 == 1) && b1_ev == 2) && b1_val == b1_val_t) && 2 == d0_ev) || (((((((d0_val_t == d0_val && __retres1 == 1) && 2 == d0_ev) && !(0 == d0_val_t)) || (((0 == d0_val && __retres1 == 1) && 0 == d0_val_t) && 2 == d0_ev)) && b1_val_t == 0) && b1_ev == 2) && b1_val == 0))) && 0 == b0_val) || (((((((d0_val_t == d0_val && __retres1 == 1) && b1_ev == 2) && b1_val == b1_val_t) && b0_ev == 2) && b0_val_t == b0_val) && !(0 == b0_val_t)) && 2 == d0_ev)) && !(d1_val_t == 0)) && d1_val_t == d1_val) && 2 == d1_ev) || (((((((((((d0_val_t == d0_val && __retres1 == 1) && b1_ev == 2) && b1_val == b1_val_t) && b0_ev == 2) && b0_val_t == b0_val) && !(0 == b0_val_t)) && 2 == d0_ev) || (((0 == b0_val_t && ((((((!(b1_val_t == 0) && d0_val_t == d0_val) && __retres1 == 1) && b1_ev == 2) && b1_val == b1_val_t) && 2 == d0_ev) || (((b1_val_t == 0 && b1_ev == 2) && ((((d0_val_t == d0_val && __retres1 == 1) && 2 == d0_ev) && !(0 == d0_val_t)) || (((0 == d0_val && __retres1 == 0) && 0 == d0_val_t) && 2 == d0_ev))) && b1_val == 0))) && b0_ev == 2) && 0 == b0_val)) && 0 == d1_val) && d1_val_t == 0) && 2 == d1_ev))) && kernel_st <= 1) && 1 <= b1_val) && __retres1 == \result) && 1 <= tmp) && tmp <= 1) && 1 <= b0_val_t) && z_ev <= 2) && 1 == s3) && 1 <= \result) && 0 == s1) && comp_m1_i <= 0) && 1 <= d1_val) && 0 <= b0_req_up) && __retres1 == 1) && 1 <= d0_val_t) && d0_val_t <= 1) && 0 <= b1_req_up) && 0 <= comp_m1_i) && b0_req_up <= 0) && d1_req_up <= 0) && 1 <= kernel_st) && b1_req_up <= 0) && 0 <= tmp + 2147483648) && 2 <= z_ev) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((d0_val_t == d0_val && __retres1 == 1) && b1_ev == 2) && 0 == b1_req_up) && 1 == b0_val_t) && b0_val_t == b0_val) && b0_req_up == 0) && d1_val_t == d1_val) && 0 == comp_m1_st) && 0 == z_val_t) && d1_req_up == 0) && z_val == z_val_t) && b1_val_t == 1) && z_ev == 2) && 0 == kernel_st) && 2 == d1_ev) && 2 == d0_ev) && b0_ev == 2) && z_req_up == 0) && __retres1 == \result) && d1_val_t == 1) && b1_val == b1_val_t) && 1 == d0_val_t) && d0_req_up == 0) && \result == tmp) && 0 == comp_m1_i - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Result: SAFE, OverallTime: 11.2s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 22 SDtfs, 9 SDslu, 13 SDs, 0 SdLazy, 34 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 14 NumberOfFragments, 799 HoareAnnotationTreeSize, 6 FomulaSimplifications, 116 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 740 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 3773 SizeOfPredicates, 29 NumberOfNonLiveVariables, 113 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 2878, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 8, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 12, TOOLS_POST_TIME[ms]: 1282, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 12, TOOLS_QUANTIFIERELIM_TIME[ms]: 1273, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 1189, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 25, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 492, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 992, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 12, DOMAIN_ISBOTTOM_APPLICATIONS: 8, DOMAIN_ISBOTTOM_TIME[ms]: 38, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 1052, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 1052, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 4, DAG_COMPRESSION_TIME[ms]: 12, DAG_COMPRESSION_PROCESSED_NODES: 66, DAG_COMPRESSION_RETAINED_NODES: 26, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...