./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.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.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.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 b0b334a11302bf275fa3309d3cd34d1e1506650a5df36f9442e98ab153dfb38d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:31:51,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:31:51,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:31:51,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:31:51,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:31:51,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:31:51,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:31:51,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:31:51,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:31:51,183 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:31:51,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:31:51,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:31:51,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:31:51,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:31:51,185 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:31:51,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:31:51,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:31:51,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:31:51,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:31:51,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:31:51,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:31:51,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:31:51,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:31:51,186 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:31:51,186 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:31:51,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:31:51,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:31:51,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:31:51,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:31:51,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:31:51,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:31:51,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:31:51,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:31:51,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:31:51,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:31:51,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:31:51,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:31:51,187 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:31:51,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:31:51,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:31:51,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:31:51,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:31:51,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:31:51,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:31:51,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:31:51,188 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 -> b0b334a11302bf275fa3309d3cd34d1e1506650a5df36f9442e98ab153dfb38d [2025-01-09 18:31:51,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:31:51,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:31:51,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:31:51,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:31:51,420 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:31:51,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2025-01-09 18:31:52,588 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a88694f40/6336fadebc1248cf9f89ec782e14ec24/FLAG0705bbd9e [2025-01-09 18:31:53,007 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:31:53,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2025-01-09 18:31:53,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a88694f40/6336fadebc1248cf9f89ec782e14ec24/FLAG0705bbd9e [2025-01-09 18:31:53,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a88694f40/6336fadebc1248cf9f89ec782e14ec24 [2025-01-09 18:31:53,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:31:53,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:31:53,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:31:53,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:31:53,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:31:53,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:31:53" (1/1) ... [2025-01-09 18:31:53,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474b80d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:53, skipping insertion in model container [2025-01-09 18:31:53,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:31:53" (1/1) ... [2025-01-09 18:31:53,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:31:53,455 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2025-01-09 18:31:53,455 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] [2025-01-09 18:31:53,700 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.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] [2025-01-09 18:31:54,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:31:54,081 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:31:54,145 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2025-01-09 18:31:54,146 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] [2025-01-09 18:31:54,153 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.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] [2025-01-09 18:31:54,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:31:54,288 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:31:54,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54 WrapperNode [2025-01-09 18:31:54,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:31:54,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:31:54,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:31:54,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:31:54,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,371 INFO L138 Inliner]: procedures = 139, calls = 843, calls flagged for inlining = 60, calls inlined = 49, statements flattened = 1852 [2025-01-09 18:31:54,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:31:54,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:31:54,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:31:54,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:31:54,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,485 INFO L175 MemorySlicer]: Split 358 memory accesses to 15 slices as follows [167, 17, 2, 3, 30, 9, 12, 1, 5, 0, 2, 8, 24, 77, 1]. 47 percent of accesses are in the largest equivalence class. The 35 initializations are split as follows [4, 0, 2, 0, 0, 9, 12, 0, 0, 0, 0, 8, 0, 0, 0]. The 212 writes are split as follows [64, 8, 0, 2, 30, 0, 0, 1, 3, 0, 2, 0, 24, 77, 1]. [2025-01-09 18:31:54,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:31:54,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:31:54,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:31:54,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:31:54,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (1/1) ... [2025-01-09 18:31:54,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:31:54,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:31:54,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:31:54,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:31:54,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:31:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:31:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:31:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:31:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:31:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:31:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:31:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:31:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:31:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:31:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:31:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:31:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:31:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 18:31:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 18:31:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 18:31:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:31:54,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure dma_pool_alloc [2025-01-09 18:31:54,682 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_pool_alloc [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-01-09 18:31:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-01-09 18:31:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:31:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:31:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:31:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:31:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:31:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:31:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:31:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:31:54,688 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_dealloc_kioc [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_dealloc_kioc [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_attach_buf [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_attach_buf [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2025-01-09 18:31:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:31:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-09 18:31:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 18:31:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 18:31:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 18:31:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-09 18:31:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-09 18:31:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_ioctl [2025-01-09 18:31:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_ioctl [2025-01-09 18:31:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:31:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:31:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:31:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-01-09 18:31:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2025-01-09 18:31:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 18:31:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2025-01-09 18:31:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-01-09 18:31:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-01-09 18:31:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure up [2025-01-09 18:31:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure up [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-01-09 18:31:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-09 18:31:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-01-09 18:31:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-01-09 18:31:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:31:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:31:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:31:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:31:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:31:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:31:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:31:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:31:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:31:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:31:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:31:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:31:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:31:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:31:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:31:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 18:31:54,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-01-09 18:31:54,698 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:31:54,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:31:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure dma_pool_free [2025-01-09 18:31:54,698 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_pool_free [2025-01-09 18:31:55,152 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:31:55,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:31:55,437 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:32:01,935 INFO L? ?]: Removed 819 outVars from TransFormulas that were not future-live. [2025-01-09 18:32:01,935 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:32:01,961 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:32:01,962 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:32:01,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:32:01 BoogieIcfgContainer [2025-01-09 18:32:01,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:32:01,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:32:01,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:32:01,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:32:01,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:31:53" (1/3) ... [2025-01-09 18:32:01,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758edb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:32:01, skipping insertion in model container [2025-01-09 18:32:01,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:31:54" (2/3) ... [2025-01-09 18:32:01,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758edb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:32:01, skipping insertion in model container [2025-01-09 18:32:01,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:32:01" (3/3) ... [2025-01-09 18:32:01,970 INFO L128 eAbstractionObserver]: Analyzing ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2025-01-09 18:32:01,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:32:01,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i that has 57 procedures, 588 locations, 1 initial locations, 46 loop locations, and 1 error locations. [2025-01-09 18:32:02,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:32:02,064 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;@138f8261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:32:02,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:32:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 465 states, 358 states have (on average 1.4078212290502794) internal successors, (504), 366 states have internal predecessors, (504), 77 states have call successors, (77), 29 states have call predecessors, (77), 28 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 18:32:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 18:32:02,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:02,083 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 18:32:02,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:02,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:02,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1137125530, now seen corresponding path program 1 times [2025-01-09 18:32:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:02,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000075277] [2025-01-09 18:32:02,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:03,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 18:32:03,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 18:32:03,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:03,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 18:32:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000075277] [2025-01-09 18:32:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000075277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:04,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:32:04,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:32:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160284156] [2025-01-09 18:32:04,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:04,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:32:04,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:04,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:32:04,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:04,141 INFO L87 Difference]: Start difference. First operand has 465 states, 358 states have (on average 1.4078212290502794) internal successors, (504), 366 states have internal predecessors, (504), 77 states have call successors, (77), 29 states have call predecessors, (77), 28 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 18:32:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:04,408 INFO L93 Difference]: Finished difference Result 971 states and 1380 transitions. [2025-01-09 18:32:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:32:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 131 [2025-01-09 18:32:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:04,420 INFO L225 Difference]: With dead ends: 971 [2025-01-09 18:32:04,420 INFO L226 Difference]: Without dead ends: 480 [2025-01-09 18:32:04,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:04,428 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 58 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:04,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1267 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 18:32:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-01-09 18:32:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 477. [2025-01-09 18:32:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 371 states have (on average 1.38544474393531) internal successors, (514), 375 states have internal predecessors, (514), 76 states have call successors, (76), 30 states have call predecessors, (76), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 18:32:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 665 transitions. [2025-01-09 18:32:04,499 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 665 transitions. Word has length 131 [2025-01-09 18:32:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:04,500 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 665 transitions. [2025-01-09 18:32:04,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 18:32:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 665 transitions. [2025-01-09 18:32:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 18:32:04,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:04,506 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:32:04,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -61551491, now seen corresponding path program 1 times [2025-01-09 18:32:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603000725] [2025-01-09 18:32:04,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:05,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 18:32:05,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 18:32:05,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:05,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-09 18:32:06,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:06,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603000725] [2025-01-09 18:32:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603000725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:06,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:32:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:32:06,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70447880] [2025-01-09 18:32:06,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:06,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:32:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:06,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:32:06,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:06,216 INFO L87 Difference]: Start difference. First operand 477 states and 665 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 18:32:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:06,309 INFO L93 Difference]: Finished difference Result 951 states and 1329 transitions. [2025-01-09 18:32:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:32:06,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 165 [2025-01-09 18:32:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:06,314 INFO L225 Difference]: With dead ends: 951 [2025-01-09 18:32:06,314 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 18:32:06,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:06,318 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 607 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:06,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 610 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:32:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 18:32:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-01-09 18:32:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 371 states have (on average 1.3611859838274933) internal successors, (505), 375 states have internal predecessors, (505), 76 states have call successors, (76), 30 states have call predecessors, (76), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 18:32:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 656 transitions. [2025-01-09 18:32:06,354 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 656 transitions. Word has length 165 [2025-01-09 18:32:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:06,355 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 656 transitions. [2025-01-09 18:32:06,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 18:32:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 656 transitions. [2025-01-09 18:32:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 18:32:06,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:06,361 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:06,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:32:06,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:06,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1710740801, now seen corresponding path program 1 times [2025-01-09 18:32:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:06,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038781632] [2025-01-09 18:32:06,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:07,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 18:32:07,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 18:32:07,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:07,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 18:32:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038781632] [2025-01-09 18:32:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038781632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:32:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:32:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380335761] [2025-01-09 18:32:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:07,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:32:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:07,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:32:07,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:07,699 INFO L87 Difference]: Start difference. First operand 477 states and 656 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 18:32:11,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:32:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:12,026 INFO L93 Difference]: Finished difference Result 1003 states and 1379 transitions. [2025-01-09 18:32:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:32:12,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 175 [2025-01-09 18:32:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:12,030 INFO L225 Difference]: With dead ends: 1003 [2025-01-09 18:32:12,030 INFO L226 Difference]: Without dead ends: 529 [2025-01-09 18:32:12,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:12,032 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 82 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:12,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1211 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 18:32:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-01-09 18:32:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 526. [2025-01-09 18:32:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.3559322033898304) internal successors, (560), 418 states have internal predecessors, (560), 79 states have call successors, (79), 34 states have call predecessors, (79), 33 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 18:32:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 717 transitions. [2025-01-09 18:32:12,060 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 717 transitions. Word has length 175 [2025-01-09 18:32:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:12,061 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 717 transitions. [2025-01-09 18:32:12,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 18:32:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 717 transitions. [2025-01-09 18:32:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 18:32:12,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:12,066 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:12,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:32:12,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:12,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:12,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1603165330, now seen corresponding path program 1 times [2025-01-09 18:32:12,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:12,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208360939] [2025-01-09 18:32:12,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:12,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:13,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 18:32:13,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 18:32:13,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:13,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 18:32:13,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:13,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208360939] [2025-01-09 18:32:13,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208360939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:13,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:32:13,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:32:13,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20192976] [2025-01-09 18:32:13,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:13,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:32:13,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:13,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:32:13,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:13,306 INFO L87 Difference]: Start difference. First operand 526 states and 717 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:32:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:13,380 INFO L93 Difference]: Finished difference Result 1050 states and 1433 transitions. [2025-01-09 18:32:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:32:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 193 [2025-01-09 18:32:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:13,383 INFO L225 Difference]: With dead ends: 1050 [2025-01-09 18:32:13,383 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 18:32:13,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:13,385 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 0 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:13,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:32:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 18:32:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-01-09 18:32:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 414 states have (on average 1.355072463768116) internal successors, (561), 419 states have internal predecessors, (561), 79 states have call successors, (79), 34 states have call predecessors, (79), 33 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 18:32:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 718 transitions. [2025-01-09 18:32:13,399 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 718 transitions. Word has length 193 [2025-01-09 18:32:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:13,399 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 718 transitions. [2025-01-09 18:32:13,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:32:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 718 transitions. [2025-01-09 18:32:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 18:32:13,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:13,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:13,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:32:13,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:13,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2013775696, now seen corresponding path program 1 times [2025-01-09 18:32:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:13,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936984966] [2025-01-09 18:32:13,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:14,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 18:32:14,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 18:32:14,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:14,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 18:32:14,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936984966] [2025-01-09 18:32:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936984966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:14,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:32:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:32:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622125057] [2025-01-09 18:32:14,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:14,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:32:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:14,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:32:14,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:32:14,898 INFO L87 Difference]: Start difference. First operand 527 states and 718 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:32:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:15,061 INFO L93 Difference]: Finished difference Result 1053 states and 1438 transitions. [2025-01-09 18:32:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:32:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 193 [2025-01-09 18:32:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:15,066 INFO L225 Difference]: With dead ends: 1053 [2025-01-09 18:32:15,067 INFO L226 Difference]: Without dead ends: 529 [2025-01-09 18:32:15,069 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 18:32:15,069 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 0 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:15,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1834 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:32:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-01-09 18:32:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-01-09 18:32:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 416 states have (on average 1.3533653846153846) internal successors, (563), 421 states have internal predecessors, (563), 79 states have call successors, (79), 34 states have call predecessors, (79), 33 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 18:32:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 720 transitions. [2025-01-09 18:32:15,098 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 720 transitions. Word has length 193 [2025-01-09 18:32:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:15,101 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 720 transitions. [2025-01-09 18:32:15,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:32:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 720 transitions. [2025-01-09 18:32:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 18:32:15,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:15,104 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:15,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:32:15,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:15,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1642435087, now seen corresponding path program 1 times [2025-01-09 18:32:15,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:15,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455725775] [2025-01-09 18:32:15,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:15,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 18:32:15,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 18:32:15,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:15,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 18:32:16,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:16,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455725775] [2025-01-09 18:32:16,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455725775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:16,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:32:16,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:32:16,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820503624] [2025-01-09 18:32:16,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:16,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:32:16,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:16,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:32:16,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:16,137 INFO L87 Difference]: Start difference. First operand 529 states and 720 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:32:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:16,217 INFO L93 Difference]: Finished difference Result 1056 states and 1441 transitions. [2025-01-09 18:32:16,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:32:16,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 211 [2025-01-09 18:32:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:16,221 INFO L225 Difference]: With dead ends: 1056 [2025-01-09 18:32:16,221 INFO L226 Difference]: Without dead ends: 530 [2025-01-09 18:32:16,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:16,223 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 0 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:16,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1226 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:32:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-09 18:32:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-01-09 18:32:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 417 states have (on average 1.3525179856115108) internal successors, (564), 422 states have internal predecessors, (564), 79 states have call successors, (79), 34 states have call predecessors, (79), 33 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 18:32:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 721 transitions. [2025-01-09 18:32:16,242 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 721 transitions. Word has length 211 [2025-01-09 18:32:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:16,243 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 721 transitions. [2025-01-09 18:32:16,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:32:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 721 transitions. [2025-01-09 18:32:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 18:32:16,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:16,245 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:16,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:32:16,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:16,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:16,247 INFO L85 PathProgramCache]: Analyzing trace with hash -238664200, now seen corresponding path program 1 times [2025-01-09 18:32:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:16,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903505424] [2025-01-09 18:32:16,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:17,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 18:32:17,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 18:32:17,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:17,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-09 18:32:17,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:17,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903505424] [2025-01-09 18:32:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903505424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:17,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:32:17,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:32:17,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332628352] [2025-01-09 18:32:17,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:17,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:32:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:17,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:32:17,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:32:17,785 INFO L87 Difference]: Start difference. First operand 530 states and 721 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:32:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:17,905 INFO L93 Difference]: Finished difference Result 1059 states and 1444 transitions. [2025-01-09 18:32:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:32:17,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 215 [2025-01-09 18:32:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:17,910 INFO L225 Difference]: With dead ends: 1059 [2025-01-09 18:32:17,910 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 18:32:17,912 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 18:32:17,912 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 0 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:17,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1834 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:32:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 18:32:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 530. [2025-01-09 18:32:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 417 states have (on average 1.3525179856115108) internal successors, (564), 422 states have internal predecessors, (564), 79 states have call successors, (79), 34 states have call predecessors, (79), 33 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 18:32:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 721 transitions. [2025-01-09 18:32:17,928 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 721 transitions. Word has length 215 [2025-01-09 18:32:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:17,928 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 721 transitions. [2025-01-09 18:32:17,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:32:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 721 transitions. [2025-01-09 18:32:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 18:32:17,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:17,930 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:32:17,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:17,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1992571654, now seen corresponding path program 1 times [2025-01-09 18:32:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287742395] [2025-01-09 18:32:17,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:18,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 18:32:18,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 18:32:18,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:18,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 18:32:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287742395] [2025-01-09 18:32:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287742395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:18,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:32:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:32:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486010696] [2025-01-09 18:32:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:18,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:32:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:18,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:32:18,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:18,987 INFO L87 Difference]: Start difference. First operand 530 states and 721 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:32:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:19,137 INFO L93 Difference]: Finished difference Result 1066 states and 1459 transitions. [2025-01-09 18:32:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:32:19,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 212 [2025-01-09 18:32:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:19,142 INFO L225 Difference]: With dead ends: 1066 [2025-01-09 18:32:19,143 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 18:32:19,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:19,145 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 8 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:19,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:32:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 18:32:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 531. [2025-01-09 18:32:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.3516746411483254) internal successors, (565), 423 states have internal predecessors, (565), 79 states have call successors, (79), 34 states have call predecessors, (79), 33 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 18:32:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 722 transitions. [2025-01-09 18:32:19,161 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 722 transitions. Word has length 212 [2025-01-09 18:32:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:19,162 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 722 transitions. [2025-01-09 18:32:19,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:32:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 722 transitions. [2025-01-09 18:32:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 18:32:19,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:19,165 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:19,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:32:19,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:19,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1596985376, now seen corresponding path program 1 times [2025-01-09 18:32:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344281555] [2025-01-09 18:32:19,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:19,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 18:32:20,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 18:32:20,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:20,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-09 18:32:20,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344281555] [2025-01-09 18:32:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344281555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:32:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57349943] [2025-01-09 18:32:20,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:20,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:32:20,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:32:20,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:32:21,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 18:32:21,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 18:32:21,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:21,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:21,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 2950 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 18:32:22,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:32:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-01-09 18:32:22,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:32:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57349943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:22,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:32:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 18:32:22,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494977627] [2025-01-09 18:32:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:22,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:32:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:22,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:32:22,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:32:22,106 INFO L87 Difference]: Start difference. First operand 531 states and 722 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 18:32:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:22,170 INFO L93 Difference]: Finished difference Result 535 states and 726 transitions. [2025-01-09 18:32:22,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:32:22,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 220 [2025-01-09 18:32:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:22,174 INFO L225 Difference]: With dead ends: 535 [2025-01-09 18:32:22,174 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 18:32:22,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:32:22,177 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 0 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:22,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:32:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 18:32:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 18:32:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.3508353221957041) internal successors, (566), 424 states have internal predecessors, (566), 79 states have call successors, (79), 34 states have call predecessors, (79), 33 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 18:32:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 723 transitions. [2025-01-09 18:32:22,193 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 723 transitions. Word has length 220 [2025-01-09 18:32:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:22,194 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 723 transitions. [2025-01-09 18:32:22,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 18:32:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 723 transitions. [2025-01-09 18:32:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 18:32:22,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:22,198 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:22,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 18:32:22,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:22,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:22,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 395719768, now seen corresponding path program 1 times [2025-01-09 18:32:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:22,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575681018] [2025-01-09 18:32:22,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:22,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:23,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 18:32:23,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 18:32:23,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:23,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-09 18:32:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575681018] [2025-01-09 18:32:23,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575681018] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:32:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100724683] [2025-01-09 18:32:23,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:23,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:23,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:32:23,734 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 18:32:23,735 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 18:32:25,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 18:32:25,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 18:32:25,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:25,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:25,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 2974 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:32:25,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:32:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 18:32:25,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:32:25,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100724683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:25,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:32:25,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 18:32:25,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046305280] [2025-01-09 18:32:25,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:25,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:32:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:25,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:32:25,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:32:25,587 INFO L87 Difference]: Start difference. First operand 532 states and 723 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:32:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:25,663 INFO L93 Difference]: Finished difference Result 1067 states and 1458 transitions. [2025-01-09 18:32:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:32:25,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 222 [2025-01-09 18:32:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:25,667 INFO L225 Difference]: With dead ends: 1067 [2025-01-09 18:32:25,667 INFO L226 Difference]: Without dead ends: 538 [2025-01-09 18:32:25,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:32:25,669 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 1 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:25,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1226 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:32:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-09 18:32:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-01-09 18:32:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 425 states have (on average 1.3505882352941176) internal successors, (574), 430 states have internal predecessors, (574), 79 states have call successors, (79), 34 states have call predecessors, (79), 33 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 18:32:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 731 transitions. [2025-01-09 18:32:25,685 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 731 transitions. Word has length 222 [2025-01-09 18:32:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:25,686 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 731 transitions. [2025-01-09 18:32:25,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:32:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 731 transitions. [2025-01-09 18:32:25,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 18:32:25,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:25,689 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:25,702 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 18:32:25,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:25,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:25,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 880800408, now seen corresponding path program 1 times [2025-01-09 18:32:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712096846] [2025-01-09 18:32:25,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:26,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 18:32:26,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 18:32:26,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:26,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-09 18:32:27,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:27,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712096846] [2025-01-09 18:32:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712096846] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:32:27,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879575741] [2025-01-09 18:32:27,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:27,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:27,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:32:27,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:32:27,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 18:32:28,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 18:32:28,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 18:32:28,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:28,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:28,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 3017 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:32:28,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:32:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 18:32:29,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:32:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-09 18:32:30,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879575741] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:32:30,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:32:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 18:32:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388002769] [2025-01-09 18:32:30,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:32:30,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:32:30,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:30,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:32:30,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:32:30,420 INFO L87 Difference]: Start difference. First operand 538 states and 731 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 5 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2025-01-09 18:32:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:30,833 INFO L93 Difference]: Finished difference Result 1112 states and 1525 transitions. [2025-01-09 18:32:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:32:30,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 5 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 232 [2025-01-09 18:32:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:30,837 INFO L225 Difference]: With dead ends: 1112 [2025-01-09 18:32:30,837 INFO L226 Difference]: Without dead ends: 577 [2025-01-09 18:32:30,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:32:30,839 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 23 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:30,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1860 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 18:32:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-01-09 18:32:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2025-01-09 18:32:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 458 states have (on average 1.3471615720524017) internal successors, (617), 465 states have internal predecessors, (617), 85 states have call successors, (85), 34 states have call predecessors, (85), 33 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 18:32:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 786 transitions. [2025-01-09 18:32:30,852 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 786 transitions. Word has length 232 [2025-01-09 18:32:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:30,853 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 786 transitions. [2025-01-09 18:32:30,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 5 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2025-01-09 18:32:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 786 transitions. [2025-01-09 18:32:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-09 18:32:30,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:30,856 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:30,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 18:32:31,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:31,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:31,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1626290409, now seen corresponding path program 1 times [2025-01-09 18:32:31,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:31,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687656529] [2025-01-09 18:32:31,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:31,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-09 18:32:31,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-09 18:32:31,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:31,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-09 18:32:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687656529] [2025-01-09 18:32:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687656529] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:32:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535054909] [2025-01-09 18:32:32,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:32,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:32,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:32:32,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:32:32,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 18:32:34,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-09 18:32:34,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-09 18:32:34,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:34,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:34,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 3028 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 18:32:34,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:32:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 18:32:34,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:32:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-09 18:32:36,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535054909] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:32:36,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:32:36,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-01-09 18:32:36,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390256517] [2025-01-09 18:32:36,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:32:36,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 18:32:36,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:36,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 18:32:36,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 18:32:36,265 INFO L87 Difference]: Start difference. First operand 577 states and 786 transitions. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 18:32:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:36,641 INFO L93 Difference]: Finished difference Result 1165 states and 1596 transitions. [2025-01-09 18:32:36,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 18:32:36,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 244 [2025-01-09 18:32:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:36,646 INFO L225 Difference]: With dead ends: 1165 [2025-01-09 18:32:36,646 INFO L226 Difference]: Without dead ends: 591 [2025-01-09 18:32:36,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 483 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 18:32:36,648 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 30 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:36,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1856 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 18:32:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-09 18:32:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-01-09 18:32:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 470 states have (on average 1.3468085106382979) internal successors, (633), 478 states have internal predecessors, (633), 87 states have call successors, (87), 34 states have call predecessors, (87), 33 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 18:32:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 806 transitions. [2025-01-09 18:32:36,663 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 806 transitions. Word has length 244 [2025-01-09 18:32:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:36,665 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 806 transitions. [2025-01-09 18:32:36,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 18:32:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 806 transitions. [2025-01-09 18:32:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-09 18:32:36,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:36,668 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:36,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 18:32:36,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 18:32:36,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:36,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:36,869 INFO L85 PathProgramCache]: Analyzing trace with hash -906150447, now seen corresponding path program 1 times [2025-01-09 18:32:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:36,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89846029] [2025-01-09 18:32:36,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:37,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 18:32:37,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 18:32:37,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:37,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-01-09 18:32:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89846029] [2025-01-09 18:32:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89846029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:32:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:32:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065928960] [2025-01-09 18:32:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:38,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:32:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:38,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:32:38,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:38,037 INFO L87 Difference]: Start difference. First operand 591 states and 806 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:32:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:38,080 INFO L93 Difference]: Finished difference Result 1180 states and 1613 transitions. [2025-01-09 18:32:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:32:38,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 251 [2025-01-09 18:32:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:38,084 INFO L225 Difference]: With dead ends: 1180 [2025-01-09 18:32:38,084 INFO L226 Difference]: Without dead ends: 592 [2025-01-09 18:32:38,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:32:38,086 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:38,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1230 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:32:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-09 18:32:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-01-09 18:32:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 471 states have (on average 1.346072186836518) internal successors, (634), 479 states have internal predecessors, (634), 87 states have call successors, (87), 34 states have call predecessors, (87), 33 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 18:32:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 807 transitions. [2025-01-09 18:32:38,101 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 807 transitions. Word has length 251 [2025-01-09 18:32:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:38,102 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 807 transitions. [2025-01-09 18:32:38,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:32:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 807 transitions. [2025-01-09 18:32:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-09 18:32:38,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:38,105 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:38,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:32:38,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1674178651, now seen corresponding path program 1 times [2025-01-09 18:32:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:38,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830371284] [2025-01-09 18:32:38,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:38,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:38,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 18:32:38,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 18:32:38,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:38,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 18:32:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830371284] [2025-01-09 18:32:39,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830371284] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:32:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391251758] [2025-01-09 18:32:39,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:39,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:39,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:32:39,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:32:39,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 18:32:41,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 18:32:41,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 18:32:41,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:41,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:41,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 3101 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 18:32:41,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:32:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 18:32:41,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:32:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391251758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:41,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:32:41,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-01-09 18:32:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510771110] [2025-01-09 18:32:41,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:41,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:32:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:41,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:32:41,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:32:41,839 INFO L87 Difference]: Start difference. First operand 592 states and 807 transitions. Second operand has 5 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 18:32:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:42,027 INFO L93 Difference]: Finished difference Result 1183 states and 1619 transitions. [2025-01-09 18:32:42,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:32:42,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 256 [2025-01-09 18:32:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:42,031 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 18:32:42,031 INFO L226 Difference]: Without dead ends: 594 [2025-01-09 18:32:42,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 18:32:42,034 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 18 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:42,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2427 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:32:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-09 18:32:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2025-01-09 18:32:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 471 states have (on average 1.3418259023354564) internal successors, (632), 479 states have internal predecessors, (632), 87 states have call successors, (87), 34 states have call predecessors, (87), 33 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 18:32:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 805 transitions. [2025-01-09 18:32:42,049 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 805 transitions. Word has length 256 [2025-01-09 18:32:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:42,050 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 805 transitions. [2025-01-09 18:32:42,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 18:32:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 805 transitions. [2025-01-09 18:32:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-09 18:32:42,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:42,053 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:42,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 18:32:42,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 18:32:42,254 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:42,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1962802, now seen corresponding path program 1 times [2025-01-09 18:32:42,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:42,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486561113] [2025-01-09 18:32:42,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:43,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 18:32:43,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 18:32:43,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:43,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-01-09 18:32:43,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486561113] [2025-01-09 18:32:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486561113] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:32:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746062762] [2025-01-09 18:32:43,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:43,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:32:43,693 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:32:43,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 18:32:45,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 18:32:45,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 18:32:45,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:45,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:45,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 18:32:45,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:32:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 18:32:45,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:32:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-01-09 18:32:47,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746062762] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:32:47,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:32:47,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 18:32:47,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138114241] [2025-01-09 18:32:47,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:32:47,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:32:47,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:47,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:32:47,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:32:47,239 INFO L87 Difference]: Start difference. First operand 592 states and 805 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 18:32:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:47,417 INFO L93 Difference]: Finished difference Result 1184 states and 1615 transitions. [2025-01-09 18:32:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:32:47,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 251 [2025-01-09 18:32:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:47,426 INFO L225 Difference]: With dead ends: 1184 [2025-01-09 18:32:47,426 INFO L226 Difference]: Without dead ends: 595 [2025-01-09 18:32:47,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-01-09 18:32:47,429 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 0 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:47,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1838 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:32:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-01-09 18:32:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-01-09 18:32:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 474 states have (on average 1.339662447257384) internal successors, (635), 482 states have internal predecessors, (635), 87 states have call successors, (87), 34 states have call predecessors, (87), 33 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 18:32:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 808 transitions. [2025-01-09 18:32:47,444 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 808 transitions. Word has length 251 [2025-01-09 18:32:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:47,445 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 808 transitions. [2025-01-09 18:32:47,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 18:32:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 808 transitions. [2025-01-09 18:32:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-01-09 18:32:47,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:47,447 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:47,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 18:32:47,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 18:32:47,648 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1848753366, now seen corresponding path program 1 times [2025-01-09 18:32:47,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:47,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871684868] [2025-01-09 18:32:47,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:48,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-01-09 18:32:48,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-01-09 18:32:48,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:48,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 18:32:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871684868] [2025-01-09 18:32:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871684868] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:32:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694703795] [2025-01-09 18:32:49,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:49,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:49,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:32:49,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:32:49,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 18:32:51,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-01-09 18:32:51,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-01-09 18:32:51,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:51,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:51,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 3136 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 18:32:51,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:32:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-09 18:32:51,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:32:51,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694703795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:32:51,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:32:51,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 18:32:51,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213585007] [2025-01-09 18:32:51,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:32:51,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:32:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:32:51,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:32:51,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:32:51,807 INFO L87 Difference]: Start difference. First operand 595 states and 808 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:32:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:32:51,927 INFO L93 Difference]: Finished difference Result 1189 states and 1618 transitions. [2025-01-09 18:32:51,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:32:51,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 258 [2025-01-09 18:32:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:32:51,932 INFO L225 Difference]: With dead ends: 1189 [2025-01-09 18:32:51,933 INFO L226 Difference]: Without dead ends: 597 [2025-01-09 18:32:51,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:32:51,935 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 0 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:32:51,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1829 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:32:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-01-09 18:32:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-01-09 18:32:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 476 states have (on average 1.338235294117647) internal successors, (637), 484 states have internal predecessors, (637), 87 states have call successors, (87), 34 states have call predecessors, (87), 33 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 18:32:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 810 transitions. [2025-01-09 18:32:51,949 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 810 transitions. Word has length 258 [2025-01-09 18:32:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:32:51,949 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 810 transitions. [2025-01-09 18:32:51,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:32:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 810 transitions. [2025-01-09 18:32:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-09 18:32:51,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:32:51,952 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:32:51,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 18:32:52,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:52,153 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:32:52,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:32:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1231162735, now seen corresponding path program 1 times [2025-01-09 18:32:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:32:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617777100] [2025-01-09 18:32:52,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:52,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:32:53,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 18:32:53,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 18:32:53,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:32:53,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:32:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 18:32:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:32:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617777100] [2025-01-09 18:32:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617777100] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:32:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255297574] [2025-01-09 18:32:53,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:32:53,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:32:53,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:32:53,772 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:32:53,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 18:32:55,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 18:33:02,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 18:33:02,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:33:02,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:33:02,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 3149 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-01-09 18:33:02,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:33:03,251 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 18:33:03,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 18:33:04,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 18:33:05,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-01-09 18:33:05,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 18:33:09,109 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 18:33:09,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 18:33:09,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 18:33:09,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 18:33:09,269 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 23 treesize of output 16 [2025-01-09 18:33:09,581 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 23 treesize of output 16 [2025-01-09 18:33:09,642 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 16 treesize of output 11 [2025-01-09 18:33:09,707 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 16 treesize of output 11 [2025-01-09 18:33:09,753 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 23 treesize of output 16 [2025-01-09 18:33:09,851 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 16 treesize of output 11 [2025-01-09 18:33:09,883 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 23 treesize of output 16 [2025-01-09 18:33:09,968 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 23 treesize of output 16 [2025-01-09 18:33:09,986 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 16 treesize of output 11 [2025-01-09 18:33:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-09 18:33:16,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:33:18,556 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_18003 (Array Int Int)) (v_ArrVal_18004 (Array Int Int))) (not (= (mod (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_mraid_mm_ioctl_~#signature~0#1.base| v_ArrVal_18003) |c_~#adapters_list_g~0.base|) |c_~#adapters_list_g~0.offset|) 18446744073709516519 (select (select (store |c_#memory_$Pointer$#0.base| |c_mraid_mm_ioctl_~#signature~0#1.base| v_ArrVal_18004) |c_~#adapters_list_g~0.base|) |c_~#adapters_list_g~0.offset|)) 18446744073709551616) (mod (+ |c_~#adapters_list_g~0.base| |c_~#adapters_list_g~0.offset|) 18446744073709551616)))) is different from false