./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a5b351dc48b78577594847e2589a2433da4c3422ed74f69290b3f52d3ba2c2d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:52:59,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:52:59,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:52:59,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:52:59,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:52:59,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:52:59,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:52:59,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:52:59,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:52:59,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:52:59,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:52:59,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:52:59,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:52:59,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:52:59,282 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:52:59,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:52:59,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:52:59,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:52:59,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:52:59,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:52:59,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:52:59,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:52:59,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:52:59,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:52:59,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:52:59,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:52:59,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:52:59,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:52:59,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:52:59,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:52:59,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:52:59,284 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5b351dc48b78577594847e2589a2433da4c3422ed74f69290b3f52d3ba2c2d2 [2025-03-04 03:52:59,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:52:59,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:52:59,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:52:59,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:52:59,533 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:52:59,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i [2025-03-04 03:53:00,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3e2913c/1cb4efcaa4fa4c6db3c02064501a4896/FLAG27372a34b [2025-03-04 03:53:01,149 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:53:01,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i [2025-03-04 03:53:01,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3e2913c/1cb4efcaa4fa4c6db3c02064501a4896/FLAG27372a34b [2025-03-04 03:53:01,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3e2913c/1cb4efcaa4fa4c6db3c02064501a4896 [2025-03-04 03:53:01,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:53:01,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:53:01,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:53:01,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:53:01,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:53:01,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:53:01" (1/1) ... [2025-03-04 03:53:01,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c73f444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:01, skipping insertion in model container [2025-03-04 03:53:01,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:53:01" (1/1) ... [2025-03-04 03:53:01,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:53:01,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i[106459,106472] [2025-03-04 03:53:01,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:53:01,978 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:53:02,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i[106459,106472] [2025-03-04 03:53:02,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:53:02,163 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:53:02,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02 WrapperNode [2025-03-04 03:53:02,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:53:02,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:53:02,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:53:02,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:53:02,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,319 INFO L138 Inliner]: procedures = 129, calls = 755, calls flagged for inlining = 53, calls inlined = 47, statements flattened = 2485 [2025-03-04 03:53:02,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:53:02,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:53:02,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:53:02,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:53:02,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,460 INFO L175 MemorySlicer]: Split 360 memory accesses to 17 slices as follows [121, 2, 8, 7, 42, 16, 2, 6, 1, 24, 19, 1, 2, 49, 1, 51, 8]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 8, 6]. The 228 writes are split as follows [30, 0, 3, 6, 42, 16, 0, 0, 1, 24, 19, 0, 1, 42, 1, 43, 0]. [2025-03-04 03:53:02,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:53:02,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:53:02,590 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:53:02,590 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:53:02,591 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (1/1) ... [2025-03-04 03:53:02,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:53:02,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:53:02,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 03:53:02,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 03:53:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-04 03:53:02,647 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 03:53:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 03:53:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 03:53:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 03:53:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 03:53:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 03:53:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 03:53:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 03:53:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 03:53:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure pch_phub_remove [2025-03-04 03:53:02,648 INFO L138 BoogieDeclarations]: Found implementation of procedure pch_phub_remove [2025-03-04 03:53:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:53:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:53:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:53:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:53:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:53:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:53:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:53:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:53:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 03:53:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 03:53:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 03:53:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 03:53:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 03:53:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 03:53:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 03:53:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 03:53:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 03:53:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2025-03-04 03:53:02,651 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2025-03-04 03:53:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 03:53:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure sysfs_create_bin_file [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure sysfs_create_bin_file [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure pch_phub_read_modify_write_reg [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure pch_phub_read_modify_write_reg [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pch_phub_mutex [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pch_phub_mutex [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2025-03-04 03:53:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2025-03-04 03:53:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure sysfs_remove_file [2025-03-04 03:53:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure sysfs_remove_file [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_device [2025-03-04 03:53:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_device [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_rom [2025-03-04 03:53:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_rom [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 03:53:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:53:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_wake [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_wake [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pch_phub_mutex [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pch_phub_mutex [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure pci_iounmap [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_iounmap [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_power_state [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_power_state [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure pch_phub_write_serial_rom [2025-03-04 03:53:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure pch_phub_write_serial_rom [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:53:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:53:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure sysfs_create_file [2025-03-04 03:53:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure sysfs_create_file [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure pch_phub_read_serial_rom [2025-03-04 03:53:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure pch_phub_read_serial_rom [2025-03-04 03:53:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_rom [2025-03-04 03:53:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_rom [2025-03-04 03:53:03,035 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:53:03,038 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:53:03,062 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3726: havoc #t~ret426.base, #t~ret426.offset; [2025-03-04 03:53:03,098 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3817: havoc #t~nondet442; [2025-03-04 03:53:03,183 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2123: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-04 03:53:03,200 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3711: havoc #t~nondet422; [2025-03-04 03:53:03,208 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3737: havoc #t~nondet429; [2025-03-04 03:53:03,216 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3780: havoc #t~nondet436; [2025-03-04 03:53:03,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3741: havoc #t~nondet430; [2025-03-04 03:53:03,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3715: havoc __pci_enable_wake_#t~nondet423#1; [2025-03-04 03:53:03,252 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3762: havoc #t~nondet433; [2025-03-04 03:53:03,265 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3807: havoc #t~nondet441; [2025-03-04 03:53:03,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3723: havoc #t~nondet425; [2025-03-04 03:53:08,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803: havoc pci_save_state_#t~nondet440#1; [2025-03-04 03:53:08,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3748: havoc ldv_pch_bin_attr_probe_2_#t~nondet431#1; [2025-03-04 03:53:08,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3752: havoc ldv_pch_bin_attr_release_2_#t~nondet432#1; [2025-03-04 03:53:08,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2761: call ULTIMATE.dealloc(store_pch_mac_~#mac~1#1.base, store_pch_mac_~#mac~1#1.offset);havoc store_pch_mac_~#mac~1#1.base, store_pch_mac_~#mac~1#1.offset;call ULTIMATE.dealloc(store_pch_mac_~#rom_size~3#1.base, store_pch_mac_~#rom_size~3#1.offset);havoc store_pch_mac_~#rom_size~3#1.base, store_pch_mac_~#rom_size~3#1.offset; [2025-03-04 03:53:08,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: call ULTIMATE.dealloc(pch_phub_suspend_~#state#1.base, pch_phub_suspend_~#state#1.offset);havoc pch_phub_suspend_~#state#1.base, pch_phub_suspend_~#state#1.offset; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3308-1: ldv_mutex_lock_interruptible_6_#res#1 := ldv_mutex_lock_interruptible_6_~ldv_func_res~1#1; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3773: havoc pci_choose_state_#t~nondet435#1; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2189: call ULTIMATE.dealloc(pch_phub_save_reg_conf_~#descriptor~0#1.base, pch_phub_save_reg_conf_~#descriptor~0#1.offset);havoc pch_phub_save_reg_conf_~#descriptor~0#1.base, pch_phub_save_reg_conf_~#descriptor~0#1.offset;call ULTIMATE.dealloc(pch_phub_save_reg_conf_~#descriptor___0~0#1.base, pch_phub_save_reg_conf_~#descriptor___0~0#1.offset);havoc pch_phub_save_reg_conf_~#descriptor___0~0#1.base, pch_phub_save_reg_conf_~#descriptor___0~0#1.offset; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2261: call ULTIMATE.dealloc(pch_phub_restore_reg_conf_~#descriptor~1#1.base, pch_phub_restore_reg_conf_~#descriptor~1#1.offset);havoc pch_phub_restore_reg_conf_~#descriptor~1#1.base, pch_phub_restore_reg_conf_~#descriptor~1#1.offset;call ULTIMATE.dealloc(pch_phub_restore_reg_conf_~#descriptor___0~1#1.base, pch_phub_restore_reg_conf_~#descriptor___0~1#1.offset);havoc pch_phub_restore_reg_conf_~#descriptor___0~1#1.base, pch_phub_restore_reg_conf_~#descriptor___0~1#1.offset; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3783: havoc pci_iomap_#t~ret437#1.base, pci_iomap_#t~ret437#1.offset; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2133: havoc __kmalloc_#t~ret64#1.base, __kmalloc_#t~ret64#1.offset; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3719: havoc __pci_register_driver_#t~nondet424#1; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795: call ULTIMATE.dealloc(pch_phub_probe_~#descriptor~2#1.base, pch_phub_probe_~#descriptor~2#1.offset);havoc pch_phub_probe_~#descriptor~2#1.base, pch_phub_probe_~#descriptor~2#1.offset;call ULTIMATE.dealloc(pch_phub_probe_~#descriptor___0~2#1.base, pch_phub_probe_~#descriptor___0~2#1.offset);havoc pch_phub_probe_~#descriptor___0~2#1.base, pch_phub_probe_~#descriptor___0~2#1.offset;call ULTIMATE.dealloc(pch_phub_probe_~#descriptor___1~0#1.base, pch_phub_probe_~#descriptor___1~0#1.offset);havoc pch_phub_probe_~#descriptor___1~0#1.base, pch_phub_probe_~#descriptor___1~0#1.offset; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2600: call ULTIMATE.dealloc(pch_phub_bin_read_~#rom_signature~0#1.base, pch_phub_bin_read_~#rom_signature~0#1.offset);havoc pch_phub_bin_read_~#rom_signature~0#1.base, pch_phub_bin_read_~#rom_signature~0#1.offset;call ULTIMATE.dealloc(pch_phub_bin_read_~#rom_length~0#1.base, pch_phub_bin_read_~#rom_length~0#1.offset);havoc pch_phub_bin_read_~#rom_length~0#1.base, pch_phub_bin_read_~#rom_length~0#1.offset;call ULTIMATE.dealloc(pch_phub_bin_read_~#tmp~10#1.base, pch_phub_bin_read_~#tmp~10#1.offset);havoc pch_phub_bin_read_~#tmp~10#1.base, pch_phub_bin_read_~#tmp~10#1.offset;call ULTIMATE.dealloc(pch_phub_bin_read_~#rom_size~0#1.base, pch_phub_bin_read_~#rom_size~0#1.offset);havoc pch_phub_bin_read_~#rom_size~0#1.base, pch_phub_bin_read_~#rom_size~0#1.offset; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3796: havoc pci_request_regions_#t~nondet439#1; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3730: havoc dev_set_drvdata_#t~nondet427#1; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740: call ULTIMATE.dealloc(show_pch_mac_~#mac~0#1.base, show_pch_mac_~#mac~0#1.offset);havoc show_pch_mac_~#mac~0#1.base, show_pch_mac_~#mac~0#1.offset;call ULTIMATE.dealloc(show_pch_mac_~#rom_size~2#1.base, show_pch_mac_~#rom_size~2#1.offset);havoc show_pch_mac_~#rom_size~2#1.base, show_pch_mac_~#rom_size~2#1.offset; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3336-1: ldv_mutex_lock_interruptible_9_#res#1 := ldv_mutex_lock_interruptible_9_~ldv_func_res~2#1; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3733: havoc dmi_get_system_info_#t~ret428#1.base, dmi_get_system_info_#t~ret428#1.offset; [2025-03-04 03:53:08,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2677: call ULTIMATE.dealloc(pch_phub_bin_write_~#rom_size~1#1.base, pch_phub_bin_write_~#rom_size~1#1.offset);havoc pch_phub_bin_write_~#rom_size~1#1.base, pch_phub_bin_write_~#rom_size~1#1.offset; [2025-03-04 03:53:08,689 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3821: havoc #t~nondet443; [2025-03-04 03:53:08,756 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3789: havoc #t~ret438.base, #t~ret438.offset; [2025-03-04 03:53:08,988 INFO L? ?]: Removed 845 outVars from TransFormulas that were not future-live. [2025-03-04 03:53:08,988 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:53:09,054 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:53:09,054 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 03:53:09,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:53:09 BoogieIcfgContainer [2025-03-04 03:53:09,055 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:53:09,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:53:09,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:53:09,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:53:09,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:53:01" (1/3) ... [2025-03-04 03:53:09,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ce61dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:53:09, skipping insertion in model container [2025-03-04 03:53:09,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:02" (2/3) ... [2025-03-04 03:53:09,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ce61dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:53:09, skipping insertion in model container [2025-03-04 03:53:09,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:53:09" (3/3) ... [2025-03-04 03:53:09,062 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i [2025-03-04 03:53:09,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:53:09,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i that has 31 procedures, 851 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 03:53:09,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:53:09,156 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;@14522ddc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:53:09,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:53:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 851 states, 632 states have (on average 1.3465189873417722) internal successors, (851), 645 states have internal predecessors, (851), 187 states have call successors, (187), 30 states have call predecessors, (187), 30 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) [2025-03-04 03:53:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 03:53:09,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:09,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:09,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:09,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash 198482113, now seen corresponding path program 1 times [2025-03-04 03:53:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:09,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129037052] [2025-03-04 03:53:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:10,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 03:53:10,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 03:53:10,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:10,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:11,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129037052] [2025-03-04 03:53:11,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129037052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:11,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:11,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:11,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699234310] [2025-03-04 03:53:11,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:11,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:11,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:11,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:11,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:11,121 INFO L87 Difference]: Start difference. First operand has 851 states, 632 states have (on average 1.3465189873417722) internal successors, (851), 645 states have internal predecessors, (851), 187 states have call successors, (187), 30 states have call predecessors, (187), 30 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:15,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:53:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:16,619 INFO L93 Difference]: Finished difference Result 2527 states and 3695 transitions. [2025-03-04 03:53:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:16,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 03:53:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:16,646 INFO L225 Difference]: With dead ends: 2527 [2025-03-04 03:53:16,646 INFO L226 Difference]: Without dead ends: 1675 [2025-03-04 03:53:16,654 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-03-04 03:53:16,656 INFO L435 NwaCegarLoop]: 1161 mSDtfsCounter, 1188 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:16,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 2308 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-03-04 03:53:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2025-03-04 03:53:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1671. [2025-03-04 03:53:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1243 states have (on average 1.341110217216412) internal successors, (1667), 1261 states have internal predecessors, (1667), 369 states have call successors, (369), 59 states have call predecessors, (369), 58 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-04 03:53:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2400 transitions. [2025-03-04 03:53:16,808 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2400 transitions. Word has length 15 [2025-03-04 03:53:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:16,809 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2400 transitions. [2025-03-04 03:53:16,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2400 transitions. [2025-03-04 03:53:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 03:53:16,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:16,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:16,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:53:16,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:16,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:16,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1879503823, now seen corresponding path program 1 times [2025-03-04 03:53:16,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:16,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610024356] [2025-03-04 03:53:16,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:16,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:17,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 03:53:17,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 03:53:17,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:17,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:18,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:18,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610024356] [2025-03-04 03:53:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610024356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:18,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:18,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:18,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064730704] [2025-03-04 03:53:18,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:18,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:18,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:18,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:18,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:18,215 INFO L87 Difference]: Start difference. First operand 1671 states and 2400 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:18,869 INFO L93 Difference]: Finished difference Result 1689 states and 2420 transitions. [2025-03-04 03:53:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:18,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 03:53:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:18,881 INFO L225 Difference]: With dead ends: 1689 [2025-03-04 03:53:18,882 INFO L226 Difference]: Without dead ends: 1680 [2025-03-04 03:53:18,884 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-03-04 03:53:18,885 INFO L435 NwaCegarLoop]: 1166 mSDtfsCounter, 1207 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:18,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 1176 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 03:53:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2025-03-04 03:53:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1671. [2025-03-04 03:53:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1243 states have (on average 1.340305711987128) internal successors, (1666), 1261 states have internal predecessors, (1666), 369 states have call successors, (369), 59 states have call predecessors, (369), 58 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-04 03:53:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2399 transitions. [2025-03-04 03:53:18,971 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2399 transitions. Word has length 18 [2025-03-04 03:53:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:18,971 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2399 transitions. [2025-03-04 03:53:18,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2399 transitions. [2025-03-04 03:53:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 03:53:18,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:18,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:53:18,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:18,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1850874672, now seen corresponding path program 1 times [2025-03-04 03:53:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966212918] [2025-03-04 03:53:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:19,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 03:53:19,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 03:53:19,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:19,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:20,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:20,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966212918] [2025-03-04 03:53:20,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966212918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:20,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:20,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:20,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187351296] [2025-03-04 03:53:20,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:20,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:20,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:20,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:20,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:20,091 INFO L87 Difference]: Start difference. First operand 1671 states and 2399 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:24,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:53:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:24,814 INFO L93 Difference]: Finished difference Result 1673 states and 2400 transitions. [2025-03-04 03:53:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:24,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 03:53:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:24,824 INFO L225 Difference]: With dead ends: 1673 [2025-03-04 03:53:24,824 INFO L226 Difference]: Without dead ends: 1670 [2025-03-04 03:53:24,826 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-03-04 03:53:24,827 INFO L435 NwaCegarLoop]: 1154 mSDtfsCounter, 1195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:24,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1154 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-04 03:53:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-03-04 03:53:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2025-03-04 03:53:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1243 states have (on average 1.339501206757844) internal successors, (1665), 1260 states have internal predecessors, (1665), 368 states have call successors, (368), 59 states have call predecessors, (368), 58 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-04 03:53:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2397 transitions. [2025-03-04 03:53:24,911 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2397 transitions. Word has length 18 [2025-03-04 03:53:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:24,911 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2397 transitions. [2025-03-04 03:53:24,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2397 transitions. [2025-03-04 03:53:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 03:53:24,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:24,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:24,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:53:24,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:24,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1543664600, now seen corresponding path program 1 times [2025-03-04 03:53:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:24,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507485376] [2025-03-04 03:53:24,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:24,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:25,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 03:53:25,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 03:53:25,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:25,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507485376] [2025-03-04 03:53:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507485376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:25,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:25,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:25,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284920628] [2025-03-04 03:53:25,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:25,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:25,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:25,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:25,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:25,942 INFO L87 Difference]: Start difference. First operand 1670 states and 2397 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:29,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:53:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:30,663 INFO L93 Difference]: Finished difference Result 1672 states and 2398 transitions. [2025-03-04 03:53:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 03:53:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:30,672 INFO L225 Difference]: With dead ends: 1672 [2025-03-04 03:53:30,672 INFO L226 Difference]: Without dead ends: 1669 [2025-03-04 03:53:30,674 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-03-04 03:53:30,676 INFO L435 NwaCegarLoop]: 1152 mSDtfsCounter, 1192 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:30,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 1152 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-04 03:53:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-03-04 03:53:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2025-03-04 03:53:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1243 states have (on average 1.33869670152856) internal successors, (1664), 1259 states have internal predecessors, (1664), 367 states have call successors, (367), 59 states have call predecessors, (367), 58 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-04 03:53:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2395 transitions. [2025-03-04 03:53:30,739 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2395 transitions. Word has length 19 [2025-03-04 03:53:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:30,740 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2395 transitions. [2025-03-04 03:53:30,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2395 transitions. [2025-03-04 03:53:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 03:53:30,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:30,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:30,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:53:30,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:30,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash -610087983, now seen corresponding path program 1 times [2025-03-04 03:53:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413403556] [2025-03-04 03:53:30,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:31,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 03:53:31,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 03:53:31,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:31,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:31,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:31,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413403556] [2025-03-04 03:53:31,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413403556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:31,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:31,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115325650] [2025-03-04 03:53:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:31,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:31,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:31,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:31,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:31,804 INFO L87 Difference]: Start difference. First operand 1669 states and 2395 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:35,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:53:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:37,186 INFO L93 Difference]: Finished difference Result 4967 states and 7147 transitions. [2025-03-04 03:53:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 03:53:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:37,201 INFO L225 Difference]: With dead ends: 4967 [2025-03-04 03:53:37,202 INFO L226 Difference]: Without dead ends: 3295 [2025-03-04 03:53:37,210 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-03-04 03:53:37,210 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 1186 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:37,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 2354 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-03-04 03:53:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2025-03-04 03:53:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3282. [2025-03-04 03:53:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 2450 states have (on average 1.3404081632653062) internal successors, (3284), 2485 states have internal predecessors, (3284), 719 states have call successors, (719), 114 states have call predecessors, (719), 112 states have return successors, (720), 708 states have call predecessors, (720), 712 states have call successors, (720) [2025-03-04 03:53:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4723 transitions. [2025-03-04 03:53:37,363 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4723 transitions. Word has length 20 [2025-03-04 03:53:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:37,364 INFO L471 AbstractCegarLoop]: Abstraction has 3282 states and 4723 transitions. [2025-03-04 03:53:37,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4723 transitions. [2025-03-04 03:53:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 03:53:37,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:37,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:37,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:53:37,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:37,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash -439956376, now seen corresponding path program 1 times [2025-03-04 03:53:37,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:37,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201552813] [2025-03-04 03:53:37,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:38,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 03:53:38,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 03:53:38,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:38,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:38,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201552813] [2025-03-04 03:53:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201552813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986456472] [2025-03-04 03:53:38,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:38,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:38,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:38,448 INFO L87 Difference]: Start difference. First operand 3282 states and 4723 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:53:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:39,953 INFO L93 Difference]: Finished difference Result 9470 states and 13611 transitions. [2025-03-04 03:53:39,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:39,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-04 03:53:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:39,985 INFO L225 Difference]: With dead ends: 9470 [2025-03-04 03:53:39,986 INFO L226 Difference]: Without dead ends: 6191 [2025-03-04 03:53:40,002 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-03-04 03:53:40,003 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 1047 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:40,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 2312 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 03:53:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2025-03-04 03:53:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 6182. [2025-03-04 03:53:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 4622 states have (on average 1.3379489398528774) internal successors, (6184), 4677 states have internal predecessors, (6184), 1347 states have call successors, (1347), 214 states have call predecessors, (1347), 212 states have return successors, (1348), 1336 states have call predecessors, (1348), 1340 states have call successors, (1348) [2025-03-04 03:53:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 8879 transitions. [2025-03-04 03:53:40,259 INFO L78 Accepts]: Start accepts. Automaton has 6182 states and 8879 transitions. Word has length 49 [2025-03-04 03:53:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:40,260 INFO L471 AbstractCegarLoop]: Abstraction has 6182 states and 8879 transitions. [2025-03-04 03:53:40,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:53:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 6182 states and 8879 transitions. [2025-03-04 03:53:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 03:53:40,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:40,268 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:53:40,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:53:40,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:40,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1990362766, now seen corresponding path program 1 times [2025-03-04 03:53:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:40,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340771525] [2025-03-04 03:53:40,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:41,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 03:53:41,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 03:53:41,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:41,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:41,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340771525] [2025-03-04 03:53:41,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340771525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:41,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:41,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082446553] [2025-03-04 03:53:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:41,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:41,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:41,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:41,383 INFO L87 Difference]: Start difference. First operand 6182 states and 8879 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:53:45,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:53:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:47,600 INFO L93 Difference]: Finished difference Result 15310 states and 21999 transitions. [2025-03-04 03:53:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:47,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-03-04 03:53:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:47,655 INFO L225 Difference]: With dead ends: 15310 [2025-03-04 03:53:47,655 INFO L226 Difference]: Without dead ends: 9131 [2025-03-04 03:53:47,684 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-03-04 03:53:47,685 INFO L435 NwaCegarLoop]: 2142 mSDtfsCounter, 1058 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:47,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 3278 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-03-04 03:53:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9131 states. [2025-03-04 03:53:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9131 to 9122. [2025-03-04 03:53:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9122 states, 6834 states have (on average 1.33801580333626) internal successors, (9144), 6909 states have internal predecessors, (9144), 1975 states have call successors, (1975), 314 states have call predecessors, (1975), 312 states have return successors, (1976), 1964 states have call predecessors, (1976), 1968 states have call successors, (1976) [2025-03-04 03:53:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9122 states to 9122 states and 13095 transitions. [2025-03-04 03:53:48,051 INFO L78 Accepts]: Start accepts. Automaton has 9122 states and 13095 transitions. Word has length 60 [2025-03-04 03:53:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:48,053 INFO L471 AbstractCegarLoop]: Abstraction has 9122 states and 13095 transitions. [2025-03-04 03:53:48,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:53:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 9122 states and 13095 transitions. [2025-03-04 03:53:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 03:53:48,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:48,062 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-04 03:53:48,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:53:48,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:48,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1228558094, now seen corresponding path program 1 times [2025-03-04 03:53:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770077337] [2025-03-04 03:53:48,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:48,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:48,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 03:53:48,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 03:53:48,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:48,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 03:53:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770077337] [2025-03-04 03:53:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770077337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:49,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:49,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:53:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522473771] [2025-03-04 03:53:49,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:49,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:53:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:49,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:53:49,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:53:49,492 INFO L87 Difference]: Start difference. First operand 9122 states and 13095 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 03:53:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:51,175 INFO L93 Difference]: Finished difference Result 18261 states and 26215 transitions. [2025-03-04 03:53:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:53:51,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 72 [2025-03-04 03:53:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:51,222 INFO L225 Difference]: With dead ends: 18261 [2025-03-04 03:53:51,222 INFO L226 Difference]: Without dead ends: 9142 [2025-03-04 03:53:51,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:53:51,256 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 1200 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:51,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 2257 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 03:53:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9142 states. [2025-03-04 03:53:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9142 to 9122. [2025-03-04 03:53:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9122 states, 6834 states have (on average 1.3374304945858941) internal successors, (9140), 6909 states have internal predecessors, (9140), 1975 states have call successors, (1975), 314 states have call predecessors, (1975), 312 states have return successors, (1976), 1964 states have call predecessors, (1976), 1968 states have call successors, (1976) [2025-03-04 03:53:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9122 states to 9122 states and 13091 transitions. [2025-03-04 03:53:51,697 INFO L78 Accepts]: Start accepts. Automaton has 9122 states and 13091 transitions. Word has length 72 [2025-03-04 03:53:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:51,700 INFO L471 AbstractCegarLoop]: Abstraction has 9122 states and 13091 transitions. [2025-03-04 03:53:51,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 03:53:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 9122 states and 13091 transitions. [2025-03-04 03:53:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 03:53:51,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:51,706 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-04 03:53:51,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:53:51,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:51,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash 729024754, now seen corresponding path program 1 times [2025-03-04 03:53:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:51,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025984076] [2025-03-04 03:53:51,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:52,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 03:53:52,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 03:53:52,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:52,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 03:53:53,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:53,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025984076] [2025-03-04 03:53:53,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025984076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:53,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:53,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199684238] [2025-03-04 03:53:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:53,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:53,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:53,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:53,241 INFO L87 Difference]: Start difference. First operand 9122 states and 13091 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:53:57,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:53:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:59,391 INFO L93 Difference]: Finished difference Result 18243 states and 26180 transitions. [2025-03-04 03:53:59,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:59,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2025-03-04 03:53:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:59,435 INFO L225 Difference]: With dead ends: 18243 [2025-03-04 03:53:59,435 INFO L226 Difference]: Without dead ends: 9124 [2025-03-04 03:53:59,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:59,468 INFO L435 NwaCegarLoop]: 2183 mSDtfsCounter, 1166 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:59,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 3317 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2025-03-04 03:53:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9124 states. [2025-03-04 03:53:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9124 to 9109. [2025-03-04 03:53:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9109 states, 6826 states have (on average 1.3372399648403164) internal successors, (9128), 6902 states have internal predecessors, (9128), 1971 states have call successors, (1971), 312 states have call predecessors, (1971), 311 states have return successors, (1966), 1960 states have call predecessors, (1966), 1962 states have call successors, (1966) [2025-03-04 03:53:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9109 states to 9109 states and 13065 transitions. [2025-03-04 03:53:59,789 INFO L78 Accepts]: Start accepts. Automaton has 9109 states and 13065 transitions. Word has length 73 [2025-03-04 03:53:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:59,789 INFO L471 AbstractCegarLoop]: Abstraction has 9109 states and 13065 transitions. [2025-03-04 03:53:59,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:53:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 9109 states and 13065 transitions. [2025-03-04 03:53:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 03:53:59,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:59,796 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-04 03:53:59,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:53:59,796 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:59,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash -115447117, now seen corresponding path program 1 times [2025-03-04 03:53:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:59,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728443151] [2025-03-04 03:53:59,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:00,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 03:54:00,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 03:54:00,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:00,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 03:54:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:01,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728443151] [2025-03-04 03:54:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728443151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:54:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544244930] [2025-03-04 03:54:01,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:01,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:54:01,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:01,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:54:01,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:54:01,376 INFO L87 Difference]: Start difference. First operand 9109 states and 13065 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:54:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:54:04,563 INFO L93 Difference]: Finished difference Result 9230 states and 13205 transitions. [2025-03-04 03:54:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:54:04,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2025-03-04 03:54:04,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:54:04,621 INFO L225 Difference]: With dead ends: 9230 [2025-03-04 03:54:04,621 INFO L226 Difference]: Without dead ends: 9077 [2025-03-04 03:54:04,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:54:04,630 INFO L435 NwaCegarLoop]: 1155 mSDtfsCounter, 0 mSDsluCounter, 4602 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5757 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:54:04,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5757 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 03:54:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9077 states. [2025-03-04 03:54:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9077 to 9077. [2025-03-04 03:54:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9077 states, 6804 states have (on average 1.3365667254556144) internal successors, (9094), 6875 states have internal predecessors, (9094), 1961 states have call successors, (1961), 312 states have call predecessors, (1961), 311 states have return successors, (1958), 1954 states have call predecessors, (1958), 1954 states have call successors, (1958) [2025-03-04 03:54:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9077 states to 9077 states and 13013 transitions. [2025-03-04 03:54:04,926 INFO L78 Accepts]: Start accepts. Automaton has 9077 states and 13013 transitions. Word has length 73 [2025-03-04 03:54:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:54:04,928 INFO L471 AbstractCegarLoop]: Abstraction has 9077 states and 13013 transitions. [2025-03-04 03:54:04,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:54:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9077 states and 13013 transitions. [2025-03-04 03:54:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 03:54:04,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:54:04,934 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:54:04,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 03:54:04,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:54:04,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:54:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -38788214, now seen corresponding path program 1 times [2025-03-04 03:54:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:54:04,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398551896] [2025-03-04 03:54:04,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:54:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:05,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 03:54:05,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 03:54:05,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:05,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 03:54:06,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:06,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398551896] [2025-03-04 03:54:06,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398551896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:06,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:06,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:54:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879002809] [2025-03-04 03:54:06,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:06,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:54:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:06,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:54:06,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:54:06,553 INFO L87 Difference]: Start difference. First operand 9077 states and 13013 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 03:54:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:54:09,550 INFO L93 Difference]: Finished difference Result 9125 states and 13056 transitions. [2025-03-04 03:54:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:54:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 79 [2025-03-04 03:54:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:54:09,588 INFO L225 Difference]: With dead ends: 9125 [2025-03-04 03:54:09,588 INFO L226 Difference]: Without dead ends: 9022 [2025-03-04 03:54:09,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:54:09,596 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 0 mSDsluCounter, 4597 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5750 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 03:54:09,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5750 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 03:54:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9022 states. [2025-03-04 03:54:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9022 to 9022. [2025-03-04 03:54:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9022 states, 6766 states have (on average 1.3360922258350576) internal successors, (9040), 6832 states have internal predecessors, (9040), 1944 states have call successors, (1944), 311 states have call predecessors, (1944), 311 states have return successors, (1944), 1942 states have call predecessors, (1944), 1940 states have call successors, (1944) [2025-03-04 03:54:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9022 states to 9022 states and 12928 transitions. [2025-03-04 03:54:09,862 INFO L78 Accepts]: Start accepts. Automaton has 9022 states and 12928 transitions. Word has length 79 [2025-03-04 03:54:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:54:09,862 INFO L471 AbstractCegarLoop]: Abstraction has 9022 states and 12928 transitions. [2025-03-04 03:54:09,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 03:54:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 9022 states and 12928 transitions. [2025-03-04 03:54:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 03:54:09,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:54:09,870 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-03-04 03:54:09,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 03:54:09,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:54:09,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:54:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 28016933, now seen corresponding path program 1 times [2025-03-04 03:54:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:54:09,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286613165] [2025-03-04 03:54:09,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:54:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:10,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 03:54:11,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 03:54:11,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:11,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 03:54:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286613165] [2025-03-04 03:54:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286613165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:11,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:11,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:54:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068837806] [2025-03-04 03:54:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:11,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:54:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:11,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:54:11,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:54:11,586 INFO L87 Difference]: Start difference. First operand 9022 states and 12928 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:54:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:54:14,768 INFO L93 Difference]: Finished difference Result 13444 states and 19271 transitions. [2025-03-04 03:54:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:54:14,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2025-03-04 03:54:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:54:14,803 INFO L225 Difference]: With dead ends: 13444 [2025-03-04 03:54:14,804 INFO L226 Difference]: Without dead ends: 9020 [2025-03-04 03:54:14,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:54:14,821 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 0 mSDsluCounter, 4578 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5725 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:54:14,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5725 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 03:54:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9020 states. [2025-03-04 03:54:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9020 to 9020. [2025-03-04 03:54:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9020 states, 6764 states have (on average 1.3358959195742164) internal successors, (9036), 6830 states have internal predecessors, (9036), 1944 states have call successors, (1944), 311 states have call predecessors, (1944), 311 states have return successors, (1944), 1942 states have call predecessors, (1944), 1940 states have call successors, (1944) [2025-03-04 03:54:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 12924 transitions. [2025-03-04 03:54:15,129 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 12924 transitions. Word has length 75 [2025-03-04 03:54:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:54:15,130 INFO L471 AbstractCegarLoop]: Abstraction has 9020 states and 12924 transitions. [2025-03-04 03:54:15,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:54:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 12924 transitions. [2025-03-04 03:54:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 03:54:15,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:54:15,137 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-03-04 03:54:15,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 03:54:15,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:54:15,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:54:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2057425368, now seen corresponding path program 1 times [2025-03-04 03:54:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:54:15,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071423765] [2025-03-04 03:54:15,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:54:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:16,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 03:54:16,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 03:54:16,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:16,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 03:54:17,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:17,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071423765] [2025-03-04 03:54:17,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071423765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:17,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:17,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:54:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6618327] [2025-03-04 03:54:17,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:17,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:54:17,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:17,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:54:17,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:54:17,023 INFO L87 Difference]: Start difference. First operand 9020 states and 12924 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:54:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:54:20,019 INFO L93 Difference]: Finished difference Result 9146 states and 13070 transitions. [2025-03-04 03:54:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:54:20,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2025-03-04 03:54:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:54:20,026 INFO L225 Difference]: With dead ends: 9146 [2025-03-04 03:54:20,026 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 03:54:20,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:54:20,047 INFO L435 NwaCegarLoop]: 1135 mSDtfsCounter, 0 mSDsluCounter, 4533 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5668 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 03:54:20,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5668 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 03:54:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 03:54:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 03:54:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:54:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 03:54:20,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2025-03-04 03:54:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:54:20,054 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 03:54:20,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:54:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 03:54:20,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 03:54:20,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 03:54:20,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 03:54:20,060 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:54:20,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.