./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product10_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product10_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eac2167e56762050a6cde7d8ccfbf36c5d226056 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:53:53,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:53:53,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:53:53,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:53:53,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:53:53,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:53:53,607 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:53:53,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:53:53,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:53:53,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:53:53,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:53:53,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:53:53,615 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:53:53,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:53:53,626 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:53:53,627 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:53:53,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:53:53,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:53:53,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:53:53,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:53:53,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:53:53,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:53:53,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:53:53,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:53:53,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:53:53,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:53:53,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:53:53,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:53:53,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:53:53,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:53:53,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:53:53,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:53:53,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:53:53,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:53:53,644 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:53:53,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:53:53,645 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:53:53,660 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:53:53,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:53:53,661 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:53:53,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:53:53,662 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:53:53,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:53:53,662 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:53:53,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:53:53,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:53:53,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:53:53,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:53:53,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:53:53,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:53:53,663 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:53:53,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:53:53,664 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:53:53,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:53:53,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:53:53,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:53:53,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:53:53,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:53:53,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:53:53,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:53:53,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:53:53,665 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:53:53,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:53:53,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:53:53,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:53:53,666 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eac2167e56762050a6cde7d8ccfbf36c5d226056 [2019-01-12 14:53:53,718 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:53:53,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:53:53,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:53:53,737 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:53:53,737 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:53:53,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product10_true-unreach-call_false-termination.cil.c [2019-01-12 14:53:53,797 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8681f3ce/d97f67574ff048a19bdf1b4c46adf166/FLAGe7beae24e [2019-01-12 14:53:54,276 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:53:54,277 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product10_true-unreach-call_false-termination.cil.c [2019-01-12 14:53:54,304 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8681f3ce/d97f67574ff048a19bdf1b4c46adf166/FLAGe7beae24e [2019-01-12 14:53:54,579 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8681f3ce/d97f67574ff048a19bdf1b4c46adf166 [2019-01-12 14:53:54,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:53:54,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:53:54,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:53:54,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:53:54,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:53:54,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:53:54" (1/1) ... [2019-01-12 14:53:54,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17252cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:54, skipping insertion in model container [2019-01-12 14:53:54,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:53:54" (1/1) ... [2019-01-12 14:53:54,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:53:54,658 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:53:55,033 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:53:55,058 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:53:55,225 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:53:55,273 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:53:55,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55 WrapperNode [2019-01-12 14:53:55,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:53:55,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:53:55,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:53:55,277 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:53:55,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... [2019-01-12 14:53:55,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... [2019-01-12 14:53:55,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:53:55,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:53:55,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:53:55,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:53:55,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... [2019-01-12 14:53:55,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... [2019-01-12 14:53:55,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... [2019-01-12 14:53:55,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... [2019-01-12 14:53:55,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... [2019-01-12 14:53:55,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... [2019-01-12 14:53:55,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... [2019-01-12 14:53:55,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:53:55,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:53:55,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:53:55,391 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:53:55,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:53:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:53:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:53:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:53:55,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:53:56,351 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:53:56,351 INFO L286 CfgBuilder]: Removed 68 assue(true) statements. [2019-01-12 14:53:56,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:53:56 BoogieIcfgContainer [2019-01-12 14:53:56,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:53:56,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:53:56,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:53:56,357 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:53:56,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:53:54" (1/3) ... [2019-01-12 14:53:56,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfefd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:53:56, skipping insertion in model container [2019-01-12 14:53:56,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:53:55" (2/3) ... [2019-01-12 14:53:56,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfefd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:53:56, skipping insertion in model container [2019-01-12 14:53:56,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:53:56" (3/3) ... [2019-01-12 14:53:56,360 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product10_true-unreach-call_false-termination.cil.c [2019-01-12 14:53:56,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:53:56,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:53:56,394 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:53:56,425 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:53:56,426 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:53:56,426 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:53:56,426 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:53:56,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:53:56,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:53:56,427 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:53:56,428 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:53:56,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:53:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2019-01-12 14:53:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:53:56,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:53:56,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:53:56,456 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:53:56,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:53:56,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1537784819, now seen corresponding path program 1 times [2019-01-12 14:53:56,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:53:56,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:53:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:56,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:53:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:53:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:53:56,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:53:56,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:53:56,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:53:56,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:53:56,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:53:56,738 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2019-01-12 14:53:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:53:56,759 INFO L93 Difference]: Finished difference Result 108 states and 161 transitions. [2019-01-12 14:53:56,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:53:56,761 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:53:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:53:56,772 INFO L225 Difference]: With dead ends: 108 [2019-01-12 14:53:56,772 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 14:53:56,775 INFO L631 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-01-12 14:53:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 14:53:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 14:53:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 14:53:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2019-01-12 14:53:56,818 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 16 [2019-01-12 14:53:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:53:56,819 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2019-01-12 14:53:56,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:53:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2019-01-12 14:53:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:53:56,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:53:56,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:53:56,821 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:53:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:53:56,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1979941713, now seen corresponding path program 1 times [2019-01-12 14:53:56,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:53:56,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:53:56,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:56,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:53:56,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:53:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:53:56,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:53:56,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:53:56,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:53:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:53:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:53:56,977 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand 3 states. [2019-01-12 14:53:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:53:57,000 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2019-01-12 14:53:57,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:53:57,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:53:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:53:57,002 INFO L225 Difference]: With dead ends: 53 [2019-01-12 14:53:57,002 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 14:53:57,004 INFO L631 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-01-12 14:53:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 14:53:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-12 14:53:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 14:53:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 14:53:57,010 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2019-01-12 14:53:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:53:57,010 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 14:53:57,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:53:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 14:53:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:53:57,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:53:57,012 INFO L402 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] [2019-01-12 14:53:57,012 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:53:57,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:53:57,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1992386864, now seen corresponding path program 1 times [2019-01-12 14:53:57,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:53:57,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:53:57,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:57,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:53:57,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:53:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:53:57,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:53:57,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 14:53:57,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:53:57,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:53:57,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:53:57,418 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 8 states. [2019-01-12 14:53:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:53:58,329 INFO L93 Difference]: Finished difference Result 142 states and 221 transitions. [2019-01-12 14:53:58,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:53:58,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-12 14:53:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:53:58,340 INFO L225 Difference]: With dead ends: 142 [2019-01-12 14:53:58,341 INFO L226 Difference]: Without dead ends: 121 [2019-01-12 14:53:58,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:53:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-12 14:53:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 60. [2019-01-12 14:53:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-12 14:53:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2019-01-12 14:53:58,360 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 22 [2019-01-12 14:53:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:53:58,364 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2019-01-12 14:53:58,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:53:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2019-01-12 14:53:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:53:58,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:53:58,367 INFO L402 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] [2019-01-12 14:53:58,367 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:53:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:53:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1296861074, now seen corresponding path program 1 times [2019-01-12 14:53:58,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:53:58,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:53:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:58,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:53:58,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:53:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:53:58,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:53:58,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:53:58,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:53:58,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:53:58,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:53:58,492 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand 3 states. [2019-01-12 14:53:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:53:58,539 INFO L93 Difference]: Finished difference Result 95 states and 136 transitions. [2019-01-12 14:53:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:53:58,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 14:53:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:53:58,542 INFO L225 Difference]: With dead ends: 95 [2019-01-12 14:53:58,542 INFO L226 Difference]: Without dead ends: 57 [2019-01-12 14:53:58,544 INFO L631 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-01-12 14:53:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-12 14:53:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-12 14:53:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 14:53:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2019-01-12 14:53:58,559 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 23 [2019-01-12 14:53:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:53:58,560 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2019-01-12 14:53:58,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:53:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2019-01-12 14:53:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 14:53:58,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:53:58,562 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:53:58,563 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:53:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:53:58,563 INFO L82 PathProgramCache]: Analyzing trace with hash -829366222, now seen corresponding path program 1 times [2019-01-12 14:53:58,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:53:58,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:53:58,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:58,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:53:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:53:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:53:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-12 14:53:58,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:53:58,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:53:58,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:53:58,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:53:58,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:53:58,705 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand 5 states. [2019-01-12 14:53:58,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:53:58,998 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2019-01-12 14:53:58,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:53:58,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-01-12 14:53:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:53:58,999 INFO L225 Difference]: With dead ends: 111 [2019-01-12 14:53:59,000 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:53:59,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:53:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:53:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:53:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:53:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:53:59,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-01-12 14:53:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:53:59,003 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:53:59,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:53:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:53:59,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:53:59,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:53:59,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-01-12 14:53:59,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:53:59,299 INFO L444 ceAbstractionStarter]: At program point L829(lines 824 832) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,300 INFO L444 ceAbstractionStarter]: At program point L829-1(lines 824 832) the Hoare annotation is: false [2019-01-12 14:53:59,300 INFO L444 ceAbstractionStarter]: At program point L829-2(lines 824 832) the Hoare annotation is: false [2019-01-12 14:53:59,300 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-01-12 14:53:59,300 INFO L448 ceAbstractionStarter]: For program point L698(lines 697 744) no Hoare annotation was computed. [2019-01-12 14:53:59,300 INFO L444 ceAbstractionStarter]: At program point L864(lines 859 867) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| ~waterLevel~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,301 INFO L448 ceAbstractionStarter]: For program point L699(lines 699 703) no Hoare annotation was computed. [2019-01-12 14:53:59,301 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2019-01-12 14:53:59,301 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 541) no Hoare annotation was computed. [2019-01-12 14:53:59,301 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 61) no Hoare annotation was computed. [2019-01-12 14:53:59,301 INFO L451 ceAbstractionStarter]: At program point L534-1(lines 534 541) the Hoare annotation is: true [2019-01-12 14:53:59,301 INFO L448 ceAbstractionStarter]: For program point L55-4(lines 55 61) no Hoare annotation was computed. [2019-01-12 14:53:59,302 INFO L444 ceAbstractionStarter]: At program point L568(lines 568 574) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,303 INFO L444 ceAbstractionStarter]: At program point L568-1(lines 568 574) the Hoare annotation is: false [2019-01-12 14:53:59,303 INFO L444 ceAbstractionStarter]: At program point L568-2(lines 568 574) the Hoare annotation is: false [2019-01-12 14:53:59,303 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 723) no Hoare annotation was computed. [2019-01-12 14:53:59,303 INFO L444 ceAbstractionStarter]: At program point L717-1(lines 717 723) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,303 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 788) no Hoare annotation was computed. [2019-01-12 14:53:59,303 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:53:59,304 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 739) no Hoare annotation was computed. [2019-01-12 14:53:59,304 INFO L444 ceAbstractionStarter]: At program point L735-2(lines 561 567) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,304 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 14:53:59,304 INFO L448 ceAbstractionStarter]: For program point L439-1(line 439) no Hoare annotation was computed. [2019-01-12 14:53:59,304 INFO L448 ceAbstractionStarter]: For program point L439-2(line 439) no Hoare annotation was computed. [2019-01-12 14:53:59,305 INFO L444 ceAbstractionStarter]: At program point L456-2(lines 456 470) the Hoare annotation is: false [2019-01-12 14:53:59,305 INFO L444 ceAbstractionStarter]: At program point L638(lines 633 641) the Hoare annotation is: (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,305 INFO L444 ceAbstractionStarter]: At program point L638-1(lines 633 641) the Hoare annotation is: false [2019-01-12 14:53:59,305 INFO L444 ceAbstractionStarter]: At program point L638-2(lines 633 641) the Hoare annotation is: false [2019-01-12 14:53:59,305 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 14:53:59,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:53:59,306 INFO L444 ceAbstractionStarter]: At program point L507(lines 503 509) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| ~waterLevel~0) (= 1 ~waterLevel~0) (= ULTIMATE.start_main_~tmp~4 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,306 INFO L448 ceAbstractionStarter]: For program point L772(lines 772 776) no Hoare annotation was computed. [2019-01-12 14:53:59,306 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 713) no Hoare annotation was computed. [2019-01-12 14:53:59,306 INFO L444 ceAbstractionStarter]: At program point L707-1(lines 707 713) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,306 INFO L444 ceAbstractionStarter]: At program point L856(lines 1 867) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,306 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 464) no Hoare annotation was computed. [2019-01-12 14:53:59,306 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 561 567) no Hoare annotation was computed. [2019-01-12 14:53:59,307 INFO L451 ceAbstractionStarter]: At program point L543(lines 524 546) the Hoare annotation is: true [2019-01-12 14:53:59,308 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:53:59,308 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-01-12 14:53:59,308 INFO L444 ceAbstractionStarter]: At program point L561(lines 560 579) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,308 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 561 567) no Hoare annotation was computed. [2019-01-12 14:53:59,308 INFO L444 ceAbstractionStarter]: At program point L561-2(lines 560 579) the Hoare annotation is: false [2019-01-12 14:53:59,310 INFO L444 ceAbstractionStarter]: At program point L561-3(lines 560 579) the Hoare annotation is: false [2019-01-12 14:53:59,310 INFO L448 ceAbstractionStarter]: For program point L760(lines 760 764) no Hoare annotation was computed. [2019-01-12 14:53:59,310 INFO L448 ceAbstractionStarter]: For program point L727(lines 727 740) no Hoare annotation was computed. [2019-01-12 14:53:59,310 INFO L448 ceAbstractionStarter]: For program point L760-3(lines 760 764) no Hoare annotation was computed. [2019-01-12 14:53:59,310 INFO L448 ceAbstractionStarter]: For program point L760-6(lines 760 764) no Hoare annotation was computed. [2019-01-12 14:53:59,311 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 64) no Hoare annotation was computed. [2019-01-12 14:53:59,311 INFO L444 ceAbstractionStarter]: At program point L51-1(lines 1 867) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0)) [2019-01-12 14:53:59,311 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 64) no Hoare annotation was computed. [2019-01-12 14:53:59,311 INFO L444 ceAbstractionStarter]: At program point L51-3(lines 1 867) the Hoare annotation is: false [2019-01-12 14:53:59,311 INFO L448 ceAbstractionStarter]: For program point L51-4(lines 51 64) no Hoare annotation was computed. [2019-01-12 14:53:59,311 INFO L444 ceAbstractionStarter]: At program point L51-5(lines 1 867) the Hoare annotation is: false [2019-01-12 14:53:59,311 INFO L444 ceAbstractionStarter]: At program point L745(lines 696 746) the Hoare annotation is: false [2019-01-12 14:53:59,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:53:59 BoogieIcfgContainer [2019-01-12 14:53:59,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:53:59,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:53:59,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:53:59,330 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:53:59,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:53:56" (3/4) ... [2019-01-12 14:53:59,336 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:53:59,351 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:53:59,352 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-12 14:53:59,352 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:53:59,353 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 14:53:59,354 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:53:59,355 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:53:59,385 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == waterLevel && 1 == waterLevel) && pumpRunning == 0 [2019-01-12 14:53:59,385 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == waterLevel && 1 == waterLevel) && tmp == waterLevel) && pumpRunning == 0 [2019-01-12 14:53:59,388 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \result && splverifierCounter == 0) && pumpRunning == 0 [2019-01-12 14:53:59,451 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:53:59,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:53:59,453 INFO L168 Benchmark]: Toolchain (without parser) took 4869.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.4 MB in the beginning and 948.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 152.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:53:59,454 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:53:59,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:53:59,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:53:59,455 INFO L168 Benchmark]: Boogie Preprocessor took 44.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:53:59,456 INFO L168 Benchmark]: RCFGBuilder took 962.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:53:59,457 INFO L168 Benchmark]: TraceAbstraction took 2975.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.5 MB in the end (delta: 127.8 MB). Peak memory consumption was 127.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:53:59,457 INFO L168 Benchmark]: Witness Printer took 122.07 ms. Allocated memory is still 1.2 GB. Free memory was 955.5 MB in the beginning and 948.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:53:59,461 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 691.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 962.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2975.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.5 MB in the end (delta: 127.8 MB). Peak memory consumption was 127.8 MB. Max. memory is 11.5 GB. * Witness Printer took 122.07 ms. Allocated memory is still 1.2 GB. Free memory was 955.5 MB in the beginning and 948.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 439]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 439]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: splverifierCounter == 0 && pumpRunning == 0 - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: splverifierCounter == 0 && pumpRunning == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: splverifierCounter == 0 && pumpRunning == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 859]: Loop Invariant Derived loop invariant: (\result == waterLevel && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: (0 == \result && splverifierCounter == 0) && pumpRunning == 0 - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 561]: Loop Invariant Derived loop invariant: splverifierCounter == 0 && pumpRunning == 0 - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: splverifierCounter == 0 && pumpRunning == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 == waterLevel && pumpRunning == 0 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: splverifierCounter == 0 && pumpRunning == 0 - InvariantResult [Line: 534]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 524]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 696]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 824]: Loop Invariant Derived loop invariant: splverifierCounter == 0 && pumpRunning == 0 - InvariantResult [Line: 824]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((\result == waterLevel && 1 == waterLevel) && tmp == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 824]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 3 error locations. SAFE Result, 2.8s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 346 SDslu, 331 SDs, 0 SdLazy, 91 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 61 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 25 PreInvPairs, 74 NumberOfFragments, 103 HoareAnnotationTreeSize, 25 FomulaSimplifications, 1485 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 25 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 6952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...