./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.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-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:37:58,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:37:58,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:37:58,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:37:58,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:37:58,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:37:58,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:37:58,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:37:58,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:37:58,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:37:58,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:37:58,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:37:58,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:37:58,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:37:58,962 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:37:58,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:37:58,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:37:58,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:37:58,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:37:58,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:37:58,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:37:58,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:37:58,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:37:58,963 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:37:58,963 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:37:58,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:37:58,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:37:58,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:37:58,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:37:58,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:37:58,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:37:58,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:37:58,964 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:37:58,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:37:58,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:37:58,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:37:58,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:37:58,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:37:58,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:37:58,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:37:58,964 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/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 -> e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 [2025-03-04 03:37:59,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:37:59,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:37:59,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:37:59,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:37:59,191 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:37:59,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2025-03-04 03:38:00,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f79750cd/96da65cc054a41f486a41f275575c22e/FLAG98b4279ae [2025-03-04 03:38:00,667 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:38:00,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2025-03-04 03:38:00,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f79750cd/96da65cc054a41f486a41f275575c22e/FLAG98b4279ae [2025-03-04 03:38:00,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f79750cd/96da65cc054a41f486a41f275575c22e [2025-03-04 03:38:00,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:38:00,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:38:00,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:38:00,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:38:00,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:38:00,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:38:00" (1/1) ... [2025-03-04 03:38:00,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4022b4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:00, skipping insertion in model container [2025-03-04 03:38:00,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:38:00" (1/1) ... [2025-03-04 03:38:00,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:38:01,306 WARN L250 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-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2025-03-04 03:38:01,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:38:01,330 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:38:01,428 WARN L250 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-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2025-03-04 03:38:01,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:38:01,470 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:38:01,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01 WrapperNode [2025-03-04 03:38:01,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:38:01,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:38:01,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:38:01,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:38:01,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,548 INFO L138 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1140 [2025-03-04 03:38:01,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:38:01,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:38:01,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:38:01,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:38:01,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,702 INFO L175 MemorySlicer]: Split 233 memory accesses to 13 slices as follows [2, 161, 7, 8, 10, 5, 6, 3, 18, 3, 2, 4, 4]. 69 percent of accesses are in the largest equivalence class. The 48 initializations are split as follows [2, 14, 7, 0, 0, 5, 6, 3, 0, 3, 2, 3, 3]. The 80 writes are split as follows [0, 66, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0]. [2025-03-04 03:38:01,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:38:01,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:38:01,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:38:01,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:38:01,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (1/1) ... [2025-03-04 03:38:01,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:38:01,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:38:01,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 03:38:01,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 03:38:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 03:38:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 03:38:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:38:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:38:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:38:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:38:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:38:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:38:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:38:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:38:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:38:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:38:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 03:38:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 03:38:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 03:38:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 03:38:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 03:38:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:38:01,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:38:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 03:38:01,849 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 03:38:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:38:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:38:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2025-03-04 03:38:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2025-03-04 03:38:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 03:38:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2025-03-04 03:38:01,851 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2025-03-04 03:38:01,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 03:38:01,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2025-03-04 03:38:01,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-04 03:38:01,851 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2025-03-04 03:38:01,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2025-03-04 03:38:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2025-03-04 03:38:01,852 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2025-03-04 03:38:01,852 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 03:38:01,852 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 03:38:01,854 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 03:38:01,855 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 03:38:01,855 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 03:38:01,855 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 03:38:01,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:38:01,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:38:01,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:38:01,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:38:01,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:38:01,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:38:01,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:38:01,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:38:01,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 03:38:01,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 03:38:01,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 03:38:01,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 03:38:01,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 03:38:01,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-03-04 03:38:01,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2025-03-04 03:38:01,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-03-04 03:38:01,857 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-03-04 03:38:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:38:01,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:38:02,131 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:38:02,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:38:02,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-04 03:38:02,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: havoc __fswab16_#t~bitwise1#1; [2025-03-04 03:38:02,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2554: havoc #t~nondet260; [2025-03-04 03:38:02,309 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2561: havoc ipmi_request_settime_#t~nondet261#1; [2025-03-04 03:38:02,309 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: havoc ipmi_validate_addr_#t~nondet264#1; [2025-03-04 03:38:02,322 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: havoc #t~nondet256; [2025-03-04 03:38:02,345 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: havoc __kmalloc_#t~ret39#1.base, __kmalloc_#t~ret39#1.offset; [2025-03-04 03:38:06,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1605: call ULTIMATE.dealloc(init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset);havoc init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset; [2025-03-04 03:38:06,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2332: call ULTIMATE.dealloc(main_~#var_group2~0#1.base, main_~#var_group2~0#1.offset);havoc main_~#var_group2~0#1.base, main_~#var_group2~0#1.offset;call ULTIMATE.dealloc(main_~#var_ibmpex_msg_handler_20_p1~0#1.base, main_~#var_ibmpex_msg_handler_20_p1~0#1.offset);havoc main_~#var_ibmpex_msg_handler_20_p1~0#1.base, main_~#var_ibmpex_msg_handler_20_p1~0#1.offset; [2025-03-04 03:38:06,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: havoc ipmi_smi_watcher_register_#t~nondet262#1; [2025-03-04 03:38:06,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2136: call ULTIMATE.dealloc(ibmpex_register_bmc_~#__key~1#1.base, ibmpex_register_bmc_~#__key~1#1.offset);havoc ibmpex_register_bmc_~#__key~1#1.base, ibmpex_register_bmc_~#__key~1#1.offset; [2025-03-04 03:38:06,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550: havoc ipmi_create_user_#t~nondet259#1; [2025-03-04 03:38:06,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2569: havoc ipmi_smi_watcher_unregister_#t~nondet263#1; [2025-03-04 03:38:06,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2524: havoc _dev_info_#t~nondet255#1; [2025-03-04 03:38:06,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: havoc hwmon_device_register_#t~ret258#1.base, hwmon_device_register_#t~ret258#1.offset; [2025-03-04 03:38:06,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752: havoc ibmpex_query_sensor_count_#t~mem91#1; [2025-03-04 03:38:06,972 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2025-03-04 03:38:06,972 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:38:06,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:38:06,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:38:06,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:06 BoogieIcfgContainer [2025-03-04 03:38:06,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:38:06,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:38:06,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:38:06,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:38:06,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:38:00" (1/3) ... [2025-03-04 03:38:06,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d30e07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:38:06, skipping insertion in model container [2025-03-04 03:38:06,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:01" (2/3) ... [2025-03-04 03:38:06,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d30e07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:38:06, skipping insertion in model container [2025-03-04 03:38:06,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:06" (3/3) ... [2025-03-04 03:38:06,998 INFO L128 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2025-03-04 03:38:07,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:38:07,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i that has 19 procedures, 303 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 03:38:07,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:38:07,086 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;@48e2577d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:38:07,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:38:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 229 states have (on average 1.296943231441048) internal successors, (297), 235 states have internal predecessors, (297), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 03:38:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 03:38:07,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:07,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:38:07,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:07,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:07,110 INFO L85 PathProgramCache]: Analyzing trace with hash -582463029, now seen corresponding path program 1 times [2025-03-04 03:38:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:07,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099309452] [2025-03-04 03:38:07,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:07,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:07,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 03:38:07,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 03:38:07,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:07,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 03:38:07,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099309452] [2025-03-04 03:38:07,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099309452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:07,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:07,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:38:07,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110007246] [2025-03-04 03:38:07,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:07,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:38:07,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:07,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:38:07,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:38:07,887 INFO L87 Difference]: Start difference. First operand has 303 states, 229 states have (on average 1.296943231441048) internal successors, (297), 235 states have internal predecessors, (297), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 03:38:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:07,999 INFO L93 Difference]: Finished difference Result 598 states and 810 transitions. [2025-03-04 03:38:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:38:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-03-04 03:38:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:08,012 INFO L225 Difference]: With dead ends: 598 [2025-03-04 03:38:08,012 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 03:38:08,017 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-03-04 03:38:08,020 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:08,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1173 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:38:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 03:38:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-04 03:38:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 221 states have (on average 1.2805429864253393) internal successors, (283), 225 states have internal predecessors, (283), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 03:38:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 385 transitions. [2025-03-04 03:38:08,066 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 385 transitions. Word has length 126 [2025-03-04 03:38:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:08,067 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 385 transitions. [2025-03-04 03:38:08,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 03:38:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 385 transitions. [2025-03-04 03:38:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 03:38:08,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:08,076 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 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, 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-03-04 03:38:08,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:38:08,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:08,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:08,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1576649248, now seen corresponding path program 1 times [2025-03-04 03:38:08,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:08,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128213338] [2025-03-04 03:38:08,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:08,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:08,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 03:38:08,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 03:38:08,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:08,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 03:38:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128213338] [2025-03-04 03:38:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128213338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:08,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:38:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799402715] [2025-03-04 03:38:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:08,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:38:08,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:08,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:38:08,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:38:08,541 INFO L87 Difference]: Start difference. First operand 291 states and 385 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 03:38:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:08,604 INFO L93 Difference]: Finished difference Result 576 states and 764 transitions. [2025-03-04 03:38:08,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:38:08,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-03-04 03:38:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:08,608 INFO L225 Difference]: With dead ends: 576 [2025-03-04 03:38:08,608 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 03:38:08,609 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-03-04 03:38:08,610 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 0 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:08,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1118 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:38:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 03:38:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-04 03:38:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 223 states have (on average 1.2780269058295963) internal successors, (285), 227 states have internal predecessors, (285), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 03:38:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 387 transitions. [2025-03-04 03:38:08,622 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 387 transitions. Word has length 137 [2025-03-04 03:38:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:08,622 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 387 transitions. [2025-03-04 03:38:08,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 03:38:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 387 transitions. [2025-03-04 03:38:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 03:38:08,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:08,629 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 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, 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-03-04 03:38:08,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:38:08,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:08,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1599281502, now seen corresponding path program 1 times [2025-03-04 03:38:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:08,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383357595] [2025-03-04 03:38:08,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:08,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 03:38:08,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 03:38:08,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:08,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 03:38:09,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:09,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383357595] [2025-03-04 03:38:09,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383357595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:09,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:09,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:38:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878394758] [2025-03-04 03:38:09,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:09,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:38:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:09,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:38:09,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:38:09,160 INFO L87 Difference]: Start difference. First operand 293 states and 387 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 03:38:13,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:38:17,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:38:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:17,546 INFO L93 Difference]: Finished difference Result 857 states and 1140 transitions. [2025-03-04 03:38:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:38:17,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-03-04 03:38:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:17,551 INFO L225 Difference]: With dead ends: 857 [2025-03-04 03:38:17,551 INFO L226 Difference]: Without dead ends: 853 [2025-03-04 03:38:17,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:38:17,552 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 681 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:17,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1601 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-04 03:38:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-04 03:38:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2025-03-04 03:38:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 651 states have (on average 1.2795698924731183) internal successors, (833), 661 states have internal predecessors, (833), 150 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (152), 148 states have call predecessors, (152), 148 states have call successors, (152) [2025-03-04 03:38:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1135 transitions. [2025-03-04 03:38:17,613 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1135 transitions. Word has length 137 [2025-03-04 03:38:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:17,613 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1135 transitions. [2025-03-04 03:38:17,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 03:38:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1135 transitions. [2025-03-04 03:38:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 03:38:17,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:17,616 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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, 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, 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-03-04 03:38:17,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:38:17,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:17,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash 603666058, now seen corresponding path program 1 times [2025-03-04 03:38:17,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:17,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144124812] [2025-03-04 03:38:17,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:17,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:17,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 03:38:17,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 03:38:17,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:17,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 03:38:17,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:17,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144124812] [2025-03-04 03:38:17,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144124812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:17,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:17,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:38:17,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292395953] [2025-03-04 03:38:17,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:17,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:38:17,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:17,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:38:17,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:38:17,967 INFO L87 Difference]: Start difference. First operand 853 states and 1135 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 03:38:21,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:38:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:22,047 INFO L93 Difference]: Finished difference Result 1700 states and 2265 transitions. [2025-03-04 03:38:22,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:38:22,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 147 [2025-03-04 03:38:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:22,058 INFO L225 Difference]: With dead ends: 1700 [2025-03-04 03:38:22,060 INFO L226 Difference]: Without dead ends: 1415 [2025-03-04 03:38:22,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-04 03:38:22,062 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 365 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:22,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1094 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-04 03:38:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2025-03-04 03:38:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1133. [2025-03-04 03:38:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 865 states have (on average 1.2786127167630057) internal successors, (1106), 878 states have internal predecessors, (1106), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2025-03-04 03:38:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1506 transitions. [2025-03-04 03:38:22,121 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1506 transitions. Word has length 147 [2025-03-04 03:38:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:22,121 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1506 transitions. [2025-03-04 03:38:22,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 03:38:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1506 transitions. [2025-03-04 03:38:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 03:38:22,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:22,125 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1] [2025-03-04 03:38:22,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:38:22,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:22,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash 51153668, now seen corresponding path program 1 times [2025-03-04 03:38:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:22,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877086583] [2025-03-04 03:38:22,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:22,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 03:38:22,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 03:38:22,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:22,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 03:38:22,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877086583] [2025-03-04 03:38:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877086583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:22,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:22,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:38:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180762088] [2025-03-04 03:38:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:22,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:38:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:22,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:38:22,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:38:22,487 INFO L87 Difference]: Start difference. First operand 1133 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 03:38:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:22,542 INFO L93 Difference]: Finished difference Result 2266 states and 3015 transitions. [2025-03-04 03:38:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:38:22,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 193 [2025-03-04 03:38:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:22,549 INFO L225 Difference]: With dead ends: 2266 [2025-03-04 03:38:22,550 INFO L226 Difference]: Without dead ends: 1141 [2025-03-04 03:38:22,552 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-03-04 03:38:22,555 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 0 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:22,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1130 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:38:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-04 03:38:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2025-03-04 03:38:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 873 states have (on average 1.2760595647193584) internal successors, (1114), 886 states have internal predecessors, (1114), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2025-03-04 03:38:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1514 transitions. [2025-03-04 03:38:22,636 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1514 transitions. Word has length 193 [2025-03-04 03:38:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:22,636 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1514 transitions. [2025-03-04 03:38:22,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 03:38:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1514 transitions. [2025-03-04 03:38:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 03:38:22,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:22,641 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1] [2025-03-04 03:38:22,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:38:22,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:22,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1627354730, now seen corresponding path program 1 times [2025-03-04 03:38:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682700602] [2025-03-04 03:38:22,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:22,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 03:38:22,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 03:38:22,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:22,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 03:38:22,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:22,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682700602] [2025-03-04 03:38:22,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682700602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:22,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:22,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:38:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137927520] [2025-03-04 03:38:22,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:22,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:38:22,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:22,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:38:22,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:38:22,964 INFO L87 Difference]: Start difference. First operand 1141 states and 1514 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 03:38:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:23,021 INFO L93 Difference]: Finished difference Result 2282 states and 3031 transitions. [2025-03-04 03:38:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:38:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 194 [2025-03-04 03:38:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:23,029 INFO L225 Difference]: With dead ends: 2282 [2025-03-04 03:38:23,029 INFO L226 Difference]: Without dead ends: 1149 [2025-03-04 03:38:23,033 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-03-04 03:38:23,034 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 0 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:23,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1130 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:38:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-03-04 03:38:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2025-03-04 03:38:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 881 states have (on average 1.2735527809307605) internal successors, (1122), 894 states have internal predecessors, (1122), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2025-03-04 03:38:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1522 transitions. [2025-03-04 03:38:23,088 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1522 transitions. Word has length 194 [2025-03-04 03:38:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:23,089 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1522 transitions. [2025-03-04 03:38:23,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 03:38:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1522 transitions. [2025-03-04 03:38:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 03:38:23,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:23,094 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1] [2025-03-04 03:38:23,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:38:23,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:23,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -246729854, now seen corresponding path program 1 times [2025-03-04 03:38:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:23,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354912504] [2025-03-04 03:38:23,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:23,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:23,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 03:38:23,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 03:38:23,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:23,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 03:38:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354912504] [2025-03-04 03:38:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354912504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:23,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:38:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372503070] [2025-03-04 03:38:23,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:23,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:38:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:23,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:38:23,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:38:23,502 INFO L87 Difference]: Start difference. First operand 1149 states and 1522 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 03:38:23,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:23,592 INFO L93 Difference]: Finished difference Result 2590 states and 3477 transitions. [2025-03-04 03:38:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:38:23,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 195 [2025-03-04 03:38:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:23,601 INFO L225 Difference]: With dead ends: 2590 [2025-03-04 03:38:23,601 INFO L226 Difference]: Without dead ends: 1449 [2025-03-04 03:38:23,603 INFO L434 NwaCegarLoop]: 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 [2025-03-04 03:38:23,604 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 85 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:23,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1323 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:38:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-03-04 03:38:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1232. [2025-03-04 03:38:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 956 states have (on average 1.2792887029288702) internal successors, (1223), 969 states have internal predecessors, (1223), 207 states have call successors, (207), 69 states have call predecessors, (207), 68 states have return successors, (209), 205 states have call predecessors, (209), 205 states have call successors, (209) [2025-03-04 03:38:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1639 transitions. [2025-03-04 03:38:23,655 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1639 transitions. Word has length 195 [2025-03-04 03:38:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:23,656 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1639 transitions. [2025-03-04 03:38:23,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 03:38:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1639 transitions. [2025-03-04 03:38:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 03:38:23,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:23,658 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-04 03:38:23,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:38:23,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash -790468952, now seen corresponding path program 1 times [2025-03-04 03:38:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519083458] [2025-03-04 03:38:23,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:23,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 03:38:23,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 03:38:23,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:23,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 03:38:24,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519083458] [2025-03-04 03:38:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519083458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:24,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:24,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:38:24,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112228860] [2025-03-04 03:38:24,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:24,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:38:24,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:24,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:38:24,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:38:24,023 INFO L87 Difference]: Start difference. First operand 1232 states and 1639 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 03:38:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:24,099 INFO L93 Difference]: Finished difference Result 2464 states and 3281 transitions. [2025-03-04 03:38:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:38:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 196 [2025-03-04 03:38:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:24,108 INFO L225 Difference]: With dead ends: 2464 [2025-03-04 03:38:24,108 INFO L226 Difference]: Without dead ends: 1240 [2025-03-04 03:38:24,110 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-03-04 03:38:24,111 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 15 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:24,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1096 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:38:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2025-03-04 03:38:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2025-03-04 03:38:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 964 states have (on average 1.2769709543568464) internal successors, (1231), 977 states have internal predecessors, (1231), 207 states have call successors, (207), 69 states have call predecessors, (207), 68 states have return successors, (209), 205 states have call predecessors, (209), 205 states have call successors, (209) [2025-03-04 03:38:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1647 transitions. [2025-03-04 03:38:24,153 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1647 transitions. Word has length 196 [2025-03-04 03:38:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:24,153 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1647 transitions. [2025-03-04 03:38:24,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 03:38:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1647 transitions. [2025-03-04 03:38:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 03:38:24,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:24,156 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-04 03:38:24,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:38:24,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:24,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash -805987670, now seen corresponding path program 1 times [2025-03-04 03:38:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:24,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631643613] [2025-03-04 03:38:24,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:24,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:24,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 03:38:24,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 03:38:24,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:24,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 03:38:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:24,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631643613] [2025-03-04 03:38:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631643613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:38:24,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883135738] [2025-03-04 03:38:24,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:24,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:38:24,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:38:24,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:38:24,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 03:38:25,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 03:38:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 03:38:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:25,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 2253 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:38:25,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:38:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 03:38:25,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:38:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 03:38:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883135738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:38:25,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:38:25,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-04 03:38:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221517063] [2025-03-04 03:38:25,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:38:25,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:38:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:25,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:38:25,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:38:25,458 INFO L87 Difference]: Start difference. First operand 1240 states and 1647 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 03:38:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:25,593 INFO L93 Difference]: Finished difference Result 3006 states and 4071 transitions. [2025-03-04 03:38:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:38:25,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 196 [2025-03-04 03:38:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:25,601 INFO L225 Difference]: With dead ends: 3006 [2025-03-04 03:38:25,601 INFO L226 Difference]: Without dead ends: 1774 [2025-03-04 03:38:25,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:38:25,604 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 90 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:25,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1518 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:38:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-03-04 03:38:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1640. [2025-03-04 03:38:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1316 states have (on average 1.2940729483282676) internal successors, (1703), 1329 states have internal predecessors, (1703), 255 states have call successors, (255), 69 states have call predecessors, (255), 68 states have return successors, (257), 253 states have call predecessors, (257), 253 states have call successors, (257) [2025-03-04 03:38:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2215 transitions. [2025-03-04 03:38:25,675 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2215 transitions. Word has length 196 [2025-03-04 03:38:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:25,675 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2215 transitions. [2025-03-04 03:38:25,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 03:38:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2215 transitions. [2025-03-04 03:38:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-04 03:38:25,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:25,679 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:38:25,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 03:38:25,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:38:25,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:25,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -734688654, now seen corresponding path program 1 times [2025-03-04 03:38:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:25,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402987981] [2025-03-04 03:38:25,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:25,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:26,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 03:38:26,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 03:38:26,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:26,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-04 03:38:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402987981] [2025-03-04 03:38:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402987981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:26,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:38:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981734971] [2025-03-04 03:38:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:26,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:38:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:26,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:38:26,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:38:26,313 INFO L87 Difference]: Start difference. First operand 1640 states and 2215 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 03:38:30,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:38:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:30,464 INFO L93 Difference]: Finished difference Result 3999 states and 5399 transitions. [2025-03-04 03:38:30,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:38:30,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 209 [2025-03-04 03:38:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:30,474 INFO L225 Difference]: With dead ends: 3999 [2025-03-04 03:38:30,474 INFO L226 Difference]: Without dead ends: 1160 [2025-03-04 03:38:30,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:38:30,480 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 356 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:30,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 2547 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:38:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-03-04 03:38:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1125. [2025-03-04 03:38:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 893 states have (on average 1.265397536394177) internal successors, (1130), 903 states have internal predecessors, (1130), 180 states have call successors, (180), 52 states have call predecessors, (180), 51 states have return successors, (180), 178 states have call predecessors, (180), 178 states have call successors, (180) [2025-03-04 03:38:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1490 transitions. [2025-03-04 03:38:30,518 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1490 transitions. Word has length 209 [2025-03-04 03:38:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:30,520 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1490 transitions. [2025-03-04 03:38:30,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 03:38:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1490 transitions. [2025-03-04 03:38:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-04 03:38:30,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:30,523 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:38:30,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 03:38:30,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:30,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1128797194, now seen corresponding path program 1 times [2025-03-04 03:38:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:30,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078606799] [2025-03-04 03:38:30,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:30,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 03:38:30,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 03:38:30,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:30,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-04 03:38:30,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078606799] [2025-03-04 03:38:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078606799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:30,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:30,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:38:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835900662] [2025-03-04 03:38:30,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:30,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:38:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:30,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:38:30,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:38:30,930 INFO L87 Difference]: Start difference. First operand 1125 states and 1490 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 03:38:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:31,001 INFO L93 Difference]: Finished difference Result 2269 states and 3008 transitions. [2025-03-04 03:38:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:38:31,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 230 [2025-03-04 03:38:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:31,008 INFO L225 Difference]: With dead ends: 2269 [2025-03-04 03:38:31,008 INFO L226 Difference]: Without dead ends: 1152 [2025-03-04 03:38:31,011 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-03-04 03:38:31,011 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 16 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:31,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1172 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:38:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-03-04 03:38:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1033. [2025-03-04 03:38:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 809 states have (on average 1.2509270704573547) internal successors, (1012), 819 states have internal predecessors, (1012), 172 states have call successors, (172), 52 states have call predecessors, (172), 51 states have return successors, (172), 170 states have call predecessors, (172), 170 states have call successors, (172) [2025-03-04 03:38:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1356 transitions. [2025-03-04 03:38:31,050 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1356 transitions. Word has length 230 [2025-03-04 03:38:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:31,051 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1356 transitions. [2025-03-04 03:38:31,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 03:38:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1356 transitions. [2025-03-04 03:38:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-04 03:38:31,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:38:31,055 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:38:31,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 03:38:31,056 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:38:31,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:38:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 852189120, now seen corresponding path program 1 times [2025-03-04 03:38:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:38:31,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639645245] [2025-03-04 03:38:31,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:38:31,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:38:31,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-04 03:38:31,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 03:38:31,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:38:31,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:38:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-04 03:38:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:38:31,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639645245] [2025-03-04 03:38:31,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639645245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:38:31,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:38:31,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:38:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587621535] [2025-03-04 03:38:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:38:31,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:38:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:38:31,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:38:31,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:38:31,595 INFO L87 Difference]: Start difference. First operand 1033 states and 1356 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 5 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 03:38:35,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:38:39,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:38:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:38:39,994 INFO L93 Difference]: Finished difference Result 1373 states and 1806 transitions. [2025-03-04 03:38:39,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:38:39,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 5 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 248 [2025-03-04 03:38:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:38:39,997 INFO L225 Difference]: With dead ends: 1373 [2025-03-04 03:38:39,997 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 03:38:39,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:38:40,000 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 1191 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 192 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:38:40,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 669 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 114 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-04 03:38:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 03:38:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 03:38:40,000 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-03-04 03:38:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 03:38:40,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2025-03-04 03:38:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:38:40,002 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 03:38:40,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 5 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 03:38:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 03:38:40,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 03:38:40,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 03:38:40,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 03:38:40,006 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:38:40,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 03:38:44,351 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 03:38:44,359 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,359 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,359 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,359 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,359 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,360 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,361 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,361 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,361 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,361 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-03-04 03:38:44,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:38:44 BoogieIcfgContainer [2025-03-04 03:38:44,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 03:38:44,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 03:38:44,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 03:38:44,362 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 03:38:44,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:06" (3/4) ... [2025-03-04 03:38:44,363 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kzalloc [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmalloc [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure extract_value [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2025-03-04 03:38:44,367 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2025-03-04 03:38:44,382 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2025-03-04 03:38:44,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2025-03-04 03:38:44,384 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 03:38:44,385 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 03:38:44,386 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 03:38:44,387 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 03:38:44,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 03:38:44,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 03:38:44,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 03:38:44,493 INFO L158 Benchmark]: Toolchain (without parser) took 43637.61ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 102.1MB in the beginning and 313.5MB in the end (delta: -211.4MB). Peak memory consumption was 266.7MB. Max. memory is 16.1GB. [2025-03-04 03:38:44,493 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 126.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 03:38:44,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.63ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 54.8MB in the end (delta: 47.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 03:38:44,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.15ms. Allocated memory is still 142.6MB. Free memory was 54.8MB in the beginning and 46.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 03:38:44,493 INFO L158 Benchmark]: Boogie Preprocessor took 245.45ms. Allocated memory is still 142.6MB. Free memory was 46.4MB in the beginning and 83.9MB in the end (delta: -37.4MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2025-03-04 03:38:44,493 INFO L158 Benchmark]: IcfgBuilder took 5192.54ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 37.4MB in the end (delta: 46.4MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2025-03-04 03:38:44,494 INFO L158 Benchmark]: TraceAbstraction took 37370.87ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 37.4MB in the beginning and 330.3MB in the end (delta: -292.9MB). Peak memory consumption was 328.5MB. Max. memory is 16.1GB. [2025-03-04 03:38:44,494 INFO L158 Benchmark]: Witness Printer took 130.67ms. Allocated memory is still 620.8MB. Free memory was 330.3MB in the beginning and 313.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 03:38:44,494 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.30ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 126.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.63ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 54.8MB in the end (delta: 47.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.15ms. Allocated memory is still 142.6MB. Free memory was 54.8MB in the beginning and 46.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 245.45ms. Allocated memory is still 142.6MB. Free memory was 46.4MB in the beginning and 83.9MB in the end (delta: -37.4MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * IcfgBuilder took 5192.54ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 37.4MB in the end (delta: 46.4MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. * TraceAbstraction took 37370.87ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 37.4MB in the beginning and 330.3MB in the end (delta: -292.9MB). Peak memory consumption was 328.5MB. Max. memory is 16.1GB. * Witness Printer took 130.67ms. Allocated memory is still 620.8MB. Free memory was 330.3MB in the beginning and 313.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 * 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: 2415]: 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 19 procedures, 303 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.0s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 2838 SdHoareTripleChecker+Valid, 25.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2799 mSDsluCounter, 15571 SdHoareTripleChecker+Invalid, 24.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10111 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 667 IncrementalHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 5460 mSDtfsCounter, 667 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 416 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1640occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 787 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2404 NumberOfCodeBlocks, 2404 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2586 ConstructedInterpolants, 0 QuantifiedInterpolants, 3340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2253 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 1245/1248 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 - InvariantResult [Line: 1993]: Location Invariant Derived location invariant: ((((((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) 2 + ldv_count_2) <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (ldv_call_dev_attr_of_sensor_device_attribute == 1))) || ((ldv_call_dev_attr_of_sensor_device_attribute == 1) && (((long) 5 + ldv_count_2) <= ldv_count_1))) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) - InvariantResult [Line: 1990]: Location Invariant Derived location invariant: ((((((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) 2 + ldv_count_2) <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (ldv_call_dev_attr_of_sensor_device_attribute == 1))) || ((ldv_call_dev_attr_of_sensor_device_attribute == 1) && (((long) 5 + ldv_count_2) <= ldv_count_1))) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) RESULT: Ultimate proved your program to be correct! [2025-03-04 03:38:44,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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