./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:05:29,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:05:29,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:05:29,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:05:29,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:05:29,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:05:29,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:05:29,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:05:29,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:05:29,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:05:29,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:05:29,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:05:29,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:05:29,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:05:29,103 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:05:29,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:05:29,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:05:29,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:05:29,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:05:29,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:05:29,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:05:29,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:05:29,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:05:29,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:05:29,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:05:29,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:05:29,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:05:29,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:05:29,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:05:29,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:05:29,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:05:29,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:05:29,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:05:29,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:05:29,106 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 [2025-01-09 18:05:29,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:05:29,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:05:29,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:05:29,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:05:29,317 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:05:29,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2025-01-09 18:05:30,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35bceb7eb/d679ac1e5ba1421cb4b91178e2cc3643/FLAG9b900f610 [2025-01-09 18:05:30,945 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:05:30,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2025-01-09 18:05:30,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35bceb7eb/d679ac1e5ba1421cb4b91178e2cc3643/FLAG9b900f610 [2025-01-09 18:05:30,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35bceb7eb/d679ac1e5ba1421cb4b91178e2cc3643 [2025-01-09 18:05:30,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:05:30,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:05:30,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:05:31,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:05:31,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:05:31,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:05:30" (1/1) ... [2025-01-09 18:05:31,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7da3e09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31, skipping insertion in model container [2025-01-09 18:05:31,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:05:30" (1/1) ... [2025-01-09 18:05:31,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:05:31,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2025-01-09 18:05:31,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:05:31,601 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:05:31,686 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2025-01-09 18:05:31,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:05:31,743 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:05:31,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31 WrapperNode [2025-01-09 18:05:31,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:05:31,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:05:31,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:05:31,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:05:31,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:31,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:31,808 INFO L138 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1140 [2025-01-09 18:05:31,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:05:31,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:05:31,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:05:31,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:05:31,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:31,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:31,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:31,954 INFO L175 MemorySlicer]: Split 233 memory accesses to 13 slices as follows [2, 18, 10, 7, 5, 8, 6, 161, 3, 3, 2, 4, 4]. 69 percent of accesses are in the largest equivalence class. The 48 initializations are split as follows [2, 0, 0, 7, 5, 0, 6, 14, 3, 3, 2, 3, 3]. The 80 writes are split as follows [0, 14, 0, 0, 0, 0, 0, 66, 0, 0, 0, 0, 0]. [2025-01-09 18:05:31,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:31,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:32,004 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:32,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:32,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:32,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:32,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:32,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:05:32,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:05:32,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:05:32,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:05:32,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (1/1) ... [2025-01-09 18:05:32,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:05:32,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:05:32,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:05:32,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:05:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:05:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:05:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:05:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:05:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 18:05:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:05:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:05:32,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:05:32,118 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:05:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:05:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:05:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:05:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:05:32,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:05:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2025-01-09 18:05:32,120 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2025-01-09 18:05:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:05:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:05:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2025-01-09 18:05:32,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2025-01-09 18:05:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:05:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:05:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2025-01-09 18:05:32,122 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2025-01-09 18:05:32,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 18:05:32,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2025-01-09 18:05:32,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2025-01-09 18:05:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-01-09 18:05:32,122 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-01-09 18:05:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:05:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2025-01-09 18:05:32,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2025-01-09 18:05:32,124 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2025-01-09 18:05:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 18:05:32,124 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 18:05:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 18:05:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-01-09 18:05:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2025-01-09 18:05:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-01-09 18:05:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-01-09 18:05:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:05:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:05:32,410 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:05:32,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:05:37,612 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2025-01-09 18:05:37,615 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:05:37,637 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:05:37,638 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 18:05:37,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:05:37 BoogieIcfgContainer [2025-01-09 18:05:37,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:05:37,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:05:37,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:05:37,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:05:37,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:05:30" (1/3) ... [2025-01-09 18:05:37,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eb34d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:05:37, skipping insertion in model container [2025-01-09 18:05:37,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:31" (2/3) ... [2025-01-09 18:05:37,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eb34d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:05:37, skipping insertion in model container [2025-01-09 18:05:37,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:05:37" (3/3) ... [2025-01-09 18:05:37,653 INFO L128 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2025-01-09 18:05:37,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:05:37,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i that has 19 procedures, 301 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 18:05:37,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:05:37,787 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;@6443d90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:05:37,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:05:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 227 states have (on average 1.2995594713656389) internal successors, (295), 233 states have internal predecessors, (295), 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-01-09 18:05:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 18:05:37,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:37,815 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-01-09 18:05:37,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:37,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:37,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1860750501, now seen corresponding path program 1 times [2025-01-09 18:05:37,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:37,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729975220] [2025-01-09 18:05:37,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:37,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:38,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 18:05:38,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 18:05:38,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:38,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 18:05:38,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:38,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729975220] [2025-01-09 18:05:38,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729975220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:38,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:05:38,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099739022] [2025-01-09 18:05:38,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:38,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:05:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:38,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:05:38,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:05:38,782 INFO L87 Difference]: Start difference. First operand has 301 states, 227 states have (on average 1.2995594713656389) internal successors, (295), 233 states have internal predecessors, (295), 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-01-09 18:05:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:38,914 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2025-01-09 18:05:38,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:05:38,916 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-01-09 18:05:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:38,927 INFO L225 Difference]: With dead ends: 594 [2025-01-09 18:05:38,928 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 18:05:38,932 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-01-09 18:05:38,937 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:38,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1173 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:05:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 18:05:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-01-09 18:05:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 219 states have (on average 1.2831050228310503) internal successors, (281), 223 states have internal predecessors, (281), 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-01-09 18:05:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 383 transitions. [2025-01-09 18:05:38,999 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 383 transitions. Word has length 126 [2025-01-09 18:05:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:39,001 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 383 transitions. [2025-01-09 18:05:39,001 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-01-09 18:05:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 383 transitions. [2025-01-09 18:05:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 18:05:39,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:39,008 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-01-09 18:05:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:05:39,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1568180097, now seen corresponding path program 1 times [2025-01-09 18:05:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606706885] [2025-01-09 18:05:39,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:39,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 18:05:39,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 18:05:39,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:39,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 18:05:39,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606706885] [2025-01-09 18:05:39,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606706885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:39,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:05:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394926244] [2025-01-09 18:05:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:39,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:05:39,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:39,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:05:39,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:05:39,470 INFO L87 Difference]: Start difference. First operand 289 states and 383 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-01-09 18:05:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:39,521 INFO L93 Difference]: Finished difference Result 571 states and 759 transitions. [2025-01-09 18:05:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:05:39,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-01-09 18:05:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:39,526 INFO L225 Difference]: With dead ends: 571 [2025-01-09 18:05:39,526 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 18:05:39,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:05:39,528 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:39,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 754 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:05:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 18:05:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-01-09 18:05:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 220 states have (on average 1.2818181818181817) internal successors, (282), 224 states have internal predecessors, (282), 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-01-09 18:05:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 384 transitions. [2025-01-09 18:05:39,541 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 384 transitions. Word has length 137 [2025-01-09 18:05:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:39,541 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 384 transitions. [2025-01-09 18:05:39,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-01-09 18:05:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 384 transitions. [2025-01-09 18:05:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 18:05:39,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:39,543 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-01-09 18:05:39,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:05:39,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:39,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1668949121, now seen corresponding path program 1 times [2025-01-09 18:05:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681514051] [2025-01-09 18:05:39,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:39,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 18:05:39,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 18:05:39,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:39,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 18:05:39,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:39,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681514051] [2025-01-09 18:05:39,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681514051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:39,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:39,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:05:39,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437727703] [2025-01-09 18:05:39,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:39,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:05:39,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:39,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:05:39,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:05:39,882 INFO L87 Difference]: Start difference. First operand 290 states and 384 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-01-09 18:05:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:39,927 INFO L93 Difference]: Finished difference Result 574 states and 762 transitions. [2025-01-09 18:05:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:05:39,928 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-01-09 18:05:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:39,930 INFO L225 Difference]: With dead ends: 574 [2025-01-09 18:05:39,930 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 18:05:39,931 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-01-09 18:05:39,932 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 0 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:39,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1118 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:05:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 18:05:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-01-09 18:05:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 222 states have (on average 1.2792792792792793) internal successors, (284), 226 states have internal predecessors, (284), 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-01-09 18:05:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 386 transitions. [2025-01-09 18:05:39,944 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 386 transitions. Word has length 137 [2025-01-09 18:05:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:39,944 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 386 transitions. [2025-01-09 18:05:39,944 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-01-09 18:05:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 386 transitions. [2025-01-09 18:05:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 18:05:39,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:39,946 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-01-09 18:05:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:05:39,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:39,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1691581375, now seen corresponding path program 1 times [2025-01-09 18:05:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:39,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016803775] [2025-01-09 18:05:39,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:40,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 18:05:40,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 18:05:40,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:40,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 18:05:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:40,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016803775] [2025-01-09 18:05:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016803775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:40,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:40,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:05:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017451767] [2025-01-09 18:05:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:40,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:05:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:40,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:05:40,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:05:40,200 INFO L87 Difference]: Start difference. First operand 292 states and 386 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-01-09 18:05:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:40,234 INFO L93 Difference]: Finished difference Result 577 states and 765 transitions. [2025-01-09 18:05:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:05:40,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-01-09 18:05:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:40,238 INFO L225 Difference]: With dead ends: 577 [2025-01-09 18:05:40,240 INFO L226 Difference]: Without dead ends: 293 [2025-01-09 18:05:40,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:05:40,241 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:40,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 754 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:05:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-09 18:05:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-01-09 18:05:40,252 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-01-09 18:05:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 387 transitions. [2025-01-09 18:05:40,254 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 387 transitions. Word has length 137 [2025-01-09 18:05:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:40,255 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 387 transitions. [2025-01-09 18:05:40,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-01-09 18:05:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 387 transitions. [2025-01-09 18:05:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 18:05:40,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:40,256 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-01-09 18:05:40,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:05:40,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:40,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1901786047, now seen corresponding path program 1 times [2025-01-09 18:05:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:40,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235979592] [2025-01-09 18:05:40,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:40,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:40,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 18:05:40,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 18:05:40,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:40,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 18:05:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235979592] [2025-01-09 18:05:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235979592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:40,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:05:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888718911] [2025-01-09 18:05:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:40,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:05:40,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:40,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:05:40,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:05:40,832 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-01-09 18:05:44,844 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-01-09 18:05:48,850 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-01-09 18:05:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:49,438 INFO L93 Difference]: Finished difference Result 857 states and 1140 transitions. [2025-01-09 18:05:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:05:49,438 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-01-09 18:05:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:49,443 INFO L225 Difference]: With dead ends: 857 [2025-01-09 18:05:49,443 INFO L226 Difference]: Without dead ends: 853 [2025-01-09 18:05:49,443 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-01-09 18:05:49,444 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 883 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 82 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:49,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1343 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 238 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-01-09 18:05:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-01-09 18:05:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2025-01-09 18:05:49,507 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-01-09 18:05:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1135 transitions. [2025-01-09 18:05:49,512 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1135 transitions. Word has length 137 [2025-01-09 18:05:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:49,512 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1135 transitions. [2025-01-09 18:05:49,512 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-01-09 18:05:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1135 transitions. [2025-01-09 18:05:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 18:05:49,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:49,514 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-01-09 18:05:49,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:05:49,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:49,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash -970050414, now seen corresponding path program 1 times [2025-01-09 18:05:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:49,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207064420] [2025-01-09 18:05:49,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:49,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:49,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 18:05:49,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 18:05:49,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:49,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 18:05:49,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:49,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207064420] [2025-01-09 18:05:49,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207064420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:49,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:49,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:05:49,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475449095] [2025-01-09 18:05:49,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:49,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:05:49,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:49,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:05:49,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:05:49,992 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-01-09 18:05:54,004 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-01-09 18:05:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:54,048 INFO L93 Difference]: Finished difference Result 1700 states and 2265 transitions. [2025-01-09 18:05:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:05:54,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-01-09 18:05:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:54,057 INFO L225 Difference]: With dead ends: 1700 [2025-01-09 18:05:54,058 INFO L226 Difference]: Without dead ends: 1415 [2025-01-09 18:05:54,059 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-01-09 18:05:54,059 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 363 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:54,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1094 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:05:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2025-01-09 18:05:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1133. [2025-01-09 18:05:54,115 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-01-09 18:05:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1506 transitions. [2025-01-09 18:05:54,121 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1506 transitions. Word has length 147 [2025-01-09 18:05:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:54,122 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1506 transitions. [2025-01-09 18:05:54,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-01-09 18:05:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1506 transitions. [2025-01-09 18:05:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 18:05:54,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:54,127 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-01-09 18:05:54,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:05:54,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:54,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash 395986029, now seen corresponding path program 1 times [2025-01-09 18:05:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442239327] [2025-01-09 18:05:54,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:54,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 18:05:54,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 18:05:54,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:54,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 18:05:54,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:54,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442239327] [2025-01-09 18:05:54,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442239327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:54,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:54,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:05:54,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250117573] [2025-01-09 18:05:54,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:54,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:05:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:54,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:05:54,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:05:54,516 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-01-09 18:05:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:54,579 INFO L93 Difference]: Finished difference Result 2266 states and 3015 transitions. [2025-01-09 18:05:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:05:54,580 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-01-09 18:05:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:54,586 INFO L225 Difference]: With dead ends: 2266 [2025-01-09 18:05:54,586 INFO L226 Difference]: Without dead ends: 1141 [2025-01-09 18:05:54,588 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-01-09 18:05:54,589 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 15 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:54,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1096 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:05:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-01-09 18:05:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2025-01-09 18:05:54,629 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-01-09 18:05:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1514 transitions. [2025-01-09 18:05:54,634 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1514 transitions. Word has length 193 [2025-01-09 18:05:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:54,635 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1514 transitions. [2025-01-09 18:05:54,635 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-01-09 18:05:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1514 transitions. [2025-01-09 18:05:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 18:05:54,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:54,640 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-01-09 18:05:54,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:05:54,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:54,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1970708565, now seen corresponding path program 1 times [2025-01-09 18:05:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:54,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892268427] [2025-01-09 18:05:54,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:54,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 18:05:54,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 18:05:54,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:54,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 18:05:54,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:54,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892268427] [2025-01-09 18:05:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892268427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:05:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341945993] [2025-01-09 18:05:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:54,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:05:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:54,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:05:54,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:05:54,901 INFO L87 Difference]: Start difference. First operand 1141 states and 1514 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-01-09 18:05:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:54,942 INFO L93 Difference]: Finished difference Result 2278 states and 3027 transitions. [2025-01-09 18:05:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:05:54,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-01-09 18:05:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:54,948 INFO L225 Difference]: With dead ends: 2278 [2025-01-09 18:05:54,948 INFO L226 Difference]: Without dead ends: 1145 [2025-01-09 18:05:54,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:05:54,951 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:54,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 754 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:05:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-09 18:05:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2025-01-09 18:05:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 877 states have (on average 1.274800456100342) internal successors, (1118), 890 states have internal predecessors, (1118), 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-01-09 18:05:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1518 transitions. [2025-01-09 18:05:54,987 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1518 transitions. Word has length 193 [2025-01-09 18:05:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:54,988 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1518 transitions. [2025-01-09 18:05:54,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-01-09 18:05:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1518 transitions. [2025-01-09 18:05:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 18:05:54,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:54,990 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-01-09 18:05:54,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:05:54,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1971170349, now seen corresponding path program 1 times [2025-01-09 18:05:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372691431] [2025-01-09 18:05:54,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:55,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 18:05:55,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 18:05:55,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:55,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 18:05:55,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:55,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372691431] [2025-01-09 18:05:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372691431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:55,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:55,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:05:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697054805] [2025-01-09 18:05:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:55,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:05:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:55,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:05:55,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:05:55,321 INFO L87 Difference]: Start difference. First operand 1145 states and 1518 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-01-09 18:05:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:55,364 INFO L93 Difference]: Finished difference Result 2290 states and 3039 transitions. [2025-01-09 18:05:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:05:55,365 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-01-09 18:05:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:55,370 INFO L225 Difference]: With dead ends: 2290 [2025-01-09 18:05:55,370 INFO L226 Difference]: Without dead ends: 1153 [2025-01-09 18:05:55,372 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-01-09 18:05:55,372 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 0 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:55,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1130 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:05:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-01-09 18:05:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2025-01-09 18:05:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 885 states have (on average 1.272316384180791) internal successors, (1126), 898 states have internal predecessors, (1126), 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-01-09 18:05:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1526 transitions. [2025-01-09 18:05:55,408 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1526 transitions. Word has length 193 [2025-01-09 18:05:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:55,408 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1526 transitions. [2025-01-09 18:05:55,408 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-01-09 18:05:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1526 transitions. [2025-01-09 18:05:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 18:05:55,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:55,411 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-01-09 18:05:55,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:05:55,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:55,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1167686706, now seen corresponding path program 1 times [2025-01-09 18:05:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929748254] [2025-01-09 18:05:55,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:55,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 18:05:55,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 18:05:55,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:55,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 18:05:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:55,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929748254] [2025-01-09 18:05:55,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929748254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:55,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:55,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:05:55,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073498875] [2025-01-09 18:05:55,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:55,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:05:55,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:55,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:05:55,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:05:55,726 INFO L87 Difference]: Start difference. First operand 1153 states and 1526 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-01-09 18:05:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:55,767 INFO L93 Difference]: Finished difference Result 2306 states and 3055 transitions. [2025-01-09 18:05:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:05:55,767 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-01-09 18:05:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:55,772 INFO L225 Difference]: With dead ends: 2306 [2025-01-09 18:05:55,772 INFO L226 Difference]: Without dead ends: 1161 [2025-01-09 18:05:55,774 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-01-09 18:05:55,775 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 0 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:55,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1130 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:05:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-01-09 18:05:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2025-01-09 18:05:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 893 states have (on average 1.2698768197088466) internal successors, (1134), 906 states have internal predecessors, (1134), 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-01-09 18:05:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1534 transitions. [2025-01-09 18:05:55,810 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1534 transitions. Word has length 194 [2025-01-09 18:05:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:55,810 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1534 transitions. [2025-01-09 18:05:55,810 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-01-09 18:05:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1534 transitions. [2025-01-09 18:05:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 18:05:55,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:55,813 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-01-09 18:05:55,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:05:55,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -600466822, now seen corresponding path program 1 times [2025-01-09 18:05:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141212566] [2025-01-09 18:05:55,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:55,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:55,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 18:05:55,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 18:05:55,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:55,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 18:05:56,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:56,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141212566] [2025-01-09 18:05:56,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141212566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:56,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:56,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:05:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909806822] [2025-01-09 18:05:56,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:56,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:05:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:56,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:05:56,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:05:56,175 INFO L87 Difference]: Start difference. First operand 1161 states and 1534 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-09 18:05:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:56,254 INFO L93 Difference]: Finished difference Result 2618 states and 3505 transitions. [2025-01-09 18:05:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:05:56,255 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), 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 194 [2025-01-09 18:05:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:56,262 INFO L225 Difference]: With dead ends: 2618 [2025-01-09 18:05:56,262 INFO L226 Difference]: Without dead ends: 1465 [2025-01-09 18:05:56,264 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-01-09 18:05:56,264 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 82 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:56,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1319 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:05:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-01-09 18:05:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1244. [2025-01-09 18:05:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 968 states have (on average 1.2758264462809918) internal successors, (1235), 981 states have internal predecessors, (1235), 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-01-09 18:05:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1651 transitions. [2025-01-09 18:05:56,319 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1651 transitions. Word has length 194 [2025-01-09 18:05:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:56,319 INFO L471 AbstractCegarLoop]: Abstraction has 1244 states and 1651 transitions. [2025-01-09 18:05:56,320 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), 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-01-09 18:05:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1651 transitions. [2025-01-09 18:05:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 18:05:56,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:56,322 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-01-09 18:05:56,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:05:56,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:56,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:56,323 INFO L85 PathProgramCache]: Analyzing trace with hash -741463688, now seen corresponding path program 1 times [2025-01-09 18:05:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15343064] [2025-01-09 18:05:56,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:56,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 18:05:56,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 18:05:56,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:56,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 18:05:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:56,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15343064] [2025-01-09 18:05:56,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15343064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:56,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:56,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:05:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075445161] [2025-01-09 18:05:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:56,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:05:56,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:56,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:05:56,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:05:56,759 INFO L87 Difference]: Start difference. First operand 1244 states and 1651 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-01-09 18:05:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:56,828 INFO L93 Difference]: Finished difference Result 2693 states and 3598 transitions. [2025-01-09 18:05:56,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:05:56,828 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-01-09 18:05:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:56,835 INFO L225 Difference]: With dead ends: 2693 [2025-01-09 18:05:56,835 INFO L226 Difference]: Without dead ends: 1457 [2025-01-09 18:05:56,838 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-01-09 18:05:56,838 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 75 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:56,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1299 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:05:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-01-09 18:05:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1236. [2025-01-09 18:05:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 960 states have (on average 1.265625) internal successors, (1215), 973 states have internal predecessors, (1215), 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-01-09 18:05:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1631 transitions. [2025-01-09 18:05:56,883 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1631 transitions. Word has length 195 [2025-01-09 18:05:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:56,883 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1631 transitions. [2025-01-09 18:05:56,883 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-01-09 18:05:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1631 transitions. [2025-01-09 18:05:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 18:05:56,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:56,885 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-01-09 18:05:56,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:05:56,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:56,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash -69477133, now seen corresponding path program 1 times [2025-01-09 18:05:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:56,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034166879] [2025-01-09 18:05:56,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:56,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:57,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 18:05:57,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 18:05:57,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:57,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 18:05:57,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034166879] [2025-01-09 18:05:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034166879] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:05:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102344393] [2025-01-09 18:05:57,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:57,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:05:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:05:57,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:05:57,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:05:57,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 18:05:58,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 18:05:58,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:58,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:58,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 2253 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:05:58,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:05:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 18:05:58,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:05:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 18:05:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102344393] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:05:58,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:05:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 18:05:58,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979563470] [2025-01-09 18:05:58,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:05:58,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:05:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:58,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:05:58,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:05:58,377 INFO L87 Difference]: Start difference. First operand 1236 states and 1631 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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-01-09 18:05:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:05:58,503 INFO L93 Difference]: Finished difference Result 2982 states and 3999 transitions. [2025-01-09 18:05:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:05:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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 195 [2025-01-09 18:05:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:05:58,512 INFO L225 Difference]: With dead ends: 2982 [2025-01-09 18:05:58,512 INFO L226 Difference]: Without dead ends: 1754 [2025-01-09 18:05:58,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 387 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-01-09 18:05:58,516 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 132 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:05:58,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 837 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:05:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2025-01-09 18:05:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1620. [2025-01-09 18:05:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1296 states have (on average 1.2708333333333333) internal successors, (1647), 1309 states have internal predecessors, (1647), 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-01-09 18:05:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2159 transitions. [2025-01-09 18:05:58,574 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2159 transitions. Word has length 195 [2025-01-09 18:05:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:05:58,574 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2159 transitions. [2025-01-09 18:05:58,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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-01-09 18:05:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2159 transitions. [2025-01-09 18:05:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 18:05:58,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:05:58,578 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] [2025-01-09 18:05:58,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 18:05:58,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 18:05:58,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:05:58,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:05:58,780 INFO L85 PathProgramCache]: Analyzing trace with hash -198441909, now seen corresponding path program 1 times [2025-01-09 18:05:58,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:05:58,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744846239] [2025-01-09 18:05:58,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:05:58,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:05:58,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 18:05:58,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 18:05:58,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:05:58,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:05:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 18:05:59,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:05:59,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744846239] [2025-01-09 18:05:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744846239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:05:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:05:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:05:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893326552] [2025-01-09 18:05:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:05:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:05:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:05:59,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:05:59,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:05:59,363 INFO L87 Difference]: Start difference. First operand 1620 states and 2159 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-01-09 18:06:03,378 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-01-09 18:06:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:06:03,626 INFO L93 Difference]: Finished difference Result 3949 states and 5259 transitions. [2025-01-09 18:06:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 18:06:03,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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 208 [2025-01-09 18:06:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:06:03,634 INFO L225 Difference]: With dead ends: 3949 [2025-01-09 18:06:03,635 INFO L226 Difference]: Without dead ends: 1145 [2025-01-09 18:06:03,641 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-01-09 18:06:03,641 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 353 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:06:03,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 2540 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:06:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-09 18:06:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1115. [2025-01-09 18:06:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 883 states have (on average 1.245753114382786) internal successors, (1100), 893 states have internal predecessors, (1100), 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-01-09 18:06:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1460 transitions. [2025-01-09 18:06:03,679 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1460 transitions. Word has length 208 [2025-01-09 18:06:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:06:03,679 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1460 transitions. [2025-01-09 18:06:03,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-01-09 18:06:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1460 transitions. [2025-01-09 18:06:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 18:06:03,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:06:03,682 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] [2025-01-09 18:06:03,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:06:03,683 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:06:03,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:06:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1256414509, now seen corresponding path program 1 times [2025-01-09 18:06:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:06:03,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903081033] [2025-01-09 18:06:03,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:06:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:06:03,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 18:06:03,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 18:06:03,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:06:03,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:06:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-01-09 18:06:04,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:06:04,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903081033] [2025-01-09 18:06:04,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903081033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:06:04,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:06:04,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:06:04,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116826612] [2025-01-09 18:06:04,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:06:04,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:06:04,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:06:04,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:06:04,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:06:04,084 INFO L87 Difference]: Start difference. First operand 1115 states and 1460 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-01-09 18:06:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:06:04,153 INFO L93 Difference]: Finished difference Result 2253 states and 2958 transitions. [2025-01-09 18:06:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:06:04,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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 229 [2025-01-09 18:06:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:06:04,162 INFO L225 Difference]: With dead ends: 2253 [2025-01-09 18:06:04,162 INFO L226 Difference]: Without dead ends: 1146 [2025-01-09 18:06:04,166 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-01-09 18:06:04,166 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 16 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:06:04,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1169 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:06:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-01-09 18:06:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1027. [2025-01-09 18:06:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 803 states have (on average 1.2353673723536738) internal successors, (992), 813 states have internal predecessors, (992), 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-01-09 18:06:04,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1336 transitions. [2025-01-09 18:06:04,206 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1336 transitions. Word has length 229 [2025-01-09 18:06:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:06:04,207 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1336 transitions. [2025-01-09 18:06:04,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-01-09 18:06:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1336 transitions. [2025-01-09 18:06:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 18:06:04,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:06:04,211 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] [2025-01-09 18:06:04,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:06:04,211 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:06:04,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:06:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2024329055, now seen corresponding path program 1 times [2025-01-09 18:06:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:06:04,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255135874] [2025-01-09 18:06:04,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:06:04,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:06:04,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 18:06:04,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 18:06:04,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:06:04,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:06:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-09 18:06:04,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:06:04,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255135874] [2025-01-09 18:06:04,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255135874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:06:04,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:06:04,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:06:04,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319740770] [2025-01-09 18:06:04,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:06:04,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:06:04,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:06:04,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:06:04,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:06:04,791 INFO L87 Difference]: Start difference. First operand 1027 states and 1336 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-01-09 18:06:08,801 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-01-09 18:06:12,805 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-01-09 18:06:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:06:13,017 INFO L93 Difference]: Finished difference Result 1364 states and 1777 transitions. [2025-01-09 18:06:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:06:13,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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 247 [2025-01-09 18:06:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:06:13,020 INFO L225 Difference]: With dead ends: 1364 [2025-01-09 18:06:13,020 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 18:06:13,022 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-01-09 18:06:13,023 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 702 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:06:13,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 667 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-01-09 18:06:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 18:06:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 18:06:13,024 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-01-09 18:06:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 18:06:13,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2025-01-09 18:06:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:06:13,024 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 18:06:13,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-01-09 18:06:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 18:06:13,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 18:06:13,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 18:06:13,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 18:06:13,029 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:06:13,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 18:06:19,437 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 18:06:19,452 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,453 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,453 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,453 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,453 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,453 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,454 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,454 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,454 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,454 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,454 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,454 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,454 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,454 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,455 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,455 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,455 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,455 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,455 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2025-01-09 18:06:19,455 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2025-01-09 18:06:19,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:06:19 BoogieIcfgContainer [2025-01-09 18:06:19,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 18:06:19,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 18:06:19,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 18:06:19,456 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 18:06:19,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:05:37" (3/4) ... [2025-01-09 18:06:19,458 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2025-01-09 18:06:19,468 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-01-09 18:06:19,469 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2025-01-09 18:06:19,469 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-01-09 18:06:19,469 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2025-01-09 18:06:19,469 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2025-01-09 18:06:19,469 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2025-01-09 18:06:19,469 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2025-01-09 18:06:19,469 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2025-01-09 18:06:19,469 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2025-01-09 18:06:19,480 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2025-01-09 18:06:19,481 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2025-01-09 18:06:19,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 18:06:19,483 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 18:06:19,484 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 18:06:19,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 18:06:19,606 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 18:06:19,606 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 18:06:19,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 18:06:19,607 INFO L158 Benchmark]: Toolchain (without parser) took 48609.76ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 108.0MB in the beginning and 534.1MB in the end (delta: -426.1MB). Peak memory consumption was 604.1MB. Max. memory is 16.1GB. [2025-01-09 18:06:19,607 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 18:06:19,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.05ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 61.8MB in the end (delta: 46.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 18:06:19,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.96ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 53.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 18:06:19,607 INFO L158 Benchmark]: Boogie Preprocessor took 253.09ms. Allocated memory is still 142.6MB. Free memory was 53.4MB in the beginning and 89.5MB in the end (delta: -36.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2025-01-09 18:06:19,607 INFO L158 Benchmark]: RCFGBuilder took 5575.01ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 89.5MB in the end (delta: 10.2kB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2025-01-09 18:06:19,608 INFO L158 Benchmark]: TraceAbstraction took 41815.82ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 89.0MB in the beginning and 554.9MB in the end (delta: -465.9MB). Peak memory consumption was 583.3MB. Max. memory is 16.1GB. [2025-01-09 18:06:19,608 INFO L158 Benchmark]: Witness Printer took 150.12ms. Allocated memory is still 1.2GB. Free memory was 554.9MB in the beginning and 534.1MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 18:06:19,608 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.05ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 61.8MB in the end (delta: 46.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.96ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 53.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 253.09ms. Allocated memory is still 142.6MB. Free memory was 53.4MB in the beginning and 89.5MB in the end (delta: -36.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * RCFGBuilder took 5575.01ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 89.5MB in the end (delta: 10.2kB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * TraceAbstraction took 41815.82ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 89.0MB in the beginning and 554.9MB in the end (delta: -465.9MB). Peak memory consumption was 583.3MB. Max. memory is 16.1GB. * Witness Printer took 150.12ms. Allocated memory is still 1.2GB. Free memory was 554.9MB in the beginning and 534.1MB in the end (delta: 20.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: ~sensor_type~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: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~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: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~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, 301 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 2670 SdHoareTripleChecker+Valid, 25.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2621 mSDsluCounter, 18177 SdHoareTripleChecker+Invalid, 24.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11119 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 604 IncrementalHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 7058 mSDtfsCounter, 604 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1620occurred in iteration=13, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 1007 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3057 NumberOfCodeBlocks, 3057 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3234 ConstructedInterpolants, 0 QuantifiedInterpolants, 4004 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2253 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 1483/1486 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: 2192]: Location Invariant Derived location invariant: (((((6 <= ldv_count_1) && (ldv_count_2 == 0)) || ((ldv_call_dev_attr_of_sensor_device_attribute == 1) && (((long) 5 + ldv_count_2) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (ldv_call_dev_attr_of_sensor_device_attribute == 1))) - InvariantResult [Line: 1990]: Loop Invariant Derived loop invariant: ((((((ldv_call_dev_attr_of_sensor_device_attribute == 1) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) 2 + ldv_count_2) <= ldv_count_1))) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (ldv_call_dev_attr_of_sensor_device_attribute == 1))) - InvariantResult [Line: 1993]: Loop Invariant Derived loop invariant: ((((((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (ldv_call_dev_attr_of_sensor_device_attribute == 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))) || ((ldv_call_dev_attr_of_sensor_device_attribute == 1) && (((long) 5 + ldv_count_2) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) 2 + ldv_count_2) <= ldv_count_1))) RESULT: Ultimate proved your program to be correct! [2025-01-09 18:06:19,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE