./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/afnp2014.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/loop-lit/afnp2014.i -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 b8a2a9daa5f615141a4724b4c8f8a6cfba08aa03 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:16:36,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:16:36,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:16:36,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:16:36,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:16:36,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:16:36,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:16:36,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:16:36,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:16:36,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:16:36,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:16:36,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:16:36,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:16:36,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:16:36,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:16:36,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:16:36,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:16:36,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:16:36,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:16:36,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:16:36,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:16:36,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:16:36,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:16:36,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:16:36,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:16:36,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:16:36,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:16:36,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:16:36,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:16:36,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:16:36,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:16:36,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:16:36,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:16:36,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:16:36,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:16:36,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:16:36,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:16:36,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:16:36,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:16:36,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:16:36,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:16:36,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:16:36,373 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:16:36,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:16:36,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:16:36,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:16:36,377 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:16:36,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:16:36,378 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:16:36,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:16:36,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:16:36,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:16:36,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:16:36,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:16:36,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:16:36,381 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:16:36,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:16:36,382 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:16:36,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:16:36,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:16:36,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:16:36,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:16:36,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:16:36,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:16:36,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:16:36,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:16:36,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:16:36,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:16:36,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:16:36,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:16:36,388 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:16:36,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> b8a2a9daa5f615141a4724b4c8f8a6cfba08aa03 [2020-07-28 18:16:36,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:16:36,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:16:36,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:16:36,739 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:16:36,739 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:16:36,740 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/afnp2014.i [2020-07-28 18:16:36,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79ceec10/400508cdf74b42f18e0b5c701f93abd9/FLAG772098a26 [2020-07-28 18:16:37,220 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:16:37,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/afnp2014.i [2020-07-28 18:16:37,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79ceec10/400508cdf74b42f18e0b5c701f93abd9/FLAG772098a26 [2020-07-28 18:16:37,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79ceec10/400508cdf74b42f18e0b5c701f93abd9 [2020-07-28 18:16:37,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:16:37,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:16:37,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:16:37,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:16:37,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:16:37,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f648f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37, skipping insertion in model container [2020-07-28 18:16:37,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:16:37,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:16:37,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:16:37,789 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:16:37,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:16:37,821 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:16:37,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37 WrapperNode [2020-07-28 18:16:37,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:16:37,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:16:37,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:16:37,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:16:37,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:16:37,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:16:37,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:16:37,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:16:37,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (1/1) ... [2020-07-28 18:16:37,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:16:37,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:16:37,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:16:37,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:16:37,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (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 [2020-07-28 18:16:38,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:16:38,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:16:38,195 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:16:38,196 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:16:38,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:38 BoogieIcfgContainer [2020-07-28 18:16:38,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:16:38,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:16:38,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:16:38,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:16:38,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:16:37" (1/3) ... [2020-07-28 18:16:38,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1cab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:16:38, skipping insertion in model container [2020-07-28 18:16:38,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:37" (2/3) ... [2020-07-28 18:16:38,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1cab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:16:38, skipping insertion in model container [2020-07-28 18:16:38,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:38" (3/3) ... [2020-07-28 18:16:38,210 INFO L109 eAbstractionObserver]: Analyzing ICFG afnp2014.i [2020-07-28 18:16:38,221 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:16:38,229 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:16:38,253 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:16:38,282 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:16:38,282 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:16:38,283 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:16:38,283 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:16:38,283 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:16:38,284 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:16:38,284 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:16:38,284 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:16:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-28 18:16:38,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:16:38,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:38,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:16:38,314 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:38,322 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2020-07-28 18:16:38,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:38,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263666404] [2020-07-28 18:16:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:38,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} havoc main_#res;havoc main_#t~nondet0, main_#t~short1, main_~x~0, main_~y~0;main_~x~0 := 1;main_~y~0 := 0; {15#true} is VALID [2020-07-28 18:16:38,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} assume !true; {16#false} is VALID [2020-07-28 18:16:38,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#false} __VERIFIER_assert_#in~cond := (if main_~x~0 >= main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 18:16:38,461 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 18:16:38,461 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 18:16:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:38,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263666404] [2020-07-28 18:16:38,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:16:38,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:16:38,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853204273] [2020-07-28 18:16:38,474 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:16:38,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:38,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:16:38,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:38,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:16:38,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:16:38,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:16:38,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:16:38,516 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-28 18:16:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:38,558 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-28 18:16:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:16:38,559 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:16:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:16:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2020-07-28 18:16:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:16:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2020-07-28 18:16:38,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 23 transitions. [2020-07-28 18:16:38,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:38,629 INFO L225 Difference]: With dead ends: 20 [2020-07-28 18:16:38,629 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 18:16:38,633 INFO L675 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 [2020-07-28 18:16:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 18:16:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 18:16:38,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:38,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:38,667 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:38,667 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:38,670 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:16:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:16:38,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:38,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:38,672 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:38,672 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:38,674 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:16:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:16:38,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:38,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:38,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:38,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:16:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-28 18:16:38,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2020-07-28 18:16:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:38,680 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-28 18:16:38,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:16:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:16:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:16:38,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:38,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:38,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:16:38,683 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:38,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:38,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1484098869, now seen corresponding path program 1 times [2020-07-28 18:16:38,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:38,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728703798] [2020-07-28 18:16:38,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:38,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {69#true} havoc main_#res;havoc main_#t~nondet0, main_#t~short1, main_~x~0, main_~y~0;main_~x~0 := 1;main_~y~0 := 0; {71#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:38,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {71#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} main_#t~short1 := main_~y~0 < 1000; {71#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:38,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {71#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {71#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:38,795 INFO L280 TraceCheckUtils]: 3: Hoare triple {71#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} assume !main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0; {71#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:38,796 INFO L280 TraceCheckUtils]: 4: Hoare triple {71#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} __VERIFIER_assert_#in~cond := (if main_~x~0 >= main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {72#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:16:38,797 INFO L280 TraceCheckUtils]: 5: Hoare triple {72#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {70#false} is VALID [2020-07-28 18:16:38,798 INFO L280 TraceCheckUtils]: 6: Hoare triple {70#false} assume !false; {70#false} is VALID [2020-07-28 18:16:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:38,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728703798] [2020-07-28 18:16:38,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:16:38,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:16:38,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958943411] [2020-07-28 18:16:38,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 18:16:38,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:38,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:16:38,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:38,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:16:38,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:16:38,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:16:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:16:38,818 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2020-07-28 18:16:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:38,892 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 18:16:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:16:38,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 18:16:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:16:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-28 18:16:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:16:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-28 18:16:38,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 17 transitions. [2020-07-28 18:16:38,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:38,927 INFO L225 Difference]: With dead ends: 15 [2020-07-28 18:16:38,927 INFO L226 Difference]: Without dead ends: 11 [2020-07-28 18:16:38,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:16:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-28 18:16:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-28 18:16:38,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:38,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:38,934 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:38,934 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:38,936 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-28 18:16:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-28 18:16:38,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:38,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:38,937 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:38,937 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:38,939 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-28 18:16:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-28 18:16:38,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:38,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:38,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:38,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:16:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-07-28 18:16:38,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2020-07-28 18:16:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:38,942 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-28 18:16:38,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:16:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-28 18:16:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:16:38,943 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:38,943 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:38,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:16:38,944 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash 935349177, now seen corresponding path program 1 times [2020-07-28 18:16:38,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:38,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972501090] [2020-07-28 18:16:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:39,057 INFO L280 TraceCheckUtils]: 0: Hoare triple {129#true} havoc main_#res;havoc main_#t~nondet0, main_#t~short1, main_~x~0, main_~y~0;main_~x~0 := 1;main_~y~0 := 0; {131#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {131#(<= 1 ULTIMATE.start_main_~x~0)} main_#t~short1 := main_~y~0 < 1000; {131#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#(<= 1 ULTIMATE.start_main_~x~0)} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {131#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,061 INFO L280 TraceCheckUtils]: 3: Hoare triple {131#(<= 1 ULTIMATE.start_main_~x~0)} assume !!main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0;main_~x~0 := main_~x~0 + main_~y~0;main_~y~0 := 1 + main_~y~0; {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,062 INFO L280 TraceCheckUtils]: 4: Hoare triple {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} main_#t~short1 := main_~y~0 < 1000; {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,063 INFO L280 TraceCheckUtils]: 5: Hoare triple {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,064 INFO L280 TraceCheckUtils]: 6: Hoare triple {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} assume !main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0; {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,065 INFO L280 TraceCheckUtils]: 7: Hoare triple {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} __VERIFIER_assert_#in~cond := (if main_~x~0 >= main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {133#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:16:39,066 INFO L280 TraceCheckUtils]: 8: Hoare triple {133#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {130#false} is VALID [2020-07-28 18:16:39,067 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-28 18:16:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:39,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972501090] [2020-07-28 18:16:39,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803212890] [2020-07-28 18:16:39,070 INFO L95 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 [2020-07-28 18:16:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:39,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 18:16:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:39,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:39,404 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:16:39,449 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:16:39,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {129#true} havoc main_#res;havoc main_#t~nondet0, main_#t~short1, main_~x~0, main_~y~0;main_~x~0 := 1;main_~y~0 := 0; {131#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {131#(<= 1 ULTIMATE.start_main_~x~0)} main_#t~short1 := main_~y~0 < 1000; {131#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#(<= 1 ULTIMATE.start_main_~x~0)} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {131#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,511 INFO L280 TraceCheckUtils]: 3: Hoare triple {131#(<= 1 ULTIMATE.start_main_~x~0)} assume !!main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0;main_~x~0 := main_~x~0 + main_~y~0;main_~y~0 := 1 + main_~y~0; {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,512 INFO L280 TraceCheckUtils]: 4: Hoare triple {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} main_#t~short1 := main_~y~0 < 1000; {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,514 INFO L280 TraceCheckUtils]: 5: Hoare triple {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,516 INFO L280 TraceCheckUtils]: 6: Hoare triple {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} assume !main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0; {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:39,517 INFO L280 TraceCheckUtils]: 7: Hoare triple {132#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} __VERIFIER_assert_#in~cond := (if main_~x~0 >= main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {158#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:16:39,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {158#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {130#false} is VALID [2020-07-28 18:16:39,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-28 18:16:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:39,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:16:39,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-28 18:16:39,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099938127] [2020-07-28 18:16:39,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-28 18:16:39,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:39,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:16:39,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:39,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:16:39,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:16:39,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:16:39,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:16:39,546 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2020-07-28 18:16:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:39,638 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-28 18:16:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:16:39,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-28 18:16:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:16:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-28 18:16:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:16:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-28 18:16:39,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2020-07-28 18:16:39,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:39,673 INFO L225 Difference]: With dead ends: 18 [2020-07-28 18:16:39,673 INFO L226 Difference]: Without dead ends: 14 [2020-07-28 18:16:39,674 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:16:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-28 18:16:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-28 18:16:39,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:39,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:39,681 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:39,681 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:39,683 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-28 18:16:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-28 18:16:39,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:39,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:39,684 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:39,684 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:39,686 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-28 18:16:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-28 18:16:39,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:39,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:39,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:39,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:16:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-28 18:16:39,690 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2020-07-28 18:16:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:39,690 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-28 18:16:39,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:16:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-28 18:16:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 18:16:39,691 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:39,692 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2020-07-28 18:16:39,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 18:16:39,906 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash 570926091, now seen corresponding path program 2 times [2020-07-28 18:16:39,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:39,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284458345] [2020-07-28 18:16:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:40,000 INFO L280 TraceCheckUtils]: 0: Hoare triple {234#true} havoc main_#res;havoc main_#t~nondet0, main_#t~short1, main_~x~0, main_~y~0;main_~x~0 := 1;main_~y~0 := 0; {236#(<= 1 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 18:16:40,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#(<= 1 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} main_#t~short1 := main_~y~0 < 1000; {236#(<= 1 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 18:16:40,002 INFO L280 TraceCheckUtils]: 2: Hoare triple {236#(<= 1 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {236#(<= 1 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 18:16:40,003 INFO L280 TraceCheckUtils]: 3: Hoare triple {236#(<= 1 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} assume !!main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0;main_~x~0 := main_~x~0 + main_~y~0;main_~y~0 := 1 + main_~y~0; {237#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,004 INFO L280 TraceCheckUtils]: 4: Hoare triple {237#(<= 1 ULTIMATE.start_main_~x~0)} main_#t~short1 := main_~y~0 < 1000; {237#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,005 INFO L280 TraceCheckUtils]: 5: Hoare triple {237#(<= 1 ULTIMATE.start_main_~x~0)} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {237#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,006 INFO L280 TraceCheckUtils]: 6: Hoare triple {237#(<= 1 ULTIMATE.start_main_~x~0)} assume !!main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0;main_~x~0 := main_~x~0 + main_~y~0;main_~y~0 := 1 + main_~y~0; {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} main_#t~short1 := main_~y~0 < 1000; {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,008 INFO L280 TraceCheckUtils]: 8: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} assume !main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0; {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,010 INFO L280 TraceCheckUtils]: 10: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} __VERIFIER_assert_#in~cond := (if main_~x~0 >= main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {239#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:16:40,011 INFO L280 TraceCheckUtils]: 11: Hoare triple {239#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {235#false} is VALID [2020-07-28 18:16:40,012 INFO L280 TraceCheckUtils]: 12: Hoare triple {235#false} assume !false; {235#false} is VALID [2020-07-28 18:16:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:40,013 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284458345] [2020-07-28 18:16:40,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075894188] [2020-07-28 18:16:40,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:16:40,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:16:40,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:16:40,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 18:16:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:40,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:40,278 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:16:40,313 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:16:40,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {234#true} havoc main_#res;havoc main_#t~nondet0, main_#t~short1, main_~x~0, main_~y~0;main_~x~0 := 1;main_~y~0 := 0; {243#(and (<= 1 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 18:16:40,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {243#(and (<= 1 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0))} main_#t~short1 := main_~y~0 < 1000; {243#(and (<= 1 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 18:16:40,359 INFO L280 TraceCheckUtils]: 2: Hoare triple {243#(and (<= 1 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0))} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {243#(and (<= 1 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-28 18:16:40,361 INFO L280 TraceCheckUtils]: 3: Hoare triple {243#(and (<= 1 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0))} assume !!main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0;main_~x~0 := main_~x~0 + main_~y~0;main_~y~0 := 1 + main_~y~0; {237#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,362 INFO L280 TraceCheckUtils]: 4: Hoare triple {237#(<= 1 ULTIMATE.start_main_~x~0)} main_#t~short1 := main_~y~0 < 1000; {237#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,363 INFO L280 TraceCheckUtils]: 5: Hoare triple {237#(<= 1 ULTIMATE.start_main_~x~0)} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {237#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,364 INFO L280 TraceCheckUtils]: 6: Hoare triple {237#(<= 1 ULTIMATE.start_main_~x~0)} assume !!main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0;main_~x~0 := main_~x~0 + main_~y~0;main_~y~0 := 1 + main_~y~0; {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,365 INFO L280 TraceCheckUtils]: 7: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} main_#t~short1 := main_~y~0 < 1000; {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,366 INFO L280 TraceCheckUtils]: 8: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} assume main_#t~short1;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_#t~short1 := 0 != main_#t~nondet0; {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,368 INFO L280 TraceCheckUtils]: 9: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} assume !main_#t~short1;havoc main_#t~short1;havoc main_#t~nondet0; {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:16:40,369 INFO L280 TraceCheckUtils]: 10: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)} __VERIFIER_assert_#in~cond := (if main_~x~0 >= main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {274#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:16:40,369 INFO L280 TraceCheckUtils]: 11: Hoare triple {274#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {235#false} is VALID [2020-07-28 18:16:40,370 INFO L280 TraceCheckUtils]: 12: Hoare triple {235#false} assume !false; {235#false} is VALID [2020-07-28 18:16:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:40,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:16:40,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-28 18:16:40,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849959523] [2020-07-28 18:16:40,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-28 18:16:40,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:40,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:16:40,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:40,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:16:40,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:16:40,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:16:40,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:16:40,395 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 8 states. [2020-07-28 18:16:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:40,481 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-28 18:16:40,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:16:40,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-28 18:16:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:16:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-28 18:16:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:16:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-28 18:16:40,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2020-07-28 18:16:40,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:40,497 INFO L225 Difference]: With dead ends: 14 [2020-07-28 18:16:40,497 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:16:40,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:16:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:16:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:16:40,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:40,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:16:40,499 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:16:40,499 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:16:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:40,500 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:16:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:16:40,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:40,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:40,501 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:16:40,501 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:16:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:40,501 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:16:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:16:40,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:40,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:40,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:40,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:16:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:16:40,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-28 18:16:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:40,503 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:16:40,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:16:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:16:40,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:40,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:16:40,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:16:40,747 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:16:40,747 INFO L271 CegarLoopResult]: At program point L21(lines 13 22) the Hoare annotation is: true [2020-07-28 18:16:40,747 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:16:40,747 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-28 18:16:40,748 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:16:40,748 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:16:40,748 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:16:40,748 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-28 18:16:40,748 INFO L268 CegarLoopResult]: For program point L16-3(lines 16 19) no Hoare annotation was computed. [2020-07-28 18:16:40,748 INFO L264 CegarLoopResult]: At program point L16-5(lines 16 19) the Hoare annotation is: (and (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0) (<= 1 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0)) [2020-07-28 18:16:40,749 INFO L268 CegarLoopResult]: For program point L16-6(lines 16 19) no Hoare annotation was computed. [2020-07-28 18:16:40,749 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-28 18:16:40,753 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:16:40,754 WARN L170 areAnnotationChecker]: L16-6 has no Hoare annotation [2020-07-28 18:16:40,754 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-28 18:16:40,754 WARN L170 areAnnotationChecker]: L16-6 has no Hoare annotation [2020-07-28 18:16:40,754 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-28 18:16:40,754 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-28 18:16:40,754 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:16:40,754 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:16:40,755 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2020-07-28 18:16:40,755 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2020-07-28 18:16:40,755 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:16:40,755 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:16:40,755 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:16:40,755 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:16:40,756 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:16:40,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:16:40 BoogieIcfgContainer [2020-07-28 18:16:40,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:16:40,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:16:40,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:16:40,768 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:16:40,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:38" (3/4) ... [2020-07-28 18:16:40,773 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:16:40,784 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:16:40,785 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:16:40,833 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:16:40,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:16:40,837 INFO L168 Benchmark]: Toolchain (without parser) took 3264.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 961.6 MB in the beginning and 870.1 MB in the end (delta: 91.5 MB). Peak memory consumption was 213.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:16:40,837 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:16:40,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.29 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:16:40,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.85 ms. Allocated memory is still 1.0 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:16:40,839 INFO L168 Benchmark]: Boogie Preprocessor took 77.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:16:40,840 INFO L168 Benchmark]: RCFGBuilder took 266.78 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:16:40,840 INFO L168 Benchmark]: TraceAbstraction took 2565.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.1 MB in the end (delta: 229.4 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:16:40,841 INFO L168 Benchmark]: Witness Printer took 65.67 ms. Allocated memory is still 1.2 GB. Free memory is still 870.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:16:40,845 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.29 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.85 ms. Allocated memory is still 1.0 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 266.78 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2565.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.1 MB in the end (delta: 229.4 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. * Witness Printer took 65.67 ms. Allocated memory is still 1.2 GB. Free memory is still 870.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (y <= x && 1 <= x) && 0 <= y - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 SDtfs, 11 SDslu, 33 SDs, 0 SdLazy, 30 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 6 NumberOfFragments, 12 HoareAnnotationTreeSize, 3 FomulaSimplifications, 16 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1669 SizeOfPredicates, 8 NumberOfNonLiveVariables, 68 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...