./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:36:09,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:36:09,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:36:09,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:36:09,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:36:09,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:36:09,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:36:09,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:36:09,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:36:09,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:36:09,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:36:09,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:36:09,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:36:09,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:36:09,610 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:36:09,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:36:09,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:36:09,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:36:09,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:36:09,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:36:09,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:36:09,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:36:09,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:36:09,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:36:09,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:36:09,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:36:09,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:36:09,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:36:09,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:36:09,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:36:09,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:36:09,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:36:09,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:36:09,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:36:09,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:36:09,613 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 [2025-01-09 17:36:09,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:36:09,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:36:09,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:36:09,847 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:36:09,847 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:36:09,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2025-01-09 17:36:11,028 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc9c63456/3f7224e57dbf4c28b4b3d0bca6d98bab/FLAG929fc6f71 [2025-01-09 17:36:11,423 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:36:11,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2025-01-09 17:36:11,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc9c63456/3f7224e57dbf4c28b4b3d0bca6d98bab/FLAG929fc6f71 [2025-01-09 17:36:11,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc9c63456/3f7224e57dbf4c28b4b3d0bca6d98bab [2025-01-09 17:36:11,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:36:11,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:36:11,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:36:11,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:36:11,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:36:11,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:36:11" (1/1) ... [2025-01-09 17:36:11,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc7c8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:11, skipping insertion in model container [2025-01-09 17:36:11,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:36:11" (1/1) ... [2025-01-09 17:36:11,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:36:12,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2025-01-09 17:36:12,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:36:12,216 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:36:12,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2025-01-09 17:36:12,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:36:12,454 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:36:12,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12 WrapperNode [2025-01-09 17:36:12,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:36:12,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:36:12,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:36:12,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:36:12,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,560 INFO L138 Inliner]: procedures = 82, calls = 541, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 2109 [2025-01-09 17:36:12,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:36:12,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:36:12,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:36:12,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:36:12,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,647 INFO L175 MemorySlicer]: Split 361 memory accesses to 21 slices as follows [2, 2, 7, 1, 1, 9, 1, 9, 5, 8, 2, 8, 8, 48, 7, 7, 7, 8, 151, 1, 69]. 42 percent of accesses are in the largest equivalence class. The 110 initializations are split as follows [2, 0, 7, 1, 1, 9, 0, 9, 0, 8, 0, 8, 8, 14, 7, 7, 7, 8, 14, 0, 0]. The 183 writes are split as follows [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 13, 0, 0, 0, 0, 100, 0, 69]. [2025-01-09 17:36:12,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:36:12,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:36:12,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:36:12,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:36:12,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (1/1) ... [2025-01-09 17:36:12,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:36:12,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:36:12,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 17:36:12,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 17:36:12,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:36:12,850 INFO L130 BoogieDeclarations]: Found specification of procedure ir_init [2025-01-09 17:36:12,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_init [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 17:36:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 17:36:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 17:36:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 17:36:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 17:36:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 17:36:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 17:36:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 17:36:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 17:36:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 17:36:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 17:36:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure ir_exit [2025-01-09 17:36:12,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_exit [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 17:36:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 17:36:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 17:36:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 17:36:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 17:36:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 17:36:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 17:36:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 17:36:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 17:36:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-01-09 17:36:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-01-09 17:36:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-01-09 17:36:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure ir_xbof_change [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_xbof_change [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2025-01-09 17:36:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2025-01-09 17:36:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:36:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:36:12,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:36:13,175 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:36:13,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:36:13,265 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-01-09 17:36:13,266 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-09 17:36:13,302 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2025-01-09 17:36:13,302 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2025-01-09 17:36:13,338 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-09 17:36:13,342 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-09 17:36:13,356 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-09 17:36:21,234 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume !false; [2025-01-09 17:36:21,234 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume false; [2025-01-09 17:36:21,234 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##65: assume false; [2025-01-09 17:36:21,234 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##66: assume !false; [2025-01-09 17:36:21,235 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume !false; [2025-01-09 17:36:21,235 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume false; [2025-01-09 17:36:21,303 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2025-01-09 17:36:21,304 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:36:21,314 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:36:21,314 INFO L312 CfgBuilder]: Removed 23 assume(true) statements. [2025-01-09 17:36:21,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:36:21 BoogieIcfgContainer [2025-01-09 17:36:21,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:36:21,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:36:21,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:36:21,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:36:21,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:36:11" (1/3) ... [2025-01-09 17:36:21,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6df9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:36:21, skipping insertion in model container [2025-01-09 17:36:21,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:36:12" (2/3) ... [2025-01-09 17:36:21,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6df9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:36:21, skipping insertion in model container [2025-01-09 17:36:21,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:36:21" (3/3) ... [2025-01-09 17:36:21,321 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2025-01-09 17:36:21,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:36:21,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i that has 16 procedures, 368 locations, 1 initial locations, 22 loop locations, and 1 error locations. [2025-01-09 17:36:21,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:36:21,381 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;@1ff94e25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:36:21,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:36:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 306 states have (on average 1.4411764705882353) internal successors, (441), 315 states have internal predecessors, (441), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 17:36:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 17:36:21,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:21,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:21,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:21,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:21,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1896714346, now seen corresponding path program 1 times [2025-01-09 17:36:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138457292] [2025-01-09 17:36:21,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:25,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 17:36:25,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 17:36:25,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:25,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:36:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138457292] [2025-01-09 17:36:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138457292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:36:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440725021] [2025-01-09 17:36:26,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:26,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:36:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:26,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:36:26,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:26,135 INFO L87 Difference]: Start difference. First operand has 367 states, 306 states have (on average 1.4411764705882353) internal successors, (441), 315 states have internal predecessors, (441), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 17:36:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:26,310 INFO L93 Difference]: Finished difference Result 1047 states and 1534 transitions. [2025-01-09 17:36:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:36:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-09 17:36:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:26,322 INFO L225 Difference]: With dead ends: 1047 [2025-01-09 17:36:26,322 INFO L226 Difference]: Without dead ends: 692 [2025-01-09 17:36:26,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:26,330 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 488 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:26,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1006 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-01-09 17:36:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 689. [2025-01-09 17:36:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 579 states have (on average 1.3592400690846287) internal successors, (787), 589 states have internal predecessors, (787), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 17:36:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 952 transitions. [2025-01-09 17:36:26,400 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 952 transitions. Word has length 18 [2025-01-09 17:36:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:26,400 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 952 transitions. [2025-01-09 17:36:26,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 17:36:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 952 transitions. [2025-01-09 17:36:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 17:36:26,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:26,401 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-01-09 17:36:26,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 17:36:26,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:26,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1331277514, now seen corresponding path program 1 times [2025-01-09 17:36:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:26,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081726497] [2025-01-09 17:36:26,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:30,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 17:36:30,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 17:36:30,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:30,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:36:30,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:30,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081726497] [2025-01-09 17:36:30,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081726497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:30,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:30,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:36:30,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290418867] [2025-01-09 17:36:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:36:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:30,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:36:30,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:30,371 INFO L87 Difference]: Start difference. First operand 689 states and 952 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 17:36:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:30,396 INFO L93 Difference]: Finished difference Result 691 states and 953 transitions. [2025-01-09 17:36:30,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:36:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-09 17:36:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:30,400 INFO L225 Difference]: With dead ends: 691 [2025-01-09 17:36:30,400 INFO L226 Difference]: Without dead ends: 679 [2025-01-09 17:36:30,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:30,402 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 483 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:30,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:36:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-01-09 17:36:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-01-09 17:36:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 573 states have (on average 1.356020942408377) internal successors, (777), 581 states have internal predecessors, (777), 81 states have call successors, (81), 25 states have call predecessors, (81), 24 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-01-09 17:36:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 937 transitions. [2025-01-09 17:36:30,438 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 937 transitions. Word has length 19 [2025-01-09 17:36:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:30,439 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 937 transitions. [2025-01-09 17:36:30,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 17:36:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 937 transitions. [2025-01-09 17:36:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 17:36:30,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:30,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:30,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:36:30,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:30,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1070566864, now seen corresponding path program 1 times [2025-01-09 17:36:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:30,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103825479] [2025-01-09 17:36:30,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:33,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 17:36:33,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 17:36:33,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:33,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:36:34,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:34,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103825479] [2025-01-09 17:36:34,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103825479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:34,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:34,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:36:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429870342] [2025-01-09 17:36:34,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:34,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:36:34,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:34,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:36:34,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:36:34,620 INFO L87 Difference]: Start difference. First operand 679 states and 937 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:36:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:34,837 INFO L93 Difference]: Finished difference Result 1312 states and 1814 transitions. [2025-01-09 17:36:34,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:36:34,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2025-01-09 17:36:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:34,841 INFO L225 Difference]: With dead ends: 1312 [2025-01-09 17:36:34,841 INFO L226 Difference]: Without dead ends: 656 [2025-01-09 17:36:34,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:36:34,843 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 0 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:34,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1456 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:36:34,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-01-09 17:36:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2025-01-09 17:36:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 558 states have (on average 1.3548387096774193) internal successors, (756), 563 states have internal predecessors, (756), 74 states have call successors, (74), 24 states have call predecessors, (74), 23 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 17:36:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 902 transitions. [2025-01-09 17:36:34,862 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 902 transitions. Word has length 77 [2025-01-09 17:36:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:34,862 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 902 transitions. [2025-01-09 17:36:34,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:36:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 902 transitions. [2025-01-09 17:36:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 17:36:34,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:34,865 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:34,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 17:36:34,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:34,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:34,866 INFO L85 PathProgramCache]: Analyzing trace with hash -944852387, now seen corresponding path program 1 times [2025-01-09 17:36:34,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:34,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790459091] [2025-01-09 17:36:34,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:38,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 17:36:38,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 17:36:38,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:38,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:36:39,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790459091] [2025-01-09 17:36:39,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790459091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:39,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:39,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 17:36:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322720793] [2025-01-09 17:36:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:39,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:36:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:39,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:36:39,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:36:39,626 INFO L87 Difference]: Start difference. First operand 656 states and 902 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:36:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:39,830 INFO L93 Difference]: Finished difference Result 1008 states and 1388 transitions. [2025-01-09 17:36:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:36:39,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-01-09 17:36:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:39,834 INFO L225 Difference]: With dead ends: 1008 [2025-01-09 17:36:39,835 INFO L226 Difference]: Without dead ends: 670 [2025-01-09 17:36:39,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:36:39,836 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:39,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2909 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:36:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-01-09 17:36:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2025-01-09 17:36:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 568 states have (on average 1.3485915492957747) internal successors, (766), 573 states have internal predecessors, (766), 74 states have call successors, (74), 24 states have call predecessors, (74), 27 states have return successors, (80), 75 states have call predecessors, (80), 72 states have call successors, (80) [2025-01-09 17:36:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 920 transitions. [2025-01-09 17:36:39,864 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 920 transitions. Word has length 74 [2025-01-09 17:36:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:39,864 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 920 transitions. [2025-01-09 17:36:39,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:36:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 920 transitions. [2025-01-09 17:36:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 17:36:39,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:39,867 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:39,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 17:36:39,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:39,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1340011068, now seen corresponding path program 1 times [2025-01-09 17:36:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:39,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885231345] [2025-01-09 17:36:39,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:43,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 17:36:43,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 17:36:43,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:43,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:36:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885231345] [2025-01-09 17:36:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885231345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:44,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:44,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:36:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826858487] [2025-01-09 17:36:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:44,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:36:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:44,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:36:44,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:36:44,183 INFO L87 Difference]: Start difference. First operand 670 states and 920 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:36:44,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:44,915 INFO L93 Difference]: Finished difference Result 1016 states and 1396 transitions. [2025-01-09 17:36:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:36:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-01-09 17:36:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:44,920 INFO L225 Difference]: With dead ends: 1016 [2025-01-09 17:36:44,920 INFO L226 Difference]: Without dead ends: 671 [2025-01-09 17:36:44,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:36:44,922 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 17 mSDsluCounter, 3337 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3819 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:44,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3819 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 17:36:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-01-09 17:36:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 670. [2025-01-09 17:36:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 568 states have (on average 1.346830985915493) internal successors, (765), 573 states have internal predecessors, (765), 74 states have call successors, (74), 24 states have call predecessors, (74), 27 states have return successors, (80), 75 states have call predecessors, (80), 72 states have call successors, (80) [2025-01-09 17:36:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 919 transitions. [2025-01-09 17:36:44,939 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 919 transitions. Word has length 74 [2025-01-09 17:36:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:44,939 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 919 transitions. [2025-01-09 17:36:44,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:36:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 919 transitions. [2025-01-09 17:36:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 17:36:44,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:44,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:44,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 17:36:44,941 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:44,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2008392625, now seen corresponding path program 1 times [2025-01-09 17:36:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:44,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254239733] [2025-01-09 17:36:44,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:48,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 17:36:48,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 17:36:48,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:48,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:36:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:48,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254239733] [2025-01-09 17:36:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254239733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:48,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:36:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505507977] [2025-01-09 17:36:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:36:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:48,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:36:48,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:36:48,891 INFO L87 Difference]: Start difference. First operand 670 states and 919 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:36:53,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:36:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:54,997 INFO L93 Difference]: Finished difference Result 1016 states and 1395 transitions. [2025-01-09 17:36:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:36:54,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 77 [2025-01-09 17:36:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:55,003 INFO L225 Difference]: With dead ends: 1016 [2025-01-09 17:36:55,003 INFO L226 Difference]: Without dead ends: 1013 [2025-01-09 17:36:55,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:36:55,004 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 857 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:55,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1903 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-01-09 17:36:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-01-09 17:36:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 999. [2025-01-09 17:36:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 848 states have (on average 1.3502358490566038) internal successors, (1145), 856 states have internal predecessors, (1145), 111 states have call successors, (111), 34 states have call predecessors, (111), 39 states have return successors, (123), 113 states have call predecessors, (123), 109 states have call successors, (123) [2025-01-09 17:36:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1379 transitions. [2025-01-09 17:36:55,034 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1379 transitions. Word has length 77 [2025-01-09 17:36:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:55,034 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1379 transitions. [2025-01-09 17:36:55,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:36:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1379 transitions. [2025-01-09 17:36:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 17:36:55,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:55,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:55,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 17:36:55,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1624092077, now seen corresponding path program 1 times [2025-01-09 17:36:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30491800] [2025-01-09 17:36:55,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:58,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 17:36:58,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 17:36:58,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:58,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:36:58,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:58,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30491800] [2025-01-09 17:36:58,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30491800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:58,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:58,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:36:58,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554071573] [2025-01-09 17:36:58,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:58,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:36:58,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:58,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:36:58,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:58,984 INFO L87 Difference]: Start difference. First operand 999 states and 1379 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:36:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:59,928 INFO L93 Difference]: Finished difference Result 2969 states and 4107 transitions. [2025-01-09 17:36:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:36:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-01-09 17:36:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:59,935 INFO L225 Difference]: With dead ends: 2969 [2025-01-09 17:36:59,935 INFO L226 Difference]: Without dead ends: 1993 [2025-01-09 17:36:59,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:36:59,937 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 491 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:59,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1850 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 17:36:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2025-01-09 17:36:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1945. [2025-01-09 17:36:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1652 states have (on average 1.3577481840193704) internal successors, (2243), 1669 states have internal predecessors, (2243), 215 states have call successors, (215), 63 states have call predecessors, (215), 77 states have return successors, (244), 221 states have call predecessors, (244), 213 states have call successors, (244) [2025-01-09 17:36:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2702 transitions. [2025-01-09 17:36:59,988 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2702 transitions. Word has length 93 [2025-01-09 17:36:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:59,988 INFO L471 AbstractCegarLoop]: Abstraction has 1945 states and 2702 transitions. [2025-01-09 17:36:59,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:36:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2702 transitions. [2025-01-09 17:36:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 17:36:59,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:59,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:59,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 17:36:59,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:59,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash -97864663, now seen corresponding path program 1 times [2025-01-09 17:36:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:59,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670876121] [2025-01-09 17:36:59,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:59,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:37:03,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 17:37:03,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 17:37:03,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:37:03,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:37:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 17:37:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:37:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670876121] [2025-01-09 17:37:05,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670876121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:37:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184971717] [2025-01-09 17:37:05,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:37:05,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:37:05,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:37:05,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:37:05,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 17:37:09,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 17:37:09,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 17:37:09,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:37:09,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:37:09,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 3167 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 17:37:09,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:37:10,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:37:10,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-09 17:37:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:37:11,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:37:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184971717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:37:11,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:37:11,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2025-01-09 17:37:11,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534213633] [2025-01-09 17:37:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:37:11,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:37:11,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:37:11,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:37:11,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 17:37:11,500 INFO L87 Difference]: Start difference. First operand 1945 states and 2702 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:37:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:37:12,165 INFO L93 Difference]: Finished difference Result 3855 states and 5356 transitions. [2025-01-09 17:37:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:37:12,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2025-01-09 17:37:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:37:12,171 INFO L225 Difference]: With dead ends: 3855 [2025-01-09 17:37:12,172 INFO L226 Difference]: Without dead ends: 1903 [2025-01-09 17:37:12,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:37:12,175 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 459 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 17:37:12,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 928 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 17:37:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2025-01-09 17:37:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2025-01-09 17:37:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1619 states have (on average 1.3446571957998765) internal successors, (2177), 1633 states have internal predecessors, (2177), 209 states have call successors, (209), 63 states have call predecessors, (209), 74 states have return successors, (235), 215 states have call predecessors, (235), 207 states have call successors, (235) [2025-01-09 17:37:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2621 transitions. [2025-01-09 17:37:12,224 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2621 transitions. Word has length 93 [2025-01-09 17:37:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:37:12,224 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2621 transitions. [2025-01-09 17:37:12,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:37:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2621 transitions. [2025-01-09 17:37:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 17:37:12,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:37:12,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:37:12,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 17:37:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:37:12,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:37:12,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:37:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash 458711795, now seen corresponding path program 1 times [2025-01-09 17:37:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:37:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344815626] [2025-01-09 17:37:12,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:37:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:37:15,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 17:37:15,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 17:37:15,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:37:15,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:37:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 17:37:17,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:37:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344815626] [2025-01-09 17:37:17,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344815626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:37:17,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032639663] [2025-01-09 17:37:17,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:37:17,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:37:17,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:37:17,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:37:17,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 17:37:21,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 17:37:22,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 17:37:22,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:37:22,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:37:22,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 3174 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 17:37:22,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:37:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 17:37:23,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:37:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 17:37:24,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032639663] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:37:24,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:37:24,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 16 [2025-01-09 17:37:24,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74280503] [2025-01-09 17:37:24,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:37:24,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 17:37:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:37:24,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 17:37:24,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-01-09 17:37:24,544 INFO L87 Difference]: Start difference. First operand 1903 states and 2621 transitions. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 14 states have internal predecessors, (95), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:37:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:37:26,993 INFO L93 Difference]: Finished difference Result 2661 states and 3655 transitions. [2025-01-09 17:37:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 17:37:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 14 states have internal predecessors, (95), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 101 [2025-01-09 17:37:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:37:27,001 INFO L225 Difference]: With dead ends: 2661 [2025-01-09 17:37:27,002 INFO L226 Difference]: Without dead ends: 1366 [2025-01-09 17:37:27,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-09 17:37:27,005 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 26 mSDsluCounter, 6079 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6552 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 17:37:27,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6552 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 17:37:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-01-09 17:37:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1360. [2025-01-09 17:37:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1146 states have (on average 1.3324607329842932) internal successors, (1527), 1158 states have internal predecessors, (1527), 153 states have call successors, (153), 55 states have call predecessors, (153), 60 states have return successors, (167), 153 states have call predecessors, (167), 151 states have call successors, (167) [2025-01-09 17:37:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1847 transitions. [2025-01-09 17:37:27,044 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1847 transitions. Word has length 101 [2025-01-09 17:37:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:37:27,044 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1847 transitions. [2025-01-09 17:37:27,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 14 states have internal predecessors, (95), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:37:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1847 transitions. [2025-01-09 17:37:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 17:37:27,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:37:27,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:37:27,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 17:37:27,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:37:27,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:37:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:37:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1194540248, now seen corresponding path program 1 times [2025-01-09 17:37:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:37:27,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796474138] [2025-01-09 17:37:27,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:37:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:37:30,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 17:37:30,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 17:37:30,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:37:30,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:37:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 17:37:31,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:37:31,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796474138] [2025-01-09 17:37:31,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796474138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:37:31,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:37:31,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:37:31,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485914107] [2025-01-09 17:37:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:37:31,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:37:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:37:31,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:37:31,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:37:31,304 INFO L87 Difference]: Start difference. First operand 1360 states and 1847 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:37:35,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:37:39,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:37:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:37:41,871 INFO L93 Difference]: Finished difference Result 2714 states and 3687 transitions. [2025-01-09 17:37:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:37:41,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2025-01-09 17:37:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:37:41,876 INFO L225 Difference]: With dead ends: 2714 [2025-01-09 17:37:41,876 INFO L226 Difference]: Without dead ends: 1360 [2025-01-09 17:37:41,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:37:41,878 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 480 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:37:41,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1222 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2025-01-09 17:37:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-01-09 17:37:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2025-01-09 17:37:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1146 states have (on average 1.331588132635253) internal successors, (1526), 1158 states have internal predecessors, (1526), 153 states have call successors, (153), 55 states have call predecessors, (153), 60 states have return successors, (167), 153 states have call predecessors, (167), 151 states have call successors, (167) [2025-01-09 17:37:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1846 transitions. [2025-01-09 17:37:41,915 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1846 transitions. Word has length 103 [2025-01-09 17:37:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:37:41,915 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1846 transitions. [2025-01-09 17:37:41,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:37:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1846 transitions. [2025-01-09 17:37:41,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 17:37:41,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:37:41,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:37:41,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 17:37:41,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:37:41,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:37:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash -711863018, now seen corresponding path program 1 times [2025-01-09 17:37:41,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:37:41,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990611883] [2025-01-09 17:37:41,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:37:41,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms