./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash 66690b8f2afac00b38604fc5fd1edb6c2524e6892200d6512ef98cf0032d8df1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:29:21,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:29:21,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 05:29:21,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:29:21,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:29:21,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:29:21,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:29:21,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:29:21,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:29:21,890 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:29:21,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:29:21,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:29:21,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:29:21,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:29:21,891 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:29:21,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:29:21,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:29:21,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:29:21,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:29:21,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:29:21,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:29:21,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:29:21,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:29:21,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:29:21,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:29:21,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:29:21,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:29:21,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:29:21,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:29:21,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:29:21,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:29:21,895 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66690b8f2afac00b38604fc5fd1edb6c2524e6892200d6512ef98cf0032d8df1 [2025-02-06 05:29:22,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:29:22,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:29:22,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:29:22,130 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:29:22,131 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:29:22,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2025-02-06 05:29:23,337 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aab14ee8d/d16276f864e343d893d195a0a59fb176/FLAGe245f40de [2025-02-06 05:29:23,804 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:29:23,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2025-02-06 05:29:23,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aab14ee8d/d16276f864e343d893d195a0a59fb176/FLAGe245f40de [2025-02-06 05:29:23,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aab14ee8d/d16276f864e343d893d195a0a59fb176 [2025-02-06 05:29:23,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:29:23,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:29:23,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:29:23,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:29:23,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:29:23,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:29:23" (1/1) ... [2025-02-06 05:29:23,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4478ad11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:23, skipping insertion in model container [2025-02-06 05:29:23,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:29:23" (1/1) ... [2025-02-06 05:29:23,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:29:24,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i[141033,141046] [2025-02-06 05:29:24,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:29:24,417 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:29:24,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4823-4824] [2025-02-06 05:29:24,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4826-4827] [2025-02-06 05:29:24,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4830-4831] [2025-02-06 05:29:24,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4833-4834] [2025-02-06 05:29:24,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4837-4838] [2025-02-06 05:29:24,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i[141033,141046] [2025-02-06 05:29:24,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:29:24,618 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:29:24,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24 WrapperNode [2025-02-06 05:29:24,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:29:24,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:29:24,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:29:24,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:29:24,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,661 INFO L138 Inliner]: procedures = 49, calls = 66, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 183 [2025-02-06 05:29:24,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:29:24,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:29:24,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:29:24,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:29:24,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,700 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 3, 9, 3]. 53 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 4, 3]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-06 05:29:24,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:29:24,725 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:29:24,726 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:29:24,726 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:29:24,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (1/1) ... [2025-02-06 05:29:24,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:29:24,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:29:24,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 05:29:24,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 05:29:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:29:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:29:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:29:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:29:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 05:29:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2025-02-06 05:29:24,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2025-02-06 05:29:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-02-06 05:29:24,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-02-06 05:29:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 05:29:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 05:29:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 05:29:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 05:29:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:29:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:29:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:29:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 05:29:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:29:24,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:29:24,952 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:29:24,954 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:29:25,150 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5119: havoc sock_register_#t~nondet58#1; [2025-02-06 05:29:25,151 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5099: havoc ldv_undefined_int_#t~nondet56#1; [2025-02-06 05:29:25,151 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5092: havoc __request_module_#t~nondet55#1; [2025-02-06 05:29:25,151 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4960: assume false; [2025-02-06 05:29:25,151 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4960: assume !false; [2025-02-06 05:29:25,172 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-02-06 05:29:25,172 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:29:25,179 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:29:25,179 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:29:25,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:29:25 BoogieIcfgContainer [2025-02-06 05:29:25,179 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:29:25,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:29:25,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:29:25,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:29:25,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:29:23" (1/3) ... [2025-02-06 05:29:25,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca52454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:29:25, skipping insertion in model container [2025-02-06 05:29:25,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:24" (2/3) ... [2025-02-06 05:29:25,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca52454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:29:25, skipping insertion in model container [2025-02-06 05:29:25,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:29:25" (3/3) ... [2025-02-06 05:29:25,193 INFO L128 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-pppox.ko.cil.out.i [2025-02-06 05:29:25,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:29:25,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG module_get_put-drivers-net-pppox.ko.cil.out.i that has 3 procedures, 49 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-06 05:29:25,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:29:25,257 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7098d157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:29:25,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:29:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 45 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 05:29:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 05:29:25,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:25,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:25,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:25,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1364817559, now seen corresponding path program 1 times [2025-02-06 05:29:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:25,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266959167] [2025-02-06 05:29:25,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:25,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 05:29:25,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 05:29:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:29:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266959167] [2025-02-06 05:29:25,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266959167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:25,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:25,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 05:29:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309155681] [2025-02-06 05:29:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:25,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:29:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:25,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:29:25,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:29:25,468 INFO L87 Difference]: Start difference. First operand has 49 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 45 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2025-02-06 05:29:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:25,508 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2025-02-06 05:29:25,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:29:25,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2025-02-06 05:29:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:25,513 INFO L225 Difference]: With dead ends: 125 [2025-02-06 05:29:25,514 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 05:29:25,515 INFO L434 NwaCegarLoop]: 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 [2025-02-06 05:29:25,520 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:25,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 97 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:29:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 05:29:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-02-06 05:29:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 64 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 05:29:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2025-02-06 05:29:25,544 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 10 [2025-02-06 05:29:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:25,545 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2025-02-06 05:29:25,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2025-02-06 05:29:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2025-02-06 05:29:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 05:29:25,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:25,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:25,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 05:29:25,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:25,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:25,546 INFO L85 PathProgramCache]: Analyzing trace with hash 804959036, now seen corresponding path program 1 times [2025-02-06 05:29:25,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:25,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677728327] [2025-02-06 05:29:25,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:25,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:25,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 05:29:25,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 05:29:25,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:25,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:29:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:25,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677728327] [2025-02-06 05:29:25,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677728327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:25,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:25,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:29:25,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300601026] [2025-02-06 05:29:25,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:25,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:29:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:25,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:29:25,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:29:25,714 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 05:29:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:25,745 INFO L93 Difference]: Finished difference Result 129 states and 167 transitions. [2025-02-06 05:29:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:29:25,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 05:29:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:25,747 INFO L225 Difference]: With dead ends: 129 [2025-02-06 05:29:25,747 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 05:29:25,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:29:25,748 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:25,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:29:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 05:29:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 05:29:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 61 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 05:29:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2025-02-06 05:29:25,752 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 27 [2025-02-06 05:29:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:25,752 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2025-02-06 05:29:25,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 05:29:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2025-02-06 05:29:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 05:29:25,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:25,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:25,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:29:25,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1663541847, now seen corresponding path program 1 times [2025-02-06 05:29:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814687112] [2025-02-06 05:29:25,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:25,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 05:29:25,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 05:29:25,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:25,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:29:25,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814687112] [2025-02-06 05:29:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814687112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 05:29:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386149160] [2025-02-06 05:29:25,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:25,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:29:25,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:25,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:29:25,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:29:25,944 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 05:29:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:25,983 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2025-02-06 05:29:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:29:25,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 05:29:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:25,986 INFO L225 Difference]: With dead ends: 106 [2025-02-06 05:29:25,988 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 05:29:25,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:29:25,988 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 49 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:25,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 160 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:29:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 05:29:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2025-02-06 05:29:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 89 states have internal predecessors, (116), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 05:29:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2025-02-06 05:29:26,003 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 29 [2025-02-06 05:29:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:26,003 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2025-02-06 05:29:26,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 05:29:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2025-02-06 05:29:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 05:29:26,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:26,005 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:26,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:29:26,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:26,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1330837190, now seen corresponding path program 1 times [2025-02-06 05:29:26,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:26,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890916047] [2025-02-06 05:29:26,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:26,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:26,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 05:29:26,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 05:29:26,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:26,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:29:26,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:26,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890916047] [2025-02-06 05:29:26,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890916047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:26,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:26,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:29:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781316088] [2025-02-06 05:29:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:26,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:29:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:26,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:29:26,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:29:26,130 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2025-02-06 05:29:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:26,156 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2025-02-06 05:29:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:29:26,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 33 [2025-02-06 05:29:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:26,159 INFO L225 Difference]: With dead ends: 165 [2025-02-06 05:29:26,159 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 05:29:26,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:29:26,160 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:26,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:29:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 05:29:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 05:29:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 89 states have internal predecessors, (114), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 05:29:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2025-02-06 05:29:26,172 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 33 [2025-02-06 05:29:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:26,172 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2025-02-06 05:29:26,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2025-02-06 05:29:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2025-02-06 05:29:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 05:29:26,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:26,174 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:26,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 05:29:26,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:26,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash -161049996, now seen corresponding path program 1 times [2025-02-06 05:29:26,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:26,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684021135] [2025-02-06 05:29:26,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:26,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:26,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 05:29:26,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 05:29:26,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:26,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:29:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684021135] [2025-02-06 05:29:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684021135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:26,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:26,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 05:29:26,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860279019] [2025-02-06 05:29:26,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:26,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:29:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:26,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:29:26,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:29:26,841 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 05:29:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:26,925 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2025-02-06 05:29:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:29:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-02-06 05:29:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:26,928 INFO L225 Difference]: With dead ends: 157 [2025-02-06 05:29:26,928 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 05:29:26,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:29:26,929 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:26,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 305 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:29:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 05:29:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2025-02-06 05:29:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 05:29:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2025-02-06 05:29:26,939 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 40 [2025-02-06 05:29:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:26,940 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2025-02-06 05:29:26,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 05:29:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2025-02-06 05:29:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 05:29:26,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:26,940 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:26,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:29:26,941 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:26,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1535117776, now seen corresponding path program 1 times [2025-02-06 05:29:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:26,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947309925] [2025-02-06 05:29:26,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:26,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 05:29:26,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 05:29:26,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:26,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 05:29:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:27,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947309925] [2025-02-06 05:29:27,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947309925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:27,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:27,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 05:29:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533108208] [2025-02-06 05:29:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:27,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:29:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:27,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:29:27,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:29:27,175 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 05:29:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:27,218 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2025-02-06 05:29:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:29:27,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-02-06 05:29:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:27,220 INFO L225 Difference]: With dead ends: 75 [2025-02-06 05:29:27,220 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 05:29:27,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:29:27,220 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:27,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 92 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:29:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 05:29:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-06 05:29:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 05:29:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-02-06 05:29:27,229 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 42 [2025-02-06 05:29:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:27,229 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-02-06 05:29:27,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 05:29:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-02-06 05:29:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 05:29:27,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:27,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:27,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 05:29:27,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:27,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash -991948100, now seen corresponding path program 1 times [2025-02-06 05:29:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:27,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129563872] [2025-02-06 05:29:27,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:27,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 05:29:27,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 05:29:27,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:27,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:29:27,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:27,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129563872] [2025-02-06 05:29:27,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129563872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:27,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:27,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:29:27,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092372498] [2025-02-06 05:29:27,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:27,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:29:27,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:27,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:29:27,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:29:27,394 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 05:29:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:27,404 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2025-02-06 05:29:27,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:29:27,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-02-06 05:29:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:27,405 INFO L225 Difference]: With dead ends: 67 [2025-02-06 05:29:27,405 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 05:29:27,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:29:27,406 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 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 [2025-02-06 05:29:27,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:29:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 05:29:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 05:29:27,408 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) [2025-02-06 05:29:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 05:29:27,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2025-02-06 05:29:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:27,408 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 05:29:27,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 05:29:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 05:29:27,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 05:29:27,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 05:29:27,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 05:29:27,414 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:27,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 05:29:27,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 05:29:27,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:29:27 BoogieIcfgContainer [2025-02-06 05:29:27,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 05:29:27,484 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 05:29:27,484 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 05:29:27,484 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 05:29:27,485 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:29:25" (3/4) ... [2025-02-06 05:29:27,486 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 05:29:27,490 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2025-02-06 05:29:27,491 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2025-02-06 05:29:27,496 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-06 05:29:27,497 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 05:29:27,497 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 05:29:27,497 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 05:29:27,578 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 05:29:27,578 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 05:29:27,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 05:29:27,579 INFO L158 Benchmark]: Toolchain (without parser) took 3679.06ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 100.7MB in the beginning and 241.1MB in the end (delta: -140.4MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2025-02-06 05:29:27,580 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 167.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:29:27,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.12ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 91.5MB in the end (delta: 9.1MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2025-02-06 05:29:27,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.77ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:29:27,580 INFO L158 Benchmark]: Boogie Preprocessor took 58.89ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 86.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:29:27,580 INFO L158 Benchmark]: IcfgBuilder took 454.42ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 67.0MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 05:29:27,580 INFO L158 Benchmark]: TraceAbstraction took 2302.12ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 67.0MB in the beginning and 247.5MB in the end (delta: -180.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:29:27,581 INFO L158 Benchmark]: Witness Printer took 94.33ms. Allocated memory is still 310.4MB. Free memory was 247.5MB in the beginning and 241.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 05:29:27,582 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 167.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.12ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 91.5MB in the end (delta: 9.1MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.77ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.89ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 86.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 454.42ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 67.0MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2302.12ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 67.0MB in the beginning and 247.5MB in the end (delta: -180.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 94.33ms. Allocated memory is still 310.4MB. Free memory was 247.5MB in the beginning and 241.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4823]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4823-4824] - GenericResultAtLocation [Line: 4826]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4826-4827] - GenericResultAtLocation [Line: 4830]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4830-4831] - GenericResultAtLocation [Line: 4833]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4833-4834] - GenericResultAtLocation [Line: 4837]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4837-4838] * 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: 4995]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 1115 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 748 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 367 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=3, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 05:29:27,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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