./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark33_linear.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-zilu/benchmark33_linear.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0401d70d4c8ea9c434a0d70dc3e862e9d9144b8f78274b8265998d58d02bfd69 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:11:52,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:11:52,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:11:52,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:11:52,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:11:52,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:11:52,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:11:52,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:11:52,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:11:52,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:11:52,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:11:52,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:11:52,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:11:52,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:11:52,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:11:52,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:11:52,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:11:52,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:11:52,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:11:52,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:11:52,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:11:52,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:11:52,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:11:52,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:11:52,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:11:52,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:11:52,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:11:52,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:11:52,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:11:52,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:11:52,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:11:52,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:11:52,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:11:52,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:11:52,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:11:52,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:11:52,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:11:52,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:11:52,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:11:52,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:11:52,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:11:52,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:11:52,439 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:11:52,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:11:52,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:11:52,440 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:11:52,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:11:52,441 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:11:52,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:11:52,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:11:52,442 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:11:52,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:11:52,443 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:11:52,443 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:11:52,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:11:52,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:11:52,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:11:52,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:11:52,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:11:52,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:11:52,444 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:11:52,445 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:11:52,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:11:52,445 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:11:52,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:11:52,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:11:52,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:11:52,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:11:52,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:11:52,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:11:52,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:11:52,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:11:52,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:11:52,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:11:52,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:11:52,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 ! overflow) ) 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 -> 0401d70d4c8ea9c434a0d70dc3e862e9d9144b8f78274b8265998d58d02bfd69 [2022-02-21 03:11:52,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:11:52,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:11:52,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:11:52,641 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:11:52,641 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:11:52,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark33_linear.i [2022-02-21 03:11:52,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8850ce69/558b870dd8a447fd979186a227eb2df4/FLAG7c7c99be0 [2022-02-21 03:11:52,991 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:11:52,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark33_linear.i [2022-02-21 03:11:52,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8850ce69/558b870dd8a447fd979186a227eb2df4/FLAG7c7c99be0 [2022-02-21 03:11:53,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8850ce69/558b870dd8a447fd979186a227eb2df4 [2022-02-21 03:11:53,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:11:53,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:11:53,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:11:53,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:11:53,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:11:53,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54012fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53, skipping insertion in model container [2022-02-21 03:11:53,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:11:53,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:11:53,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark33_linear.i[868,881] [2022-02-21 03:11:53,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:11:53,572 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:11:53,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark33_linear.i[868,881] [2022-02-21 03:11:53,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:11:53,593 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:11:53,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53 WrapperNode [2022-02-21 03:11:53,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:11:53,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:11:53,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:11:53,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:11:53,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,617 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2022-02-21 03:11:53,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:11:53,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:11:53,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:11:53,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:11:53,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:11:53,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:11:53,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:11:53,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:11:53,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (1/1) ... [2022-02-21 03:11:53,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:11:53,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:53,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:11:53,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:11:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:11:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:11:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:11:53,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:11:53,744 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:11:53,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:11:53,859 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:11:53,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:11:53,864 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:11:53,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:11:53 BoogieIcfgContainer [2022-02-21 03:11:53,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:11:53,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:11:53,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:11:53,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:11:53,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:11:53" (1/3) ... [2022-02-21 03:11:53,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38504bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:11:53, skipping insertion in model container [2022-02-21 03:11:53,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:11:53" (2/3) ... [2022-02-21 03:11:53,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38504bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:11:53, skipping insertion in model container [2022-02-21 03:11:53,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:11:53" (3/3) ... [2022-02-21 03:11:53,872 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark33_linear.i [2022-02-21 03:11:53,875 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:11:53,875 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 03:11:53,905 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:11:53,915 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:11:53,915 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 03:11:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:11:53,959 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:53,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:11:53,960 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:11:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash 28695973, now seen corresponding path program 1 times [2022-02-21 03:11:53,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:53,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986764212] [2022-02-21 03:11:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:54,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {17#true} is VALID [2022-02-21 03:11:54,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {17#true} is VALID [2022-02-21 03:11:54,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#true} assume !!(main_~x~0#1 >= 0); {17#true} is VALID [2022-02-21 03:11:54,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {17#true} assume !!(main_~x~0#1 < 100 && main_~x~0#1 >= 0);main_#t~post2#1 := main_~x~0#1; {19#(<= |ULTIMATE.start_main_#t~post2#1| 99)} is VALID [2022-02-21 03:11:54,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {19#(<= |ULTIMATE.start_main_#t~post2#1| 99)} assume !(1 + main_#t~post2#1 <= 2147483647); {18#false} is VALID [2022-02-21 03:11:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:54,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:54,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986764212] [2022-02-21 03:11:54,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986764212] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:11:54,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:11:54,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:11:54,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089239468] [2022-02-21 03:11:54,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:11:54,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:11:54,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:54,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:54,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:11:54,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:54,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:11:54,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:11:54,235 INFO L87 Difference]: Start difference. First operand has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:54,293 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-21 03:11:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:11:54,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:11:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 03:11:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 03:11:54,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-21 03:11:54,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:54,342 INFO L225 Difference]: With dead ends: 20 [2022-02-21 03:11:54,344 INFO L226 Difference]: Without dead ends: 7 [2022-02-21 03:11:54,346 INFO L932 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 [2022-02-21 03:11:54,351 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:54,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:11:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-02-21 03:11:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-02-21 03:11:54,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:54,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,369 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,370 INFO L87 Difference]: Start difference. First operand 7 states. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:54,372 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2022-02-21 03:11:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-21 03:11:54,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:54,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:54,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7 states. [2022-02-21 03:11:54,373 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7 states. [2022-02-21 03:11:54,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:54,375 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2022-02-21 03:11:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-21 03:11:54,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:54,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:54,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:54,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-02-21 03:11:54,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-02-21 03:11:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:54,382 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-02-21 03:11:54,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-21 03:11:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:11:54,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:54,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:11:54,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:11:54,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:11:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:54,387 INFO L85 PathProgramCache]: Analyzing trace with hash 889575213, now seen corresponding path program 1 times [2022-02-21 03:11:54,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:54,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974478154] [2022-02-21 03:11:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:54,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {67#true} is VALID [2022-02-21 03:11:54,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {67#true} is VALID [2022-02-21 03:11:54,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume !!(main_~x~0#1 >= 0); {69#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:11:54,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {69#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 < 100 && main_~x~0#1 >= 0);main_#t~post2#1 := main_~x~0#1; {70#(<= 0 |ULTIMATE.start_main_#t~post2#1|)} is VALID [2022-02-21 03:11:54,428 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#(<= 0 |ULTIMATE.start_main_#t~post2#1|)} assume 1 + main_#t~post2#1 <= 2147483647; {70#(<= 0 |ULTIMATE.start_main_#t~post2#1|)} is VALID [2022-02-21 03:11:54,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {70#(<= 0 |ULTIMATE.start_main_#t~post2#1|)} assume !(1 + main_#t~post2#1 >= -2147483648); {68#false} is VALID [2022-02-21 03:11:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:54,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:54,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974478154] [2022-02-21 03:11:54,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974478154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:11:54,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:11:54,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:11:54,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059123260] [2022-02-21 03:11:54,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:11:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:11:54,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:54,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:54,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:11:54,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:11:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:11:54,438 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:54,460 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2022-02-21 03:11:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:11:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:11:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-02-21 03:11:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-02-21 03:11:54,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 7 transitions. [2022-02-21 03:11:54,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:54,468 INFO L225 Difference]: With dead ends: 7 [2022-02-21 03:11:54,468 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:11:54,468 INFO L932 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 [2022-02-21 03:11:54,469 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:54,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:11:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:11:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:11:54,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:54,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,471 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,471 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:54,471 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:11:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:11:54,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:54,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:54,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:11:54,472 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:11:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:54,472 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:11:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:11:54,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:54,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:54,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:54,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:11:54,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2022-02-21 03:11:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:54,474 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:11:54,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:11:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:11:54,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:54,476 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2022-02-21 03:11:54,477 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2022-02-21 03:11:54,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:11:54,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:11:54,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2022-02-21 03:11:54,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:11:54,485 INFO L858 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-02-21 03:11:54,485 INFO L858 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-02-21 03:11:54,485 INFO L858 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-02-21 03:11:54,486 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-02-21 03:11:54,486 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:11:54,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2022-02-21 03:11:54,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:11:54,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:11:54,486 INFO L861 garLoopResultBuilder]: At program point L26(lines 19 27) the Hoare annotation is: true [2022-02-21 03:11:54,487 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 24) the Hoare annotation is: (<= 0 |ULTIMATE.start_main_~x~0#1|) [2022-02-21 03:11:54,487 INFO L858 garLoopResultBuilder]: For program point L22-3(lines 22 24) no Hoare annotation was computed. [2022-02-21 03:11:54,487 INFO L858 garLoopResultBuilder]: For program point L14(lines 14 18) no Hoare annotation was computed. [2022-02-21 03:11:54,489 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-21 03:11:54,490 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:11:54,493 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:11:54,493 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:11:54,493 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:11:54,493 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:11:54,494 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:11:54,494 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-21 03:11:54,494 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-21 03:11:54,494 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:11:54,494 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:11:54,494 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-21 03:11:54,494 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:11:54,494 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:11:54,494 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-21 03:11:54,495 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-21 03:11:54,495 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:11:54,495 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:11:54,495 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-21 03:11:54,495 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:11:54,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:11:54 BoogieIcfgContainer [2022-02-21 03:11:54,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:11:54,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:11:54,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:11:54,501 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:11:54,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:11:53" (3/4) ... [2022-02-21 03:11:54,503 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:11:54,509 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-21 03:11:54,509 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-21 03:11:54,509 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-21 03:11:54,509 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:11:54,528 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:11:54,528 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:11:54,529 INFO L158 Benchmark]: Toolchain (without parser) took 1098.83ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 61.6MB in the beginning and 67.4MB in the end (delta: -5.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-02-21 03:11:54,530 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:11:54,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.12ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 61.4MB in the beginning and 89.1MB in the end (delta: -27.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:11:54,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.89ms. Allocated memory is still 113.2MB. Free memory was 89.1MB in the beginning and 87.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:11:54,531 INFO L158 Benchmark]: Boogie Preprocessor took 13.15ms. Allocated memory is still 113.2MB. Free memory was 87.4MB in the beginning and 86.6MB in the end (delta: 732.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:11:54,531 INFO L158 Benchmark]: RCFGBuilder took 233.97ms. Allocated memory is still 113.2MB. Free memory was 86.6MB in the beginning and 76.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:11:54,531 INFO L158 Benchmark]: TraceAbstraction took 633.64ms. Allocated memory is still 113.2MB. Free memory was 76.3MB in the beginning and 69.5MB in the end (delta: 6.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-02-21 03:11:54,532 INFO L158 Benchmark]: Witness Printer took 27.93ms. Allocated memory is still 113.2MB. Free memory was 69.5MB in the beginning and 67.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:11:54,533 INFO L339 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.16ms. Allocated memory is still 92.3MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.12ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 61.4MB in the beginning and 89.1MB in the end (delta: -27.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.89ms. Allocated memory is still 113.2MB. Free memory was 89.1MB in the beginning and 87.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.15ms. Allocated memory is still 113.2MB. Free memory was 87.4MB in the beginning and 86.6MB in the end (delta: 732.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 233.97ms. Allocated memory is still 113.2MB. Free memory was 86.6MB in the beginning and 76.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 633.64ms. Allocated memory is still 113.2MB. Free memory was 76.3MB in the beginning and 69.5MB in the end (delta: 6.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Witness Printer took 27.93ms. Allocated memory is still 113.2MB. Free memory was 69.5MB in the beginning and 67.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 14 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 3 NumberOfFragments, 4 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 <= x RESULT: Ultimate proved your program to be correct! [2022-02-21 03:11:54,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE