./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.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 1cfba800a850f13ff72fddf9946e31aec208a19aa4b82d402046e12670b66199 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:56:03,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:56:03,434 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:56:03,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:56:03,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:56:03,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:56:03,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:56:03,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:56:03,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:56:03,459 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:56:03,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:56:03,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:56:03,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:56:03,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:56:03,460 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:56:03,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:56:03,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:56:03,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:56:03,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:56:03,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:56:03,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:56:03,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:56:03,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:56:03,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:56:03,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:56:03,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:56:03,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:56:03,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:56:03,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:56:03,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:56:03,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:56:03,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:56:03,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:56:03,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:56:03,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:56:03,463 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 -> 1cfba800a850f13ff72fddf9946e31aec208a19aa4b82d402046e12670b66199 [2025-01-09 18:56:03,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:56:03,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:56:03,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:56:03,692 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:56:03,692 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:56:03,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2025-01-09 18:56:04,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e0991c46/c080184e0289454b8c7015aa8db76436/FLAGf3b178335 [2025-01-09 18:56:05,266 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:56:05,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2025-01-09 18:56:05,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e0991c46/c080184e0289454b8c7015aa8db76436/FLAGf3b178335 [2025-01-09 18:56:05,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e0991c46/c080184e0289454b8c7015aa8db76436 [2025-01-09 18:56:05,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:56:05,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:56:05,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:56:05,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:56:05,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:56:05,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:56:05" (1/1) ... [2025-01-09 18:56:05,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38835f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:05, skipping insertion in model container [2025-01-09 18:56:05,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:56:05" (1/1) ... [2025-01-09 18:56:05,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:56:07,053 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i[277952,277965] [2025-01-09 18:56:07,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:56:07,251 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:56:07,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (19), "i" (12UL)); [5693-5694] [2025-01-09 18:56:07,412 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (36), "i" (12UL)); [5722-5723] [2025-01-09 18:56:07,629 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i[277952,277965] [2025-01-09 18:56:07,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:56:07,693 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:56:07,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07 WrapperNode [2025-01-09 18:56:07,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:56:07,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:56:07,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:56:07,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:56:07,700 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:56:07" (1/1) ... [2025-01-09 18:56:07,756 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:56:07" (1/1) ... [2025-01-09 18:56:07,946 INFO L138 Inliner]: procedures = 258, calls = 2402, calls flagged for inlining = 96, calls inlined = 93, statements flattened = 6774 [2025-01-09 18:56:07,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:56:07,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:56:07,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:56:07,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:56:07,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:07,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:07,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:08,464 INFO L175 MemorySlicer]: Split 1117 memory accesses to 24 slices as follows [2, 36, 13, 2, 15, 4, 8, 8, 5, 25, 1, 1, 6, 57, 2, 6, 16, 2, 26, 294, 11, 11, 17, 549]. 49 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 7, 0, 0, 0, 0, 8, 8, 0, 0, 1, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0]. The 309 writes are split as follows [0, 29, 4, 1, 0, 1, 0, 0, 2, 22, 0, 0, 3, 16, 0, 3, 12, 0, 12, 3, 1, 4, 12, 184]. [2025-01-09 18:56:08,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:08,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:08,578 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:08,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:08,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:08,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:08,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:08,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:56:08,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:56:08,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:56:08,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:56:08,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (1/1) ... [2025-01-09 18:56:08,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:56:08,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:56:08,737 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:56:08,745 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:56:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:56:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:56:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 18:56:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 18:56:08,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 18:56:08,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 18:56:08,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 18:56:08,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 18:56:08,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 18:56:08,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mpctl_mutex [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mpctl_mutex [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_GetIocState [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_GetIocState [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure __scsi_iterate_devices [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure __scsi_iterate_devices [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:56:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_syscall_down [2025-01-09 18:56:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_syscall_down [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_device_driver_deregister [2025-01-09 18:56:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_device_driver_deregister [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2025-01-09 18:56:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_remove [2025-01-09 18:56:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_remove [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#22 [2025-01-09 18:56:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#23 [2025-01-09 18:56:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 18:56:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 18:56:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 18:56:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 18:56:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-09 18:56:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#22 [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#23 [2025-01-09 18:56:08,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:56:08,770 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame [2025-01-09 18:56:08,770 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2025-01-09 18:56:08,770 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 18:56:08,770 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-01-09 18:56:08,771 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure __mptctl_ioctl [2025-01-09 18:56:08,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __mptctl_ioctl [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_mpt_command [2025-01-09 18:56:08,771 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_mpt_command [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_fw_download [2025-01-09 18:56:08,771 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_fw_download [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2025-01-09 18:56:08,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2025-01-09 18:56:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame_hi_pri [2025-01-09 18:56:08,771 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame_hi_pri [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 18:56:08,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-09 18:56:08,772 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_fw_memory [2025-01-09 18:56:08,772 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_fw_memory [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_taskmgmt [2025-01-09 18:56:08,772 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_taskmgmt [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2025-01-09 18:56:08,772 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:56:08,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:56:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:56:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:56:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:56:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:56:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 18:56:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 18:56:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_clear_taskmgmt_in_progress_flag [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_clear_taskmgmt_in_progress_flag [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_timeout_expired [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_timeout_expired [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mpctl_mutex [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mpctl_mutex [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_fasync [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_fasync [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-01-09 18:56:08,776 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:56:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 18:56:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 18:56:08,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 18:56:08,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 18:56:08,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_set_taskmgmt_in_progress_flag [2025-01-09 18:56:08,781 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_set_taskmgmt_in_progress_flag [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2025-01-09 18:56:08,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_verify_adapter [2025-01-09 18:56:08,781 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_verify_adapter [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:56:08,781 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2025-01-09 18:56:08,781 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-01-09 18:56:08,781 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_deregister [2025-01-09 18:56:08,781 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_deregister [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_sgl [2025-01-09 18:56:08,781 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_sgl [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:56:08,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:56:08,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-01-09 18:56:08,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-01-09 18:56:08,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-01-09 18:56:08,782 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 18:56:08,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 18:56:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 18:56:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 18:56:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-01-09 18:56:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-01-09 18:56:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_get_msg_frame [2025-01-09 18:56:08,784 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_get_msg_frame [2025-01-09 18:56:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-01-09 18:56:08,784 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-01-09 18:56:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2025-01-09 18:56:08,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_send_handshake_request [2025-01-09 18:56:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_send_handshake_request [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_register [2025-01-09 18:56:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_register [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2025-01-09 18:56:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure shost_priv [2025-01-09 18:56:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure shost_priv [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:56:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_config [2025-01-09 18:56:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_config [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_msg_frame [2025-01-09 18:56:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_msg_frame [2025-01-09 18:56:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 18:56:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 18:56:09,362 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:56:09,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:56:09,380 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:56:18,596 INFO L? ?]: Removed 2189 outVars from TransFormulas that were not future-live. [2025-01-09 18:56:18,596 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:56:18,643 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:56:18,645 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 18:56:18,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:56:18 BoogieIcfgContainer [2025-01-09 18:56:18,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:56:18,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:56:18,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:56:18,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:56:18,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:56:05" (1/3) ... [2025-01-09 18:56:18,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8e4a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:56:18, skipping insertion in model container [2025-01-09 18:56:18,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:07" (2/3) ... [2025-01-09 18:56:18,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8e4a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:56:18, skipping insertion in model container [2025-01-09 18:56:18,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:56:18" (3/3) ... [2025-01-09 18:56:18,656 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2025-01-09 18:56:18,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:56:18,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i that has 88 procedures, 1894 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-01-09 18:56:18,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:56:18,751 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;@1246d4cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:56:18,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:56:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 1805 states, 1352 states have (on average 1.4127218934911243) internal successors, (1910), 1372 states have internal predecessors, (1910), 387 states have call successors, (387), 65 states have call predecessors, (387), 64 states have return successors, (383), 382 states have call predecessors, (383), 383 states have call successors, (383) [2025-01-09 18:56:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 18:56:18,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:18,770 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:18,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:18,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash 247847573, now seen corresponding path program 1 times [2025-01-09 18:56:18,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:18,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627202435] [2025-01-09 18:56:18,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:19,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 18:56:19,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 18:56:19,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:19,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-01-09 18:56:19,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627202435] [2025-01-09 18:56:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627202435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:19,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 18:56:19,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880602249] [2025-01-09 18:56:19,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:19,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 18:56:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:19,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 18:56:19,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:56:19,644 INFO L87 Difference]: Start difference. First operand has 1805 states, 1352 states have (on average 1.4127218934911243) internal successors, (1910), 1372 states have internal predecessors, (1910), 387 states have call successors, (387), 65 states have call predecessors, (387), 64 states have return successors, (383), 382 states have call predecessors, (383), 383 states have call successors, (383) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 18:56:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:19,765 INFO L93 Difference]: Finished difference Result 3605 states and 5424 transitions. [2025-01-09 18:56:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 18:56:19,767 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-01-09 18:56:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:19,787 INFO L225 Difference]: With dead ends: 3605 [2025-01-09 18:56:19,787 INFO L226 Difference]: Without dead ends: 1792 [2025-01-09 18:56:19,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:56:19,802 INFO L435 NwaCegarLoop]: 2663 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:19,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2663 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-01-09 18:56:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2025-01-09 18:56:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1345 states have (on average 1.4059479553903347) internal successors, (1891), 1359 states have internal predecessors, (1891), 383 states have call successors, (383), 64 states have call predecessors, (383), 63 states have return successors, (372), 371 states have call predecessors, (372), 372 states have call successors, (372) [2025-01-09 18:56:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2646 transitions. [2025-01-09 18:56:19,989 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2646 transitions. Word has length 119 [2025-01-09 18:56:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:19,989 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2646 transitions. [2025-01-09 18:56:19,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 18:56:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2646 transitions. [2025-01-09 18:56:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 18:56:19,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:19,993 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:19,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:56:19,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:19,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1725317805, now seen corresponding path program 1 times [2025-01-09 18:56:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860525165] [2025-01-09 18:56:19,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:19,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:20,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 18:56:20,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 18:56:20,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:20,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-01-09 18:56:20,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:20,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860525165] [2025-01-09 18:56:20,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860525165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:20,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:20,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345070367] [2025-01-09 18:56:20,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:20,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:20,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:20,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:20,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:20,607 INFO L87 Difference]: Start difference. First operand 1792 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 18:56:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:20,767 INFO L93 Difference]: Finished difference Result 3656 states and 5376 transitions. [2025-01-09 18:56:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:20,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-01-09 18:56:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:20,780 INFO L225 Difference]: With dead ends: 3656 [2025-01-09 18:56:20,780 INFO L226 Difference]: Without dead ends: 1894 [2025-01-09 18:56:20,786 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:56:20,787 INFO L435 NwaCegarLoop]: 2675 mSDtfsCounter, 168 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 5240 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:20,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 5240 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:56:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-01-09 18:56:20,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1877. [2025-01-09 18:56:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1408 states have (on average 1.3998579545454546) internal successors, (1971), 1424 states have internal predecessors, (1971), 394 states have call successors, (394), 75 states have call predecessors, (394), 74 states have return successors, (383), 380 states have call predecessors, (383), 383 states have call successors, (383) [2025-01-09 18:56:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2748 transitions. [2025-01-09 18:56:20,864 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2748 transitions. Word has length 119 [2025-01-09 18:56:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:20,865 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2748 transitions. [2025-01-09 18:56:20,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 18:56:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2748 transitions. [2025-01-09 18:56:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 18:56:20,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:20,867 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:20,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:56:20,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:20,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:20,867 INFO L85 PathProgramCache]: Analyzing trace with hash 882754434, now seen corresponding path program 1 times [2025-01-09 18:56:20,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:20,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947279230] [2025-01-09 18:56:20,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:21,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 18:56:21,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 18:56:21,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:21,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-01-09 18:56:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947279230] [2025-01-09 18:56:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947279230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:21,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066123258] [2025-01-09 18:56:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:21,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:21,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:21,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:21,464 INFO L87 Difference]: Start difference. First operand 1877 states and 2748 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:25,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:25,630 INFO L93 Difference]: Finished difference Result 5431 states and 7997 transitions. [2025-01-09 18:56:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-01-09 18:56:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:25,649 INFO L225 Difference]: With dead ends: 5431 [2025-01-09 18:56:25,649 INFO L226 Difference]: Without dead ends: 3594 [2025-01-09 18:56:25,657 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:56:25,657 INFO L435 NwaCegarLoop]: 2830 mSDtfsCounter, 2562 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 5405 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:25,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 5405 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:56:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-01-09 18:56:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3582. [2025-01-09 18:56:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 2715 states have (on average 1.4084714548802946) internal successors, (3824), 2734 states have internal predecessors, (3824), 734 states have call successors, (734), 133 states have call predecessors, (734), 132 states have return successors, (723), 720 states have call predecessors, (723), 723 states have call successors, (723) [2025-01-09 18:56:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 5281 transitions. [2025-01-09 18:56:25,807 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 5281 transitions. Word has length 143 [2025-01-09 18:56:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:25,807 INFO L471 AbstractCegarLoop]: Abstraction has 3582 states and 5281 transitions. [2025-01-09 18:56:25,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 5281 transitions. [2025-01-09 18:56:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 18:56:25,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:25,810 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-01-09 18:56:25,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:56:25,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash 483573237, now seen corresponding path program 1 times [2025-01-09 18:56:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710773421] [2025-01-09 18:56:25,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:26,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 18:56:26,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 18:56:26,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:26,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 18:56:26,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:26,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710773421] [2025-01-09 18:56:26,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710773421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:26,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:26,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:26,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230145786] [2025-01-09 18:56:26,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:26,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:26,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:26,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:26,382 INFO L87 Difference]: Start difference. First operand 3582 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:26,491 INFO L93 Difference]: Finished difference Result 3584 states and 5282 transitions. [2025-01-09 18:56:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 173 [2025-01-09 18:56:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:26,512 INFO L225 Difference]: With dead ends: 3584 [2025-01-09 18:56:26,512 INFO L226 Difference]: Without dead ends: 3581 [2025-01-09 18:56:26,515 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:56:26,518 INFO L435 NwaCegarLoop]: 2643 mSDtfsCounter, 2597 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:26,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 2643 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2025-01-09 18:56:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3581. [2025-01-09 18:56:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 2715 states have (on average 1.4081031307550644) internal successors, (3823), 2733 states have internal predecessors, (3823), 733 states have call successors, (733), 133 states have call predecessors, (733), 132 states have return successors, (723), 720 states have call predecessors, (723), 723 states have call successors, (723) [2025-01-09 18:56:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5279 transitions. [2025-01-09 18:56:26,675 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5279 transitions. Word has length 173 [2025-01-09 18:56:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:26,677 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5279 transitions. [2025-01-09 18:56:26,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5279 transitions. [2025-01-09 18:56:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 18:56:26,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:26,680 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-01-09 18:56:26,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:56:26,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:26,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:26,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2105351542, now seen corresponding path program 1 times [2025-01-09 18:56:26,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:26,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11716104] [2025-01-09 18:56:26,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:26,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 18:56:26,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 18:56:26,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 18:56:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11716104] [2025-01-09 18:56:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11716104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:27,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:27,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924845943] [2025-01-09 18:56:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:27,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:27,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:27,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:27,166 INFO L87 Difference]: Start difference. First operand 3581 states and 5279 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:27,238 INFO L93 Difference]: Finished difference Result 3583 states and 5280 transitions. [2025-01-09 18:56:27,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:27,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 174 [2025-01-09 18:56:27,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:27,258 INFO L225 Difference]: With dead ends: 3583 [2025-01-09 18:56:27,258 INFO L226 Difference]: Without dead ends: 3580 [2025-01-09 18:56:27,260 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:56:27,261 INFO L435 NwaCegarLoop]: 2641 mSDtfsCounter, 2594 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:27,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 2641 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2025-01-09 18:56:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3580. [2025-01-09 18:56:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 2715 states have (on average 1.4077348066298343) internal successors, (3822), 2732 states have internal predecessors, (3822), 732 states have call successors, (732), 133 states have call predecessors, (732), 132 states have return successors, (723), 720 states have call predecessors, (723), 723 states have call successors, (723) [2025-01-09 18:56:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 5277 transitions. [2025-01-09 18:56:27,399 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 5277 transitions. Word has length 174 [2025-01-09 18:56:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:27,400 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 5277 transitions. [2025-01-09 18:56:27,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 5277 transitions. [2025-01-09 18:56:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 18:56:27,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:27,401 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-01-09 18:56:27,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:56:27,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:27,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash 840876312, now seen corresponding path program 1 times [2025-01-09 18:56:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115604631] [2025-01-09 18:56:27,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:27,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 18:56:27,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 18:56:27,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:27,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 18:56:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115604631] [2025-01-09 18:56:27,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115604631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:27,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:27,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087219456] [2025-01-09 18:56:27,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:27,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:27,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:27,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:27,858 INFO L87 Difference]: Start difference. First operand 3580 states and 5277 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:27,942 INFO L93 Difference]: Finished difference Result 3617 states and 5309 transitions. [2025-01-09 18:56:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:27,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 175 [2025-01-09 18:56:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:27,961 INFO L225 Difference]: With dead ends: 3617 [2025-01-09 18:56:27,962 INFO L226 Difference]: Without dead ends: 3613 [2025-01-09 18:56:27,965 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:56:27,965 INFO L435 NwaCegarLoop]: 2636 mSDtfsCounter, 233 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 5014 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:27,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 5014 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2025-01-09 18:56:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3611. [2025-01-09 18:56:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 2736 states have (on average 1.4038742690058479) internal successors, (3841), 2751 states have internal predecessors, (3841), 734 states have call successors, (734), 141 states have call predecessors, (734), 140 states have return successors, (727), 724 states have call predecessors, (727), 727 states have call successors, (727) [2025-01-09 18:56:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 5302 transitions. [2025-01-09 18:56:28,100 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 5302 transitions. Word has length 175 [2025-01-09 18:56:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:28,100 INFO L471 AbstractCegarLoop]: Abstraction has 3611 states and 5302 transitions. [2025-01-09 18:56:28,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 5302 transitions. [2025-01-09 18:56:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 18:56:28,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:28,102 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-01-09 18:56:28,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:56:28,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:28,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:28,102 INFO L85 PathProgramCache]: Analyzing trace with hash 296854713, now seen corresponding path program 1 times [2025-01-09 18:56:28,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:28,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450282563] [2025-01-09 18:56:28,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:28,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 18:56:28,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 18:56:28,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:28,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 18:56:28,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450282563] [2025-01-09 18:56:28,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450282563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:28,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:28,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:28,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848695556] [2025-01-09 18:56:28,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:28,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:28,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:28,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:28,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:28,543 INFO L87 Difference]: Start difference. First operand 3611 states and 5302 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:28,751 INFO L93 Difference]: Finished difference Result 10381 states and 15316 transitions. [2025-01-09 18:56:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:28,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 176 [2025-01-09 18:56:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:28,792 INFO L225 Difference]: With dead ends: 10381 [2025-01-09 18:56:28,792 INFO L226 Difference]: Without dead ends: 6810 [2025-01-09 18:56:28,810 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:56:28,811 INFO L435 NwaCegarLoop]: 3616 mSDtfsCounter, 2369 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2369 SdHoareTripleChecker+Valid, 6149 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:28,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2369 Valid, 6149 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6810 states. [2025-01-09 18:56:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6810 to 6776. [2025-01-09 18:56:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6776 states, 5158 states have (on average 1.4055835595191934) internal successors, (7250), 5205 states have internal predecessors, (7250), 1359 states have call successors, (1359), 264 states have call predecessors, (1359), 258 states have return successors, (1388), 1314 states have call predecessors, (1388), 1346 states have call successors, (1388) [2025-01-09 18:56:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6776 states to 6776 states and 9997 transitions. [2025-01-09 18:56:29,158 INFO L78 Accepts]: Start accepts. Automaton has 6776 states and 9997 transitions. Word has length 176 [2025-01-09 18:56:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:29,161 INFO L471 AbstractCegarLoop]: Abstraction has 6776 states and 9997 transitions. [2025-01-09 18:56:29,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6776 states and 9997 transitions. [2025-01-09 18:56:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 18:56:29,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:29,163 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-01-09 18:56:29,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:56:29,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 612059195, now seen corresponding path program 1 times [2025-01-09 18:56:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050562708] [2025-01-09 18:56:29,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:29,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 18:56:29,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 18:56:29,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:29,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 18:56:29,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:29,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050562708] [2025-01-09 18:56:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050562708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:29,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:29,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:29,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403637926] [2025-01-09 18:56:29,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:29,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:29,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:29,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:29,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:29,732 INFO L87 Difference]: Start difference. First operand 6776 states and 9997 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:29,862 INFO L93 Difference]: Finished difference Result 6778 states and 9998 transitions. [2025-01-09 18:56:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:29,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 177 [2025-01-09 18:56:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:29,906 INFO L225 Difference]: With dead ends: 6778 [2025-01-09 18:56:29,906 INFO L226 Difference]: Without dead ends: 6746 [2025-01-09 18:56:29,912 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:56:29,913 INFO L435 NwaCegarLoop]: 2636 mSDtfsCounter, 2585 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2585 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:29,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2585 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2025-01-09 18:56:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 6746. [2025-01-09 18:56:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6746 states, 5138 states have (on average 1.405799922148696) internal successors, (7223), 5184 states have internal predecessors, (7223), 1353 states have call successors, (1353), 260 states have call predecessors, (1353), 254 states have return successors, (1383), 1309 states have call predecessors, (1383), 1341 states have call successors, (1383) [2025-01-09 18:56:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 9959 transitions. [2025-01-09 18:56:30,208 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 9959 transitions. Word has length 177 [2025-01-09 18:56:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:30,209 INFO L471 AbstractCegarLoop]: Abstraction has 6746 states and 9959 transitions. [2025-01-09 18:56:30,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:56:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 9959 transitions. [2025-01-09 18:56:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 18:56:30,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:30,215 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:30,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:56:30,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:30,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2105474228, now seen corresponding path program 1 times [2025-01-09 18:56:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122292309] [2025-01-09 18:56:30,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:30,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 18:56:30,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 18:56:30,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:30,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 18:56:30,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122292309] [2025-01-09 18:56:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122292309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:30,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:30,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529312738] [2025-01-09 18:56:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:30,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:30,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:30,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:30,632 INFO L87 Difference]: Start difference. First operand 6746 states and 9959 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:56:34,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:34,817 INFO L93 Difference]: Finished difference Result 10304 states and 15153 transitions. [2025-01-09 18:56:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:34,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 197 [2025-01-09 18:56:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:34,835 INFO L225 Difference]: With dead ends: 10304 [2025-01-09 18:56:34,835 INFO L226 Difference]: Without dead ends: 3596 [2025-01-09 18:56:34,860 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:56:34,862 INFO L435 NwaCegarLoop]: 2641 mSDtfsCounter, 8 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:34,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:56:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2025-01-09 18:56:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3587. [2025-01-09 18:56:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 2716 states have (on average 1.3917525773195876) internal successors, (3780), 2737 states have internal predecessors, (3780), 720 states have call successors, (720), 154 states have call predecessors, (720), 150 states have return successors, (729), 699 states have call predecessors, (729), 708 states have call successors, (729) [2025-01-09 18:56:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 5229 transitions. [2025-01-09 18:56:35,057 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 5229 transitions. Word has length 197 [2025-01-09 18:56:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:35,057 INFO L471 AbstractCegarLoop]: Abstraction has 3587 states and 5229 transitions. [2025-01-09 18:56:35,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:56:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 5229 transitions. [2025-01-09 18:56:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 18:56:35,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:35,061 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:35,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:56:35,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:35,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1985365768, now seen corresponding path program 1 times [2025-01-09 18:56:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:35,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806409579] [2025-01-09 18:56:35,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:35,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:35,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 18:56:35,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 18:56:35,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:35,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 18:56:35,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:35,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806409579] [2025-01-09 18:56:35,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806409579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:35,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:35,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:35,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437351069] [2025-01-09 18:56:35,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:35,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:35,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:35,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:35,469 INFO L87 Difference]: Start difference. First operand 3587 states and 5229 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 18:56:39,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:39,738 INFO L93 Difference]: Finished difference Result 7282 states and 10602 transitions. [2025-01-09 18:56:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:39,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 205 [2025-01-09 18:56:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:39,758 INFO L225 Difference]: With dead ends: 7282 [2025-01-09 18:56:39,759 INFO L226 Difference]: Without dead ends: 3768 [2025-01-09 18:56:39,772 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:56:39,773 INFO L435 NwaCegarLoop]: 2705 mSDtfsCounter, 188 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 5261 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:39,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 5261 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:56:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2025-01-09 18:56:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3739. [2025-01-09 18:56:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 2846 states have (on average 1.3889669711876318) internal successors, (3953), 2867 states have internal predecessors, (3953), 730 states have call successors, (730), 166 states have call predecessors, (730), 162 states have return successors, (739), 709 states have call predecessors, (739), 718 states have call successors, (739) [2025-01-09 18:56:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5422 transitions. [2025-01-09 18:56:39,969 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5422 transitions. Word has length 205 [2025-01-09 18:56:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:39,969 INFO L471 AbstractCegarLoop]: Abstraction has 3739 states and 5422 transitions. [2025-01-09 18:56:39,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 18:56:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5422 transitions. [2025-01-09 18:56:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 18:56:39,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:39,971 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:39,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:56:39,971 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:39,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1781091058, now seen corresponding path program 1 times [2025-01-09 18:56:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:39,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478433463] [2025-01-09 18:56:39,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:40,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 18:56:40,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 18:56:40,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:40,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 18:56:40,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:40,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478433463] [2025-01-09 18:56:40,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478433463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:40,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:40,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005912066] [2025-01-09 18:56:40,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:40,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:40,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:40,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:40,494 INFO L87 Difference]: Start difference. First operand 3739 states and 5422 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:56:44,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:44,588 INFO L93 Difference]: Finished difference Result 3743 states and 5424 transitions. [2025-01-09 18:56:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:44,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 204 [2025-01-09 18:56:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:44,603 INFO L225 Difference]: With dead ends: 3743 [2025-01-09 18:56:44,603 INFO L226 Difference]: Without dead ends: 3740 [2025-01-09 18:56:44,605 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:56:44,605 INFO L435 NwaCegarLoop]: 2657 mSDtfsCounter, 2370 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:44,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2370 Valid, 2933 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:56:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2025-01-09 18:56:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3738. [2025-01-09 18:56:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 2846 states have (on average 1.38756148981026) internal successors, (3949), 2866 states have internal predecessors, (3949), 729 states have call successors, (729), 166 states have call predecessors, (729), 162 states have return successors, (739), 709 states have call predecessors, (739), 718 states have call successors, (739) [2025-01-09 18:56:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 5417 transitions. [2025-01-09 18:56:44,785 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 5417 transitions. Word has length 204 [2025-01-09 18:56:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:44,785 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 5417 transitions. [2025-01-09 18:56:44,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:56:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 5417 transitions. [2025-01-09 18:56:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 18:56:44,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:44,791 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:44,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:56:44,791 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:44,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1935792081, now seen corresponding path program 1 times [2025-01-09 18:56:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721834040] [2025-01-09 18:56:44,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:44,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:45,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 18:56:45,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 18:56:45,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:45,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 18:56:45,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:45,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721834040] [2025-01-09 18:56:45,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721834040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:45,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:45,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541952147] [2025-01-09 18:56:45,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:45,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:45,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:45,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:45,321 INFO L87 Difference]: Start difference. First operand 3738 states and 5417 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 18:56:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:45,409 INFO L93 Difference]: Finished difference Result 7405 states and 10753 transitions. [2025-01-09 18:56:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 279 [2025-01-09 18:56:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:45,421 INFO L225 Difference]: With dead ends: 7405 [2025-01-09 18:56:45,422 INFO L226 Difference]: Without dead ends: 3740 [2025-01-09 18:56:45,433 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:56:45,434 INFO L435 NwaCegarLoop]: 2632 mSDtfsCounter, 0 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5260 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:45,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2025-01-09 18:56:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2025-01-09 18:56:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 2848 states have (on average 1.3872893258426966) internal successors, (3951), 2868 states have internal predecessors, (3951), 729 states have call successors, (729), 166 states have call predecessors, (729), 162 states have return successors, (739), 709 states have call predecessors, (739), 718 states have call successors, (739) [2025-01-09 18:56:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5419 transitions. [2025-01-09 18:56:45,541 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5419 transitions. Word has length 279 [2025-01-09 18:56:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:45,542 INFO L471 AbstractCegarLoop]: Abstraction has 3740 states and 5419 transitions. [2025-01-09 18:56:45,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 18:56:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5419 transitions. [2025-01-09 18:56:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 18:56:45,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:45,546 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:45,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:56:45,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:45,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1687645587, now seen corresponding path program 1 times [2025-01-09 18:56:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:45,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877394807] [2025-01-09 18:56:45,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:45,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:45,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 18:56:45,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 18:56:45,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-01-09 18:56:46,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:46,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877394807] [2025-01-09 18:56:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877394807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:46,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:56:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974839797] [2025-01-09 18:56:46,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:46,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:56:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:46,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:56:46,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:56:46,342 INFO L87 Difference]: Start difference. First operand 3740 states and 5419 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 18:56:50,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:50,535 INFO L93 Difference]: Finished difference Result 7375 states and 10707 transitions. [2025-01-09 18:56:50,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:56:50,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 279 [2025-01-09 18:56:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:50,550 INFO L225 Difference]: With dead ends: 7375 [2025-01-09 18:56:50,551 INFO L226 Difference]: Without dead ends: 3674 [2025-01-09 18:56:50,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:56:50,564 INFO L435 NwaCegarLoop]: 2636 mSDtfsCounter, 9 mSDsluCounter, 7887 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10523 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:50,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10523 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:56:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2025-01-09 18:56:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3659. [2025-01-09 18:56:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3659 states, 2798 states have (on average 1.3917083631165117) internal successors, (3894), 2818 states have internal predecessors, (3894), 710 states have call successors, (710), 154 states have call predecessors, (710), 150 states have return successors, (720), 690 states have call predecessors, (720), 699 states have call successors, (720) [2025-01-09 18:56:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 5324 transitions. [2025-01-09 18:56:50,732 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 5324 transitions. Word has length 279 [2025-01-09 18:56:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:50,732 INFO L471 AbstractCegarLoop]: Abstraction has 3659 states and 5324 transitions. [2025-01-09 18:56:50,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 18:56:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 5324 transitions. [2025-01-09 18:56:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 18:56:50,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:50,738 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:50,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:56:50,738 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:50,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:50,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1365567542, now seen corresponding path program 1 times [2025-01-09 18:56:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:50,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046353160] [2025-01-09 18:56:50,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:50,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:51,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 18:56:51,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 18:56:51,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:51,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-09 18:56:51,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:51,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046353160] [2025-01-09 18:56:51,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046353160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:51,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:51,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:56:51,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423293878] [2025-01-09 18:56:51,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:51,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:56:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:51,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:56:51,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:56:51,338 INFO L87 Difference]: Start difference. First operand 3659 states and 5324 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:56:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:51,455 INFO L93 Difference]: Finished difference Result 7241 states and 10566 transitions. [2025-01-09 18:56:51,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:56:51,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 311 [2025-01-09 18:56:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:51,469 INFO L225 Difference]: With dead ends: 7241 [2025-01-09 18:56:51,469 INFO L226 Difference]: Without dead ends: 3659 [2025-01-09 18:56:51,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:56:51,480 INFO L435 NwaCegarLoop]: 2630 mSDtfsCounter, 0 mSDsluCounter, 7884 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10514 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:51,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10514 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2025-01-09 18:56:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3659. [2025-01-09 18:56:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3659 states, 2798 states have (on average 1.3913509649749822) internal successors, (3893), 2818 states have internal predecessors, (3893), 710 states have call successors, (710), 154 states have call predecessors, (710), 150 states have return successors, (720), 690 states have call predecessors, (720), 699 states have call successors, (720) [2025-01-09 18:56:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 5323 transitions. [2025-01-09 18:56:51,602 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 5323 transitions. Word has length 311 [2025-01-09 18:56:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:51,602 INFO L471 AbstractCegarLoop]: Abstraction has 3659 states and 5323 transitions. [2025-01-09 18:56:51,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:56:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 5323 transitions. [2025-01-09 18:56:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-09 18:56:51,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:51,606 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:51,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:56:51,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:51,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1204872692, now seen corresponding path program 1 times [2025-01-09 18:56:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764258371] [2025-01-09 18:56:51,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:51,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 18:56:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 18:56:51,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:51,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-01-09 18:56:52,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:52,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764258371] [2025-01-09 18:56:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764258371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:52,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794452312] [2025-01-09 18:56:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:52,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:52,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:52,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:52,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:52,122 INFO L87 Difference]: Start difference. First operand 3659 states and 5323 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:56:56,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:56,283 INFO L93 Difference]: Finished difference Result 7243 states and 10561 transitions. [2025-01-09 18:56:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:56,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 293 [2025-01-09 18:56:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:56,297 INFO L225 Difference]: With dead ends: 7243 [2025-01-09 18:56:56,297 INFO L226 Difference]: Without dead ends: 3661 [2025-01-09 18:56:56,308 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:56:56,309 INFO L435 NwaCegarLoop]: 3513 mSDtfsCounter, 2513 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 5858 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:56,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 5858 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:56:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3661 states. [2025-01-09 18:56:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3661 to 3659. [2025-01-09 18:56:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3659 states, 2798 states have (on average 1.3899213724088635) internal successors, (3889), 2818 states have internal predecessors, (3889), 710 states have call successors, (710), 154 states have call predecessors, (710), 150 states have return successors, (700), 690 states have call predecessors, (700), 690 states have call successors, (700) [2025-01-09 18:56:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 5299 transitions. [2025-01-09 18:56:56,412 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 5299 transitions. Word has length 293 [2025-01-09 18:56:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:56,413 INFO L471 AbstractCegarLoop]: Abstraction has 3659 states and 5299 transitions. [2025-01-09 18:56:56,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:56:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 5299 transitions. [2025-01-09 18:56:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 18:56:56,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:56,417 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:56,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:56:56,417 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:56,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash -942865716, now seen corresponding path program 1 times [2025-01-09 18:56:56,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:56,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371008744] [2025-01-09 18:56:56,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:56,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 18:56:56,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 18:56:56,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:56,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-09 18:56:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371008744] [2025-01-09 18:56:57,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371008744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:57,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:57,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:57,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904058986] [2025-01-09 18:56:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:57,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:57,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:57,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:57,101 INFO L87 Difference]: Start difference. First operand 3659 states and 5299 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:56:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:57,276 INFO L93 Difference]: Finished difference Result 7279 states and 10560 transitions. [2025-01-09 18:56:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:57,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 311 [2025-01-09 18:56:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:57,295 INFO L225 Difference]: With dead ends: 7279 [2025-01-09 18:56:57,295 INFO L226 Difference]: Without dead ends: 3697 [2025-01-09 18:56:57,305 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:56:57,306 INFO L435 NwaCegarLoop]: 2610 mSDtfsCounter, 9 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5201 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:57,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5201 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:56:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2025-01-09 18:56:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3697. [2025-01-09 18:56:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3697 states, 2836 states have (on average 1.3839915373765868) internal successors, (3925), 2856 states have internal predecessors, (3925), 710 states have call successors, (710), 154 states have call predecessors, (710), 150 states have return successors, (700), 690 states have call predecessors, (700), 690 states have call successors, (700) [2025-01-09 18:56:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 5335 transitions. [2025-01-09 18:56:57,497 INFO L78 Accepts]: Start accepts. Automaton has 3697 states and 5335 transitions. Word has length 311 [2025-01-09 18:56:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:57,497 INFO L471 AbstractCegarLoop]: Abstraction has 3697 states and 5335 transitions. [2025-01-09 18:56:57,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:56:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3697 states and 5335 transitions. [2025-01-09 18:56:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 18:56:57,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:57,503 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:57,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 18:56:57,503 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:57,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash 51827982, now seen corresponding path program 1 times [2025-01-09 18:56:57,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:57,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608748412] [2025-01-09 18:56:57,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:57,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 18:56:57,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 18:56:57,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:57,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-09 18:56:58,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:58,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608748412] [2025-01-09 18:56:58,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608748412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:58,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:58,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:56:58,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322983256] [2025-01-09 18:56:58,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:58,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:56:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:58,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:56:58,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:56:58,120 INFO L87 Difference]: Start difference. First operand 3697 states and 5335 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:56:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:58,276 INFO L93 Difference]: Finished difference Result 7322 states and 10584 transitions. [2025-01-09 18:56:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:56:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 311 [2025-01-09 18:56:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:58,297 INFO L225 Difference]: With dead ends: 7322 [2025-01-09 18:56:58,297 INFO L226 Difference]: Without dead ends: 3702 [2025-01-09 18:56:58,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:56:58,307 INFO L435 NwaCegarLoop]: 2635 mSDtfsCounter, 0 mSDsluCounter, 10521 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13156 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:58,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13156 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2025-01-09 18:56:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3702. [2025-01-09 18:56:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 2840 states have (on average 1.383450704225352) internal successors, (3929), 2860 states have internal predecessors, (3929), 710 states have call successors, (710), 154 states have call predecessors, (710), 151 states have return successors, (703), 691 states have call predecessors, (703), 690 states have call successors, (703) [2025-01-09 18:56:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5342 transitions. [2025-01-09 18:56:58,420 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5342 transitions. Word has length 311 [2025-01-09 18:56:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:58,422 INFO L471 AbstractCegarLoop]: Abstraction has 3702 states and 5342 transitions. [2025-01-09 18:56:58,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:56:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5342 transitions. [2025-01-09 18:56:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 18:56:58,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:58,427 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:58,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 18:56:58,428 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:58,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1942316724, now seen corresponding path program 1 times [2025-01-09 18:56:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631992814] [2025-01-09 18:56:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:58,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 18:56:58,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 18:56:58,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:58,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-09 18:56:59,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:59,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631992814] [2025-01-09 18:56:59,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631992814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:59,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:59,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:56:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424760292] [2025-01-09 18:56:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:59,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:56:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:59,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:56:59,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:56:59,018 INFO L87 Difference]: Start difference. First operand 3702 states and 5342 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:56:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:59,116 INFO L93 Difference]: Finished difference Result 7327 states and 10593 transitions. [2025-01-09 18:56:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:56:59,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 311 [2025-01-09 18:56:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:59,130 INFO L225 Difference]: With dead ends: 7327 [2025-01-09 18:56:59,131 INFO L226 Difference]: Without dead ends: 3702 [2025-01-09 18:56:59,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:56:59,138 INFO L435 NwaCegarLoop]: 2630 mSDtfsCounter, 0 mSDsluCounter, 7880 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10510 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:59,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10510 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2025-01-09 18:56:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3702. [2025-01-09 18:56:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 2840 states have (on average 1.3830985915492957) internal successors, (3928), 2860 states have internal predecessors, (3928), 710 states have call successors, (710), 154 states have call predecessors, (710), 151 states have return successors, (703), 691 states have call predecessors, (703), 690 states have call successors, (703) [2025-01-09 18:56:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5341 transitions. [2025-01-09 18:56:59,236 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5341 transitions. Word has length 311 [2025-01-09 18:56:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:59,237 INFO L471 AbstractCegarLoop]: Abstraction has 3702 states and 5341 transitions. [2025-01-09 18:56:59,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:56:59,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5341 transitions. [2025-01-09 18:56:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 18:56:59,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:59,241 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:59,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 18:56:59,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:59,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash 631129501, now seen corresponding path program 1 times [2025-01-09 18:56:59,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333279187] [2025-01-09 18:56:59,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:59,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:59,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 18:56:59,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 18:56:59,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:59,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-01-09 18:56:59,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333279187] [2025-01-09 18:56:59,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333279187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:59,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:59,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:56:59,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451511966] [2025-01-09 18:56:59,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:59,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:56:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:59,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:56:59,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:56:59,757 INFO L87 Difference]: Start difference. First operand 3702 states and 5341 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 4 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2025-01-09 18:56:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:59,926 INFO L93 Difference]: Finished difference Result 8172 states and 11943 transitions. [2025-01-09 18:56:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:56:59,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 4 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) Word has length 301 [2025-01-09 18:56:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:59,946 INFO L225 Difference]: With dead ends: 8172 [2025-01-09 18:56:59,946 INFO L226 Difference]: Without dead ends: 4547 [2025-01-09 18:56:59,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:56:59,957 INFO L435 NwaCegarLoop]: 2629 mSDtfsCounter, 588 mSDsluCounter, 10492 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 13121 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:59,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 13121 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2025-01-09 18:57:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 3725. [2025-01-09 18:57:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3725 states, 2859 states have (on average 1.385099685204617) internal successors, (3960), 2881 states have internal predecessors, (3960), 713 states have call successors, (713), 154 states have call predecessors, (713), 152 states have return successors, (710), 693 states have call predecessors, (710), 693 states have call successors, (710) [2025-01-09 18:57:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 3725 states and 5383 transitions. [2025-01-09 18:57:00,088 INFO L78 Accepts]: Start accepts. Automaton has 3725 states and 5383 transitions. Word has length 301 [2025-01-09 18:57:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:00,088 INFO L471 AbstractCegarLoop]: Abstraction has 3725 states and 5383 transitions. [2025-01-09 18:57:00,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 4 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2025-01-09 18:57:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3725 states and 5383 transitions. [2025-01-09 18:57:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 18:57:00,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:00,092 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 18:57:00,093 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:00,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1965187959, now seen corresponding path program 1 times [2025-01-09 18:57:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:00,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100206593] [2025-01-09 18:57:00,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:00,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 18:57:00,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 18:57:00,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:00,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-01-09 18:57:00,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:00,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100206593] [2025-01-09 18:57:00,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100206593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:00,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:00,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:00,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669794019] [2025-01-09 18:57:00,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:00,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:00,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:00,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:00,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:00,571 INFO L87 Difference]: Start difference. First operand 3725 states and 5383 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2025-01-09 18:57:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:00,738 INFO L93 Difference]: Finished difference Result 7389 states and 10696 transitions. [2025-01-09 18:57:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:00,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) Word has length 302 [2025-01-09 18:57:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:00,755 INFO L225 Difference]: With dead ends: 7389 [2025-01-09 18:57:00,755 INFO L226 Difference]: Without dead ends: 3741 [2025-01-09 18:57:00,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:00,764 INFO L435 NwaCegarLoop]: 2637 mSDtfsCounter, 1 mSDsluCounter, 10527 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13164 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:00,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13164 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2025-01-09 18:57:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3733. [2025-01-09 18:57:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 2865 states have (on average 1.3842931937172775) internal successors, (3966), 2888 states have internal predecessors, (3966), 713 states have call successors, (713), 154 states have call predecessors, (713), 154 states have return successors, (716), 694 states have call predecessors, (716), 693 states have call successors, (716) [2025-01-09 18:57:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5395 transitions. [2025-01-09 18:57:00,877 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5395 transitions. Word has length 302 [2025-01-09 18:57:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:00,877 INFO L471 AbstractCegarLoop]: Abstraction has 3733 states and 5395 transitions. [2025-01-09 18:57:00,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2025-01-09 18:57:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5395 transitions. [2025-01-09 18:57:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 18:57:00,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:00,882 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 18:57:00,882 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:00,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash -28956747, now seen corresponding path program 1 times [2025-01-09 18:57:00,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:00,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827746459] [2025-01-09 18:57:00,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:01,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 18:57:01,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 18:57:01,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:01,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-01-09 18:57:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827746459] [2025-01-09 18:57:01,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827746459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:01,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:01,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164325028] [2025-01-09 18:57:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:01,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:01,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:01,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:01,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:01,374 INFO L87 Difference]: Start difference. First operand 3733 states and 5395 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) [2025-01-09 18:57:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:01,481 INFO L93 Difference]: Finished difference Result 7126 states and 10284 transitions. [2025-01-09 18:57:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) Word has length 302 [2025-01-09 18:57:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:01,500 INFO L225 Difference]: With dead ends: 7126 [2025-01-09 18:57:01,501 INFO L226 Difference]: Without dead ends: 3470 [2025-01-09 18:57:01,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:01,511 INFO L435 NwaCegarLoop]: 2628 mSDtfsCounter, 0 mSDsluCounter, 10506 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13134 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:01,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13134 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-01-09 18:57:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3470. [2025-01-09 18:57:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 2661 states have (on average 1.3769259676813228) internal successors, (3664), 2683 states have internal predecessors, (3664), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 639 states have call predecessors, (657), 638 states have call successors, (657) [2025-01-09 18:57:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4979 transitions. [2025-01-09 18:57:01,687 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4979 transitions. Word has length 302 [2025-01-09 18:57:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:01,688 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 4979 transitions. [2025-01-09 18:57:01,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) [2025-01-09 18:57:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4979 transitions. [2025-01-09 18:57:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-01-09 18:57:01,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:01,694 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:01,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 18:57:01,695 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:01,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash -719642389, now seen corresponding path program 1 times [2025-01-09 18:57:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:01,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812129876] [2025-01-09 18:57:01,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:02,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-09 18:57:02,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-09 18:57:02,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:02,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 18:57:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:02,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812129876] [2025-01-09 18:57:02,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812129876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:02,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:02,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845666583] [2025-01-09 18:57:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:02,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:02,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:02,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:02,402 INFO L87 Difference]: Start difference. First operand 3470 states and 4979 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:57:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:02,517 INFO L93 Difference]: Finished difference Result 6865 states and 9865 transitions. [2025-01-09 18:57:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:02,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 314 [2025-01-09 18:57:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:02,534 INFO L225 Difference]: With dead ends: 6865 [2025-01-09 18:57:02,535 INFO L226 Difference]: Without dead ends: 3472 [2025-01-09 18:57:02,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:02,544 INFO L435 NwaCegarLoop]: 2635 mSDtfsCounter, 0 mSDsluCounter, 10523 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13158 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:02,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13158 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2025-01-09 18:57:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2025-01-09 18:57:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 2663 states have (on average 1.3766428839654525) internal successors, (3666), 2684 states have internal predecessors, (3666), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 640 states have call predecessors, (657), 638 states have call successors, (657) [2025-01-09 18:57:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4981 transitions. [2025-01-09 18:57:02,638 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4981 transitions. Word has length 314 [2025-01-09 18:57:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:02,638 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 4981 transitions. [2025-01-09 18:57:02,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:57:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4981 transitions. [2025-01-09 18:57:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 18:57:02,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:02,644 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:02,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 18:57:02,644 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 817995430, now seen corresponding path program 1 times [2025-01-09 18:57:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308329209] [2025-01-09 18:57:02,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:02,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 18:57:02,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 18:57:02,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:02,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:03,086 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 18:57:03,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:03,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308329209] [2025-01-09 18:57:03,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308329209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:03,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:03,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:57:03,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690903578] [2025-01-09 18:57:03,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:03,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:57:03,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:03,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:57:03,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:57:03,089 INFO L87 Difference]: Start difference. First operand 3472 states and 4981 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:57:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:03,181 INFO L93 Difference]: Finished difference Result 6869 states and 9870 transitions. [2025-01-09 18:57:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:57:03,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 315 [2025-01-09 18:57:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:03,201 INFO L225 Difference]: With dead ends: 6869 [2025-01-09 18:57:03,201 INFO L226 Difference]: Without dead ends: 3474 [2025-01-09 18:57:03,209 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:57:03,210 INFO L435 NwaCegarLoop]: 2630 mSDtfsCounter, 0 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5254 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:03,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2025-01-09 18:57:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3474. [2025-01-09 18:57:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 2665 states have (on average 1.376360225140713) internal successors, (3668), 2686 states have internal predecessors, (3668), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 640 states have call predecessors, (657), 638 states have call successors, (657) [2025-01-09 18:57:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 4983 transitions. [2025-01-09 18:57:03,312 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 4983 transitions. Word has length 315 [2025-01-09 18:57:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:03,313 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 4983 transitions. [2025-01-09 18:57:03,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:57:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 4983 transitions. [2025-01-09 18:57:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 18:57:03,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:03,317 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:03,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 18:57:03,318 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:03,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:03,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1548699164, now seen corresponding path program 1 times [2025-01-09 18:57:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:03,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066571467] [2025-01-09 18:57:03,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:03,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 18:57:03,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 18:57:03,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:03,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 18:57:03,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:03,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066571467] [2025-01-09 18:57:03,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066571467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:03,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:03,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:03,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704811252] [2025-01-09 18:57:03,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:03,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:03,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:03,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:03,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:03,807 INFO L87 Difference]: Start difference. First operand 3474 states and 4983 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:57:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:03,913 INFO L93 Difference]: Finished difference Result 4087 states and 5808 transitions. [2025-01-09 18:57:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:03,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 315 [2025-01-09 18:57:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:03,928 INFO L225 Difference]: With dead ends: 4087 [2025-01-09 18:57:03,928 INFO L226 Difference]: Without dead ends: 3476 [2025-01-09 18:57:03,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:03,931 INFO L435 NwaCegarLoop]: 2635 mSDtfsCounter, 0 mSDsluCounter, 10523 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13158 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:03,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13158 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2025-01-09 18:57:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3476. [2025-01-09 18:57:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 2667 states have (on average 1.3760779902512186) internal successors, (3670), 2687 states have internal predecessors, (3670), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 641 states have call predecessors, (657), 638 states have call successors, (657) [2025-01-09 18:57:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 4985 transitions. [2025-01-09 18:57:04,026 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 4985 transitions. Word has length 315 [2025-01-09 18:57:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:04,027 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 4985 transitions. [2025-01-09 18:57:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:57:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 4985 transitions. [2025-01-09 18:57:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 18:57:04,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:04,031 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:04,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 18:57:04,032 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:04,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1580932646, now seen corresponding path program 1 times [2025-01-09 18:57:04,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:04,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91614052] [2025-01-09 18:57:04,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:04,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 18:57:04,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 18:57:04,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:04,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 18:57:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91614052] [2025-01-09 18:57:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91614052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:04,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056932902] [2025-01-09 18:57:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:04,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:04,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:04,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:04,608 INFO L87 Difference]: Start difference. First operand 3476 states and 4985 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-01-09 18:57:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:04,735 INFO L93 Difference]: Finished difference Result 6917 states and 9942 transitions. [2025-01-09 18:57:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:04,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 322 [2025-01-09 18:57:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:04,751 INFO L225 Difference]: With dead ends: 6917 [2025-01-09 18:57:04,751 INFO L226 Difference]: Without dead ends: 3518 [2025-01-09 18:57:04,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:04,758 INFO L435 NwaCegarLoop]: 2629 mSDtfsCounter, 19 mSDsluCounter, 10489 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13118 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:04,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13118 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2025-01-09 18:57:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3485. [2025-01-09 18:57:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 2673 states have (on average 1.376356154133932) internal successors, (3679), 2694 states have internal predecessors, (3679), 661 states have call successors, (661), 151 states have call predecessors, (661), 150 states have return successors, (661), 643 states have call predecessors, (661), 641 states have call successors, (661) [2025-01-09 18:57:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 5001 transitions. [2025-01-09 18:57:04,851 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 5001 transitions. Word has length 322 [2025-01-09 18:57:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:04,851 INFO L471 AbstractCegarLoop]: Abstraction has 3485 states and 5001 transitions. [2025-01-09 18:57:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-01-09 18:57:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 5001 transitions. [2025-01-09 18:57:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 18:57:04,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:04,856 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:04,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 18:57:04,857 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:04,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:04,858 INFO L85 PathProgramCache]: Analyzing trace with hash -339598843, now seen corresponding path program 1 times [2025-01-09 18:57:04,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:04,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253854050] [2025-01-09 18:57:04,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:04,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:05,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 18:57:05,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 18:57:05,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:05,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 18:57:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:05,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253854050] [2025-01-09 18:57:05,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253854050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:05,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:05,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752621076] [2025-01-09 18:57:05,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:05,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:05,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:05,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:05,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:05,468 INFO L87 Difference]: Start difference. First operand 3485 states and 5001 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:57:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:05,575 INFO L93 Difference]: Finished difference Result 6630 states and 9486 transitions. [2025-01-09 18:57:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:05,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 323 [2025-01-09 18:57:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:05,596 INFO L225 Difference]: With dead ends: 6630 [2025-01-09 18:57:05,596 INFO L226 Difference]: Without dead ends: 3222 [2025-01-09 18:57:05,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:05,605 INFO L435 NwaCegarLoop]: 2589 mSDtfsCounter, 0 mSDsluCounter, 10339 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12928 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:05,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12928 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2025-01-09 18:57:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 3220. [2025-01-09 18:57:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3220 states, 2459 states have (on average 1.3643757625050834) internal successors, (3355), 2477 states have internal predecessors, (3355), 610 states have call successors, (610), 150 states have call predecessors, (610), 150 states have return successors, (612), 596 states have call predecessors, (612), 593 states have call successors, (612) [2025-01-09 18:57:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 4577 transitions. [2025-01-09 18:57:05,697 INFO L78 Accepts]: Start accepts. Automaton has 3220 states and 4577 transitions. Word has length 323 [2025-01-09 18:57:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:05,697 INFO L471 AbstractCegarLoop]: Abstraction has 3220 states and 4577 transitions. [2025-01-09 18:57:05,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:57:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 4577 transitions. [2025-01-09 18:57:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 18:57:05,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:05,702 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:05,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 18:57:05,704 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:05,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1667907809, now seen corresponding path program 1 times [2025-01-09 18:57:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:05,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009051501] [2025-01-09 18:57:05,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:05,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 18:57:05,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 18:57:05,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:05,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 18:57:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:06,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009051501] [2025-01-09 18:57:06,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009051501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:06,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:06,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143927135] [2025-01-09 18:57:06,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:06,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:06,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:06,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:06,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:06,191 INFO L87 Difference]: Start difference. First operand 3220 states and 4577 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-01-09 18:57:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:06,321 INFO L93 Difference]: Finished difference Result 6406 states and 9126 transitions. [2025-01-09 18:57:06,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:06,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 323 [2025-01-09 18:57:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:06,336 INFO L225 Difference]: With dead ends: 6406 [2025-01-09 18:57:06,336 INFO L226 Difference]: Without dead ends: 3263 [2025-01-09 18:57:06,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:06,344 INFO L435 NwaCegarLoop]: 2624 mSDtfsCounter, 20 mSDsluCounter, 10434 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 13058 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:06,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 13058 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2025-01-09 18:57:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 3229. [2025-01-09 18:57:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 2465 states have (on average 1.3647058823529412) internal successors, (3364), 2484 states have internal predecessors, (3364), 613 states have call successors, (613), 150 states have call predecessors, (613), 150 states have return successors, (616), 598 states have call predecessors, (616), 596 states have call successors, (616) [2025-01-09 18:57:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4593 transitions. [2025-01-09 18:57:06,500 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4593 transitions. Word has length 323 [2025-01-09 18:57:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:06,501 INFO L471 AbstractCegarLoop]: Abstraction has 3229 states and 4593 transitions. [2025-01-09 18:57:06,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-01-09 18:57:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4593 transitions. [2025-01-09 18:57:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 18:57:06,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:06,506 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:06,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 18:57:06,506 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:06,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1935685946, now seen corresponding path program 1 times [2025-01-09 18:57:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:06,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266664361] [2025-01-09 18:57:06,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:06,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 18:57:06,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 18:57:06,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:06,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 18:57:07,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:07,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266664361] [2025-01-09 18:57:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266664361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:07,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:07,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2199783] [2025-01-09 18:57:07,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:07,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:07,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:07,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:07,214 INFO L87 Difference]: Start difference. First operand 3229 states and 4593 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:57:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:07,382 INFO L93 Difference]: Finished difference Result 6080 states and 8659 transitions. [2025-01-09 18:57:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:07,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 324 [2025-01-09 18:57:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:07,401 INFO L225 Difference]: With dead ends: 6080 [2025-01-09 18:57:07,401 INFO L226 Difference]: Without dead ends: 2928 [2025-01-09 18:57:07,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:07,410 INFO L435 NwaCegarLoop]: 2587 mSDtfsCounter, 0 mSDsluCounter, 10335 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12922 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:07,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12922 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-01-09 18:57:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2025-01-09 18:57:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2238 states have (on average 1.3655049151027703) internal successors, (3056), 2256 states have internal predecessors, (3056), 549 states have call successors, (549), 138 states have call predecessors, (549), 138 states have return successors, (553), 535 states have call predecessors, (553), 533 states have call successors, (553) [2025-01-09 18:57:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4158 transitions. [2025-01-09 18:57:07,532 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4158 transitions. Word has length 324 [2025-01-09 18:57:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:07,533 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4158 transitions. [2025-01-09 18:57:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:57:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4158 transitions. [2025-01-09 18:57:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-09 18:57:07,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:07,538 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:07,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 18:57:07,538 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:07,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash 69048610, now seen corresponding path program 1 times [2025-01-09 18:57:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322940322] [2025-01-09 18:57:07,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:07,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-09 18:57:07,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-09 18:57:07,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:07,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-01-09 18:57:08,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:08,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322940322] [2025-01-09 18:57:08,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322940322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:08,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:08,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 18:57:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952543491] [2025-01-09 18:57:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:57:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:08,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:57:08,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:57:08,059 INFO L87 Difference]: Start difference. First operand 2926 states and 4158 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-01-09 18:57:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:08,263 INFO L93 Difference]: Finished difference Result 6619 states and 9575 transitions. [2025-01-09 18:57:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 18:57:08,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 336 [2025-01-09 18:57:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:08,282 INFO L225 Difference]: With dead ends: 6619 [2025-01-09 18:57:08,282 INFO L226 Difference]: Without dead ends: 3770 [2025-01-09 18:57:08,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:57:08,289 INFO L435 NwaCegarLoop]: 3450 mSDtfsCounter, 591 mSDsluCounter, 16485 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 19935 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:08,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 19935 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:57:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3770 states. [2025-01-09 18:57:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3770 to 2946. [2025-01-09 18:57:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2255 states have (on average 1.3685144124168513) internal successors, (3086), 2274 states have internal predecessors, (3086), 552 states have call successors, (552), 138 states have call predecessors, (552), 138 states have return successors, (558), 537 states have call predecessors, (558), 536 states have call successors, (558) [2025-01-09 18:57:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 4196 transitions. [2025-01-09 18:57:08,401 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 4196 transitions. Word has length 336 [2025-01-09 18:57:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:08,401 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 4196 transitions. [2025-01-09 18:57:08,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-01-09 18:57:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 4196 transitions. [2025-01-09 18:57:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 18:57:08,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:08,444 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:08,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 18:57:08,445 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash 813108363, now seen corresponding path program 1 times [2025-01-09 18:57:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:08,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280051993] [2025-01-09 18:57:08,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:08,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 18:57:08,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 18:57:08,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:08,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-01-09 18:57:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:08,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280051993] [2025-01-09 18:57:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280051993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:08,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067139177] [2025-01-09 18:57:08,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:08,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:08,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:08,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:08,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:08,906 INFO L87 Difference]: Start difference. First operand 2946 states and 4196 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 3 states have call successors, (36) [2025-01-09 18:57:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:09,003 INFO L93 Difference]: Finished difference Result 3751 states and 5295 transitions. [2025-01-09 18:57:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:09,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 3 states have call successors, (36) Word has length 337 [2025-01-09 18:57:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:09,019 INFO L225 Difference]: With dead ends: 3751 [2025-01-09 18:57:09,019 INFO L226 Difference]: Without dead ends: 2946 [2025-01-09 18:57:09,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:09,022 INFO L435 NwaCegarLoop]: 2584 mSDtfsCounter, 7 mSDsluCounter, 10306 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12890 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:09,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12890 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2025-01-09 18:57:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2025-01-09 18:57:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2255 states have (on average 1.3680709534368072) internal successors, (3085), 2274 states have internal predecessors, (3085), 552 states have call successors, (552), 138 states have call predecessors, (552), 138 states have return successors, (558), 537 states have call predecessors, (558), 536 states have call successors, (558) [2025-01-09 18:57:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 4195 transitions. [2025-01-09 18:57:09,106 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 4195 transitions. Word has length 337 [2025-01-09 18:57:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:09,107 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 4195 transitions. [2025-01-09 18:57:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 3 states have call successors, (36) [2025-01-09 18:57:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 4195 transitions. [2025-01-09 18:57:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 18:57:09,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:09,111 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 18:57:09,112 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1032368135, now seen corresponding path program 1 times [2025-01-09 18:57:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226847753] [2025-01-09 18:57:09,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:09,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 18:57:09,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 18:57:09,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:09,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 18:57:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226847753] [2025-01-09 18:57:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226847753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:09,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:09,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944073732] [2025-01-09 18:57:09,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:09,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:09,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:09,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:09,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:09,579 INFO L87 Difference]: Start difference. First operand 2946 states and 4195 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-01-09 18:57:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:09,669 INFO L93 Difference]: Finished difference Result 3751 states and 5292 transitions. [2025-01-09 18:57:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:09,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) Word has length 342 [2025-01-09 18:57:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:09,683 INFO L225 Difference]: With dead ends: 3751 [2025-01-09 18:57:09,683 INFO L226 Difference]: Without dead ends: 2946 [2025-01-09 18:57:09,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:09,685 INFO L435 NwaCegarLoop]: 2584 mSDtfsCounter, 7 mSDsluCounter, 10308 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12892 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:09,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12892 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2025-01-09 18:57:09,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2025-01-09 18:57:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2255 states have (on average 1.3676274944567628) internal successors, (3084), 2274 states have internal predecessors, (3084), 552 states have call successors, (552), 138 states have call predecessors, (552), 138 states have return successors, (558), 537 states have call predecessors, (558), 536 states have call successors, (558) [2025-01-09 18:57:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 4194 transitions. [2025-01-09 18:57:09,771 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 4194 transitions. Word has length 342 [2025-01-09 18:57:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:09,771 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 4194 transitions. [2025-01-09 18:57:09,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-01-09 18:57:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 4194 transitions. [2025-01-09 18:57:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 18:57:09,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:09,776 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 18:57:09,776 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:09,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -699534033, now seen corresponding path program 1 times [2025-01-09 18:57:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459094037] [2025-01-09 18:57:09,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:10,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 18:57:10,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 18:57:10,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:10,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 18:57:10,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:10,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459094037] [2025-01-09 18:57:10,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459094037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:10,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:10,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:57:10,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655567905] [2025-01-09 18:57:10,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:10,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:57:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:10,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:57:10,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:10,273 INFO L87 Difference]: Start difference. First operand 2946 states and 4194 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-01-09 18:57:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:10,357 INFO L93 Difference]: Finished difference Result 3751 states and 5291 transitions. [2025-01-09 18:57:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:57:10,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) Word has length 343 [2025-01-09 18:57:10,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:10,371 INFO L225 Difference]: With dead ends: 3751 [2025-01-09 18:57:10,371 INFO L226 Difference]: Without dead ends: 2946 [2025-01-09 18:57:10,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:57:10,373 INFO L435 NwaCegarLoop]: 2585 mSDtfsCounter, 7 mSDsluCounter, 10309 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12894 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:10,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12894 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:57:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2025-01-09 18:57:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2025-01-09 18:57:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2255 states have (on average 1.3671840354767184) internal successors, (3083), 2274 states have internal predecessors, (3083), 552 states have call successors, (552), 138 states have call predecessors, (552), 138 states have return successors, (558), 537 states have call predecessors, (558), 536 states have call successors, (558) [2025-01-09 18:57:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 4193 transitions. [2025-01-09 18:57:10,456 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 4193 transitions. Word has length 343 [2025-01-09 18:57:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:10,456 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 4193 transitions. [2025-01-09 18:57:10,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-01-09 18:57:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 4193 transitions. [2025-01-09 18:57:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-09 18:57:10,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:10,461 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:10,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 18:57:10,461 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:10,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1646395680, now seen corresponding path program 1 times [2025-01-09 18:57:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:10,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856774359] [2025-01-09 18:57:10,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:10,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:10,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 18:57:10,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 18:57:10,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:10,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-01-09 18:57:10,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856774359] [2025-01-09 18:57:10,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856774359] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:57:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703919853] [2025-01-09 18:57:10,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:10,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:57:10,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:57:10,986 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:57:10,988 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:57:12,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 18:57:12,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 18:57:12,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:12,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:12,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 3124 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:57:12,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:57:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-01-09 18:57:12,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:57:12,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703919853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:12,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:57:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 18:57:12,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571701777] [2025-01-09 18:57:12,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:12,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:57:12,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:12,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:57:12,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:57:12,648 INFO L87 Difference]: Start difference. First operand 2946 states and 4193 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 4 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2025-01-09 18:57:16,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []