./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test_cut_trace.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/ldv-regression/test_cut_trace.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa918e27d73dead2f011063ee4df28e5f424dc3f0d36e3805fb1a8f2e9758de1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:50:20,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:50:20,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:50:20,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:50:20,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:50:20,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:50:20,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:50:20,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:50:20,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:50:20,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:50:20,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:50:20,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:50:20,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:50:20,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:50:20,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:50:20,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:50:20,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:50:20,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:50:20,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:50:20,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:50:20,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:50:20,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:50:20,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:50:20,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:50:20,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:50:20,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:50:20,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:50:20,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:50:20,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:50:20,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:50:20,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:50:20,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:50:20,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:50:20,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:50:20,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:50:20,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:50:20,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:50:20,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:50:20,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:50:20,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:50:20,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:50:20,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:50:20,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:50:20,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:50:20,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:50:20,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:50:20,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:50:20,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:50:20,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:50:20,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:50:20,296 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:50:20,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:50:20,297 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:50:20,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:50:20,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:50:20,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:50:20,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:50:20,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:50:20,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:50:20,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:50:20,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:50:20,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:50:20,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:50:20,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:50:20,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:50:20,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:50:20,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:20,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:50:20,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:50:20,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:50:20,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:50:20,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:50:20,301 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:50:20,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:50:20,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:50:20,301 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 ! call(reach_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 -> aa918e27d73dead2f011063ee4df28e5f424dc3f0d36e3805fb1a8f2e9758de1 [2022-02-20 16:50:20,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:50:20,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:50:20,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:50:20,521 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:50:20,522 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:50:20,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test_cut_trace.i [2022-02-20 16:50:20,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e1260e5/4085cdc7b4ec4553832f638792993e23/FLAGec7cc3bd3 [2022-02-20 16:50:20,925 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:50:20,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test_cut_trace.i [2022-02-20 16:50:20,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e1260e5/4085cdc7b4ec4553832f638792993e23/FLAGec7cc3bd3 [2022-02-20 16:50:21,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e1260e5/4085cdc7b4ec4553832f638792993e23 [2022-02-20 16:50:21,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:50:21,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:50:21,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:21,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:50:21,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:50:21,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504d0cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21, skipping insertion in model container [2022-02-20 16:50:21,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:50:21,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:50:21,479 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/ldv-regression/test_cut_trace.i[296,309] [2022-02-20 16:50:21,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:21,508 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:50:21,518 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/ldv-regression/test_cut_trace.i[296,309] [2022-02-20 16:50:21,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:21,540 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:50:21,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21 WrapperNode [2022-02-20 16:50:21,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:21,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:21,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:50:21,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:50:21,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,563 INFO L137 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-20 16:50:21,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:21,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:50:21,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:50:21,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:50:21,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:50:21,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:50:21,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:50:21,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:50:21,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (1/1) ... [2022-02-20 16:50:21,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:21,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:21,608 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-20 16:50:21,627 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-20 16:50:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:50:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2022-02-20 16:50:21,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2022-02-20 16:50:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:50:21,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:50:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:50:21,679 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:50:21,680 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:50:21,730 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:50:21,735 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:50:21,738 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:50:21,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:21 BoogieIcfgContainer [2022-02-20 16:50:21,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:50:21,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:50:21,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:50:21,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:50:21,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:50:21" (1/3) ... [2022-02-20 16:50:21,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acfdfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:21, skipping insertion in model container [2022-02-20 16:50:21,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:21" (2/3) ... [2022-02-20 16:50:21,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acfdfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:21, skipping insertion in model container [2022-02-20 16:50:21,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:21" (3/3) ... [2022-02-20 16:50:21,745 INFO L111 eAbstractionObserver]: Analyzing ICFG test_cut_trace.i [2022-02-20 16:50:21,749 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:50:21,750 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:50:21,784 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:50:21,788 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=PETRI_NET, 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-20 16:50:21,789 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:50:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:50:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 16:50:21,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:21,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 16:50:21,807 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash 31559054, now seen corresponding path program 1 times [2022-02-20 16:50:21,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:21,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096230187] [2022-02-20 16:50:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:21,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#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(17, 2);call #Ultimate.allocInit(12, 3); {18#true} is VALID [2022-02-20 16:50:21,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~z~0#1, main_~a~0#1;havoc main_~z~0#1;havoc main_~a~0#1;main_~z~0#1 := 0; {20#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 16:50:21,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#(= |ULTIMATE.start_main_~z~0#1| 0)} assume !(0 == main_~z~0#1); {19#false} is VALID [2022-02-20 16:50:21,965 INFO L272 TraceCheckUtils]: 3: Hoare triple {19#false} call __blast_assert(); {19#false} is VALID [2022-02-20 16:50:21,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {19#false} assume !false; {19#false} is VALID [2022-02-20 16:50:21,966 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-20 16:50:21,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:21,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096230187] [2022-02-20 16:50:21,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096230187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:21,967 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:21,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:50:21,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735300691] [2022-02-20 16:50:21,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:21,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 16:50:21,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:21,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:21,992 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-20 16:50:21,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:50:21,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:22,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:50:22,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:22,065 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:22,108 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 16:50:22,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:50:22,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 16:50:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 16:50:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 16:50:22,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-02-20 16:50:22,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:22,168 INFO L225 Difference]: With dead ends: 24 [2022-02-20 16:50:22,169 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 16:50:22,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:22,173 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:22,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 16:50:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 16:50:22,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:22,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,200 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,200 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:22,203 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2022-02-20 16:50:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2022-02-20 16:50:22,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:22,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:22,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2022-02-20 16:50:22,204 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2022-02-20 16:50:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:22,205 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2022-02-20 16:50:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2022-02-20 16:50:22,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:22,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:22,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:22,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2022-02-20 16:50:22,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 5 [2022-02-20 16:50:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:22,210 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2022-02-20 16:50:22,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2022-02-20 16:50:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:50:22,211 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:22,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:22,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:50:22,212 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:22,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash 261293423, now seen corresponding path program 1 times [2022-02-20 16:50:22,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:22,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345552966] [2022-02-20 16:50:22,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:22,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#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(17, 2);call #Ultimate.allocInit(12, 3); {80#true} is VALID [2022-02-20 16:50:22,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~z~0#1, main_~a~0#1;havoc main_~z~0#1;havoc main_~a~0#1;main_~z~0#1 := 0; {82#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 16:50:22,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#(= |ULTIMATE.start_main_~z~0#1| 0)} assume 0 == main_~z~0#1; {82#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 16:50:22,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#(= |ULTIMATE.start_main_~z~0#1| 0)} main_~a~0#1 := main_~z~0#1; {83#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 16:50:22,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {83#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(0 == main_~a~0#1); {81#false} is VALID [2022-02-20 16:50:22,248 INFO L272 TraceCheckUtils]: 5: Hoare triple {81#false} call __blast_assert(); {81#false} is VALID [2022-02-20 16:50:22,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#false} assume !false; {81#false} is VALID [2022-02-20 16:50:22,249 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-20 16:50:22,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:22,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345552966] [2022-02-20 16:50:22,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345552966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:22,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:22,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:50:22,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475366268] [2022-02-20 16:50:22,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:22,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:50:22,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:22,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,267 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-20 16:50:22,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:50:22,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:22,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:50:22,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:50:22,268 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:22,296 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2022-02-20 16:50:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:50:22,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:50:22,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-02-20 16:50:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-02-20 16:50:22,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 7 transitions. [2022-02-20 16:50:22,308 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-20 16:50:22,308 INFO L225 Difference]: With dead ends: 8 [2022-02-20 16:50:22,308 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:50:22,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 16:50:22,309 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:22,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 4 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:50:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:50:22,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:22,311 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-20 16:50:22,311 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-20 16:50:22,311 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-20 16:50:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:22,311 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:50:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:50:22,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:22,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:22,312 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-20 16:50:22,312 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-20 16:50:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:22,312 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:50:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:50:22,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:22,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:22,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:22,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:22,312 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-20 16:50:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:50:22,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2022-02-20 16:50:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:22,313 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:50:22,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:50:22,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:22,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:50:22,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:50:22,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:50:22,328 INFO L858 garLoopResultBuilder]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-02-20 16:50:22,328 INFO L858 garLoopResultBuilder]: For program point __blast_assertEXIT(lines 6 9) no Hoare annotation was computed. [2022-02-20 16:50:22,328 INFO L858 garLoopResultBuilder]: For program point __blast_assertFINAL(lines 6 9) no Hoare annotation was computed. [2022-02-20 16:50:22,328 INFO L861 garLoopResultBuilder]: At program point __blast_assertENTRY(lines 6 9) the Hoare annotation is: true [2022-02-20 16:50:22,328 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:50:22,328 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:50:22,328 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:50:22,328 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:50:22,329 INFO L854 garLoopResultBuilder]: At program point L21(lines 15 22) the Hoare annotation is: (= |ULTIMATE.start_main_~z~0#1| 0) [2022-02-20 16:50:22,329 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-02-20 16:50:22,329 INFO L858 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2022-02-20 16:50:22,329 INFO L854 garLoopResultBuilder]: At program point L20-2(line 20) the Hoare annotation is: false [2022-02-20 16:50:22,330 INFO L858 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2022-02-20 16:50:22,330 INFO L854 garLoopResultBuilder]: At program point L18-2(line 18) the Hoare annotation is: false [2022-02-20 16:50:22,330 INFO L858 garLoopResultBuilder]: For program point L18-3(line 18) no Hoare annotation was computed. [2022-02-20 16:50:22,332 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:50:22,333 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:50:22,339 WARN L170 areAnnotationChecker]: __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-20 16:50:22,340 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:50:22,341 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:50:22,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:50:22 BoogieIcfgContainer [2022-02-20 16:50:22,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:50:22,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:50:22,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:50:22,347 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:50:22,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:21" (3/4) ... [2022-02-20 16:50:22,349 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:50:22,352 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2022-02-20 16:50:22,354 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 16:50:22,354 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:50:22,354 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:50:22,354 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:50:22,372 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:50:22,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:50:22,373 INFO L158 Benchmark]: Toolchain (without parser) took 1015.20ms. Allocated memory is still 100.7MB. Free memory was 66.7MB in the beginning and 61.1MB in the end (delta: 5.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-02-20 16:50:22,373 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:50:22,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.08ms. Allocated memory is still 100.7MB. Free memory was 66.5MB in the beginning and 76.9MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:50:22,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.69ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 75.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:50:22,374 INFO L158 Benchmark]: Boogie Preprocessor took 19.17ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 74.4MB in the end (delta: 900.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:50:22,374 INFO L158 Benchmark]: RCFGBuilder took 154.81ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 66.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:50:22,374 INFO L158 Benchmark]: TraceAbstraction took 605.55ms. Allocated memory is still 100.7MB. Free memory was 65.3MB in the beginning and 63.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2022-02-20 16:50:22,375 INFO L158 Benchmark]: Witness Printer took 25.79ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:50:22,377 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.14ms. Allocated memory is still 77.6MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.08ms. Allocated memory is still 100.7MB. Free memory was 66.5MB in the beginning and 76.9MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.69ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 75.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.17ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 74.4MB in the end (delta: 900.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 154.81ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 66.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 605.55ms. Allocated memory is still 100.7MB. Free memory was 65.3MB in the beginning and 63.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. * Witness Printer took 25.79ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. 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: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 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, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 11 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred 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, 4 LocationsWithAnnotation, 6 PreInvPairs, 7 NumberOfFragments, 6 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 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 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: z == 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:50:22,403 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