./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/ntdrivers/kbfiltr.i.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:50:14,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:50:14,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:50:14,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:50:14,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:50:14,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:50:14,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:50:14,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:50:14,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:50:14,545 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:50:14,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:50:14,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:50:14,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:50:14,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:50:14,545 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:50:14,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:50:14,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:50:14,546 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:50:14,547 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:50:14,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:50:14,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:50:14,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:50:14,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:50:14,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:50:14,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:50:14,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:50:14,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:50:14,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:50:14,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:50:14,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:50:14,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:50:14,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:50:14,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:50:14,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:50:14,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:50:14,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:50:14,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:50:14,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:50:14,548 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 [2025-01-08 22:50:14,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:50:14,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:50:14,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:50:14,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:50:14,709 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:50:14,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2025-01-08 22:50:15,796 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8935a8cad/8e1cb0ab09c24d55a77d86e05229cca2/FLAGc186c7a27 [2025-01-08 22:50:16,143 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:50:16,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2025-01-08 22:50:16,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8935a8cad/8e1cb0ab09c24d55a77d86e05229cca2/FLAGc186c7a27 [2025-01-08 22:50:16,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8935a8cad/8e1cb0ab09c24d55a77d86e05229cca2 [2025-01-08 22:50:16,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:50:16,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:50:16,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:50:16,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:50:16,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:50:16,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:16,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a987ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16, skipping insertion in model container [2025-01-08 22:50:16,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:16,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:50:16,718 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/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2025-01-08 22:50:16,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:50:16,822 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:50:16,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [16] [2025-01-08 22:50:16,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [17] [2025-01-08 22:50:16,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [175] [2025-01-08 22:50:16,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [181] [2025-01-08 22:50:16,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [402] [2025-01-08 22:50:16,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [455] [2025-01-08 22:50:16,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [474] [2025-01-08 22:50:16,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [475] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1148] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1321] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [1417] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1418] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1421] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1422] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1423] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1424] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [1425] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1426] [2025-01-08 22:50:16,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1433] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1434] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1435] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1436] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1437] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1441] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1442] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1464] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1465] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1466] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1473] [2025-01-08 22:50:16,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1474] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [1475] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [1476] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [1477] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1478] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1479] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1480] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1481] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1482] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1535] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1536] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [1600] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [1601] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(INIT,DriverEntry) [1642] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_AddDevice) [1643] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_CreateClose) [1644] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_IoCtl) [1645] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_InternIoCtl) [1646] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Unload) [1647] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_DispatchPassThrough) [1648] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_PnP) [1649] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Power) [1650] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2349] [2025-01-08 22:50:16,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2350] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2351] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2352] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2353] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2354] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2355] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2356] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2357] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2358] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [2359] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [2360] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [2361] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2362] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2363] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2364] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2365] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2366] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2367] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2368] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [2369] [2025-01-08 22:50:16,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [2370] [2025-01-08 22:50:16,885 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/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2025-01-08 22:50:16,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:50:16,973 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:50:16,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16 WrapperNode [2025-01-08 22:50:16,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:50:16,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:50:16,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:50:16,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:50:16,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,061 INFO L138 Inliner]: procedures = 109, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1142 [2025-01-08 22:50:17,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:50:17,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:50:17,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:50:17,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:50:17,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,127 INFO L175 MemorySlicer]: Split 203 memory accesses to 7 slices as follows [3, 79, 2, 8, 9, 37, 65]. 39 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 0, 2, 0, 0, 0, 0]. The 92 writes are split as follows [2, 28, 0, 1, 8, 18, 35]. [2025-01-08 22:50:17,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:50:17,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:50:17,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:50:17,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:50:17,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (1/1) ... [2025-01-08 22:50:17,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:50:17,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:50:17,220 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-08 22:50:17,223 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-08 22:50:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2025-01-08 22:50:17,269 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-08 22:50:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:50:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2025-01-08 22:50:17,271 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-08 22:50:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2025-01-08 22:50:17,271 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2025-01-08 22:50:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2025-01-08 22:50:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2025-01-08 22:50:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2025-01-08 22:50:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-08 22:50:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-08 22:50:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-08 22:50:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-08 22:50:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-08 22:50:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-08 22:50:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-08 22:50:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-08 22:50:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-08 22:50:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:50:17,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:50:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2025-01-08 22:50:17,274 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2025-01-08 22:50:17,565 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:50:17,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:50:17,693 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:50:17,737 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2025-01-08 22:50:17,737 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2025-01-08 22:50:17,739 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:50:17,739 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:50:17,741 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:50:17,743 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:50:17,744 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:50:17,751 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:50:17,752 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume !false; [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##95: assume false; [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !false; [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume false; [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2025-01-08 22:50:18,962 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2025-01-08 22:50:18,963 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2025-01-08 22:50:18,963 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2025-01-08 22:50:18,963 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2025-01-08 22:50:18,963 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2025-01-08 22:50:19,018 INFO L? ?]: Removed 283 outVars from TransFormulas that were not future-live. [2025-01-08 22:50:19,018 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:50:19,032 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:50:19,034 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:50:19,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:50:19 BoogieIcfgContainer [2025-01-08 22:50:19,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:50:19,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:50:19,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:50:19,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:50:19,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:50:16" (1/3) ... [2025-01-08 22:50:19,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60700080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:50:19, skipping insertion in model container [2025-01-08 22:50:19,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:50:16" (2/3) ... [2025-01-08 22:50:19,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60700080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:50:19, skipping insertion in model container [2025-01-08 22:50:19,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:50:19" (3/3) ... [2025-01-08 22:50:19,041 INFO L128 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2025-01-08 22:50:19,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:50:19,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kbfiltr.i.cil-2.c that has 8 procedures, 255 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-08 22:50:19,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:50:19,111 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;@392d3c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:50:19,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:50:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 255 states, 217 states have (on average 1.566820276497696) internal successors, (340), 235 states have internal predecessors, (340), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-08 22:50:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:50:19,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:19,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:19,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:19,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -911916137, now seen corresponding path program 1 times [2025-01-08 22:50:19,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4559375] [2025-01-08 22:50:19,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:19,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 22:50:19,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:50:19,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:19,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:19,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:19,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4559375] [2025-01-08 22:50:19,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4559375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:19,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:19,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:50:19,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169266766] [2025-01-08 22:50:19,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:19,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:50:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:19,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:50:19,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:50:19,504 INFO L87 Difference]: Start difference. First operand has 255 states, 217 states have (on average 1.566820276497696) internal successors, (340), 235 states have internal predecessors, (340), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:19,550 INFO L93 Difference]: Finished difference Result 504 states and 803 transitions. [2025-01-08 22:50:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:50:19,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:50:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:19,560 INFO L225 Difference]: With dead ends: 504 [2025-01-08 22:50:19,563 INFO L226 Difference]: Without dead ends: 247 [2025-01-08 22:50:19,569 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-08 22:50:19,574 INFO L435 NwaCegarLoop]: 376 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, 376 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-08 22:50:19,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-08 22:50:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-01-08 22:50:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 211 states have (on average 1.4976303317535544) internal successors, (316), 227 states have internal predecessors, (316), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-08 22:50:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 360 transitions. [2025-01-08 22:50:19,625 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 360 transitions. Word has length 16 [2025-01-08 22:50:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:19,625 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 360 transitions. [2025-01-08 22:50:19,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 360 transitions. [2025-01-08 22:50:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:50:19,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:19,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:19,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:50:19,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1498722151, now seen corresponding path program 1 times [2025-01-08 22:50:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634122223] [2025-01-08 22:50:19,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:19,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 22:50:19,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:50:19,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:19,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:19,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634122223] [2025-01-08 22:50:19,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634122223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:19,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:19,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:19,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744185356] [2025-01-08 22:50:19,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:19,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:19,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:19,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:19,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:19,940 INFO L87 Difference]: Start difference. First operand 247 states and 360 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:20,505 INFO L93 Difference]: Finished difference Result 264 states and 381 transitions. [2025-01-08 22:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:20,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:50:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:20,507 INFO L225 Difference]: With dead ends: 264 [2025-01-08 22:50:20,507 INFO L226 Difference]: Without dead ends: 247 [2025-01-08 22:50:20,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:20,508 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 0 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:20,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1057 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:50:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-08 22:50:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-01-08 22:50:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 211 states have (on average 1.4928909952606635) internal successors, (315), 227 states have internal predecessors, (315), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-08 22:50:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 359 transitions. [2025-01-08 22:50:20,540 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 359 transitions. Word has length 16 [2025-01-08 22:50:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:20,540 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 359 transitions. [2025-01-08 22:50:20,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 359 transitions. [2025-01-08 22:50:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:50:20,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:20,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:20,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:50:20,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:20,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1858255287, now seen corresponding path program 1 times [2025-01-08 22:50:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:20,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352936401] [2025-01-08 22:50:20,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:20,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:50:20,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:50:20,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:20,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:20,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:20,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352936401] [2025-01-08 22:50:20,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352936401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:20,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:20,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448289017] [2025-01-08 22:50:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:20,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:20,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:20,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:20,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:20,829 INFO L87 Difference]: Start difference. First operand 247 states and 359 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:20,860 INFO L93 Difference]: Finished difference Result 482 states and 704 transitions. [2025-01-08 22:50:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:20,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-08 22:50:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:20,863 INFO L225 Difference]: With dead ends: 482 [2025-01-08 22:50:20,863 INFO L226 Difference]: Without dead ends: 263 [2025-01-08 22:50:20,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:20,864 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 19 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:20,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1063 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-08 22:50:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2025-01-08 22:50:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 213 states have (on average 1.488262910798122) internal successors, (317), 229 states have internal predecessors, (317), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-08 22:50:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 361 transitions. [2025-01-08 22:50:20,884 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 361 transitions. Word has length 28 [2025-01-08 22:50:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:20,884 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 361 transitions. [2025-01-08 22:50:20,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2025-01-08 22:50:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:50:20,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:20,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:20,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:50:20,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:20,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1246376439, now seen corresponding path program 1 times [2025-01-08 22:50:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:20,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298967473] [2025-01-08 22:50:20,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:20,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:50:21,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:50:21,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:21,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:21,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:21,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298967473] [2025-01-08 22:50:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298967473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:21,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:21,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776568509] [2025-01-08 22:50:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:21,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:21,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:21,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:21,112 INFO L87 Difference]: Start difference. First operand 249 states and 361 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:21,821 INFO L93 Difference]: Finished difference Result 370 states and 527 transitions. [2025-01-08 22:50:21,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:21,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-08 22:50:21,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:21,823 INFO L225 Difference]: With dead ends: 370 [2025-01-08 22:50:21,823 INFO L226 Difference]: Without dead ends: 315 [2025-01-08 22:50:21,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 22:50:21,823 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 265 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:21,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 491 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:50:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-01-08 22:50:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 299. [2025-01-08 22:50:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 262 states have (on average 1.4236641221374047) internal successors, (373), 265 states have internal predecessors, (373), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2025-01-08 22:50:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 426 transitions. [2025-01-08 22:50:21,848 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 426 transitions. Word has length 28 [2025-01-08 22:50:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:21,848 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 426 transitions. [2025-01-08 22:50:21,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 426 transitions. [2025-01-08 22:50:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:50:21,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:21,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:21,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:50:21,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:21,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash 688413678, now seen corresponding path program 1 times [2025-01-08 22:50:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:21,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439775927] [2025-01-08 22:50:21,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:21,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:21,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:50:21,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:50:21,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:21,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:21,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:21,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439775927] [2025-01-08 22:50:21,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439775927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:21,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:21,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:21,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289282898] [2025-01-08 22:50:21,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:21,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:21,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:21,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:21,999 INFO L87 Difference]: Start difference. First operand 299 states and 426 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:22,021 INFO L93 Difference]: Finished difference Result 455 states and 634 transitions. [2025-01-08 22:50:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:22,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-08 22:50:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:22,025 INFO L225 Difference]: With dead ends: 455 [2025-01-08 22:50:22,025 INFO L226 Difference]: Without dead ends: 356 [2025-01-08 22:50:22,026 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-08 22:50:22,026 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 292 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:22,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 457 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-08 22:50:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 333. [2025-01-08 22:50:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 298 states have (on average 1.419463087248322) internal successors, (423), 299 states have internal predecessors, (423), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2025-01-08 22:50:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 471 transitions. [2025-01-08 22:50:22,039 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 471 transitions. Word has length 30 [2025-01-08 22:50:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:22,039 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 471 transitions. [2025-01-08 22:50:22,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 471 transitions. [2025-01-08 22:50:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:50:22,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:22,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:22,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:50:22,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:22,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1673224715, now seen corresponding path program 1 times [2025-01-08 22:50:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494439320] [2025-01-08 22:50:22,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:22,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:50:22,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:50:22,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:22,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:22,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494439320] [2025-01-08 22:50:22,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494439320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:22,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:22,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:22,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337638348] [2025-01-08 22:50:22,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:22,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:22,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:22,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:22,315 INFO L87 Difference]: Start difference. First operand 333 states and 471 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:22,887 INFO L93 Difference]: Finished difference Result 357 states and 498 transitions. [2025-01-08 22:50:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:22,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-08 22:50:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:22,889 INFO L225 Difference]: With dead ends: 357 [2025-01-08 22:50:22,890 INFO L226 Difference]: Without dead ends: 349 [2025-01-08 22:50:22,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:22,891 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 577 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:22,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 419 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:50:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-01-08 22:50:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 338. [2025-01-08 22:50:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 303 states have (on average 1.4158415841584158) internal successors, (429), 304 states have internal predecessors, (429), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2025-01-08 22:50:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2025-01-08 22:50:22,906 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 32 [2025-01-08 22:50:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:22,907 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2025-01-08 22:50:22,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2025-01-08 22:50:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:50:22,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:22,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:22,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:50:22,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:22,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash -77064409, now seen corresponding path program 1 times [2025-01-08 22:50:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:22,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065313493] [2025-01-08 22:50:22,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:22,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-08 22:50:23,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:50:23,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:23,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:23,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:23,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065313493] [2025-01-08 22:50:23,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065313493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:23,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:23,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:23,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115756076] [2025-01-08 22:50:23,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:23,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:23,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:23,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:23,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:23,179 INFO L87 Difference]: Start difference. First operand 338 states and 477 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:23,778 INFO L93 Difference]: Finished difference Result 357 states and 497 transitions. [2025-01-08 22:50:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:23,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-08 22:50:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:23,780 INFO L225 Difference]: With dead ends: 357 [2025-01-08 22:50:23,780 INFO L226 Difference]: Without dead ends: 349 [2025-01-08 22:50:23,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:23,781 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 573 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:23,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 423 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:50:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-01-08 22:50:23,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 339. [2025-01-08 22:50:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 304 states have (on average 1.4144736842105263) internal successors, (430), 305 states have internal predecessors, (430), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2025-01-08 22:50:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 478 transitions. [2025-01-08 22:50:23,802 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 478 transitions. Word has length 33 [2025-01-08 22:50:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:23,802 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 478 transitions. [2025-01-08 22:50:23,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 478 transitions. [2025-01-08 22:50:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 22:50:23,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:23,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:23,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:50:23,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:23,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:23,806 INFO L85 PathProgramCache]: Analyzing trace with hash -493595954, now seen corresponding path program 1 times [2025-01-08 22:50:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:23,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634148915] [2025-01-08 22:50:23,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:23,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:23,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-08 22:50:23,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:50:23,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:23,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:23,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:23,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634148915] [2025-01-08 22:50:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634148915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:23,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:23,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:23,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223892088] [2025-01-08 22:50:23,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:23,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:23,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:23,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:23,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:23,984 INFO L87 Difference]: Start difference. First operand 339 states and 478 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:24,589 INFO L93 Difference]: Finished difference Result 342 states and 480 transitions. [2025-01-08 22:50:24,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:24,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-08 22:50:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:24,591 INFO L225 Difference]: With dead ends: 342 [2025-01-08 22:50:24,591 INFO L226 Difference]: Without dead ends: 338 [2025-01-08 22:50:24,591 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-08 22:50:24,592 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 24 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:24,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 592 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:50:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-01-08 22:50:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-01-08 22:50:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 304 states have (on average 1.4078947368421053) internal successors, (428), 304 states have internal predecessors, (428), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2025-01-08 22:50:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 475 transitions. [2025-01-08 22:50:24,614 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 475 transitions. Word has length 37 [2025-01-08 22:50:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:24,614 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 475 transitions. [2025-01-08 22:50:24,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 475 transitions. [2025-01-08 22:50:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-08 22:50:24,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:24,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:24,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:50:24,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:24,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1667551938, now seen corresponding path program 1 times [2025-01-08 22:50:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:24,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738386758] [2025-01-08 22:50:24,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:24,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-08 22:50:24,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 22:50:24,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:24,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:24,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738386758] [2025-01-08 22:50:24,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738386758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:24,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:24,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108615741] [2025-01-08 22:50:24,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:24,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:24,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:24,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:24,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:24,781 INFO L87 Difference]: Start difference. First operand 338 states and 475 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:24,918 INFO L93 Difference]: Finished difference Result 350 states and 486 transitions. [2025-01-08 22:50:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:24,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-08 22:50:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:24,920 INFO L225 Difference]: With dead ends: 350 [2025-01-08 22:50:24,920 INFO L226 Difference]: Without dead ends: 308 [2025-01-08 22:50:24,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:24,920 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 561 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:24,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 419 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:50:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-08 22:50:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2025-01-08 22:50:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 274 states have (on average 1.427007299270073) internal successors, (391), 279 states have internal predecessors, (391), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-01-08 22:50:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 430 transitions. [2025-01-08 22:50:24,931 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 430 transitions. Word has length 34 [2025-01-08 22:50:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:24,931 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 430 transitions. [2025-01-08 22:50:24,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 430 transitions. [2025-01-08 22:50:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:50:24,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:24,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:24,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:50:24,932 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:24,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1931560749, now seen corresponding path program 1 times [2025-01-08 22:50:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:24,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325160069] [2025-01-08 22:50:24,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:24,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 22:50:24,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:50:24,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:24,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:25,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:25,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325160069] [2025-01-08 22:50:25,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325160069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:25,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:25,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947867293] [2025-01-08 22:50:25,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:25,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:25,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:25,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:25,096 INFO L87 Difference]: Start difference. First operand 305 states and 430 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:25,211 INFO L93 Difference]: Finished difference Result 359 states and 497 transitions. [2025-01-08 22:50:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:25,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-01-08 22:50:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:25,213 INFO L225 Difference]: With dead ends: 359 [2025-01-08 22:50:25,213 INFO L226 Difference]: Without dead ends: 320 [2025-01-08 22:50:25,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:25,214 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 349 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:25,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 540 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:50:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-08 22:50:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 305. [2025-01-08 22:50:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 279 states have internal predecessors, (389), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-01-08 22:50:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 428 transitions. [2025-01-08 22:50:25,225 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 428 transitions. Word has length 43 [2025-01-08 22:50:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:25,225 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 428 transitions. [2025-01-08 22:50:25,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 428 transitions. [2025-01-08 22:50:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:50:25,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:25,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:25,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:50:25,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:25,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash 962163972, now seen corresponding path program 1 times [2025-01-08 22:50:25,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:25,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905558998] [2025-01-08 22:50:25,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:25,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:50:25,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:50:25,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:25,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905558998] [2025-01-08 22:50:25,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905558998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:25,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:25,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:50:25,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226685503] [2025-01-08 22:50:25,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:25,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:25,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:25,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:25,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:25,437 INFO L87 Difference]: Start difference. First operand 305 states and 428 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:26,657 INFO L93 Difference]: Finished difference Result 332 states and 460 transitions. [2025-01-08 22:50:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:26,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-08 22:50:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:26,659 INFO L225 Difference]: With dead ends: 332 [2025-01-08 22:50:26,659 INFO L226 Difference]: Without dead ends: 324 [2025-01-08 22:50:26,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:26,660 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 349 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:26,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 817 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 22:50:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-08 22:50:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2025-01-08 22:50:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 285 states have (on average 1.4140350877192982) internal successors, (403), 289 states have internal predecessors, (403), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-01-08 22:50:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 442 transitions. [2025-01-08 22:50:26,678 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 442 transitions. Word has length 44 [2025-01-08 22:50:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:26,678 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 442 transitions. [2025-01-08 22:50:26,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 442 transitions. [2025-01-08 22:50:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-08 22:50:26,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:26,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:26,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:50:26,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:26,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash -645110962, now seen corresponding path program 1 times [2025-01-08 22:50:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:26,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975237739] [2025-01-08 22:50:26,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:26,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-08 22:50:26,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:50:26,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:26,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:26,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:26,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975237739] [2025-01-08 22:50:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975237739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:26,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:50:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897757407] [2025-01-08 22:50:26,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:26,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:26,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:26,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:26,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:26,928 INFO L87 Difference]: Start difference. First operand 316 states and 442 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:28,473 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2025-01-08 22:50:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-01-08 22:50:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:28,475 INFO L225 Difference]: With dead ends: 332 [2025-01-08 22:50:28,475 INFO L226 Difference]: Without dead ends: 324 [2025-01-08 22:50:28,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:28,476 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 345 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:28,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 819 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-08 22:50:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-08 22:50:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 317. [2025-01-08 22:50:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 286 states have (on average 1.4125874125874125) internal successors, (404), 290 states have internal predecessors, (404), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-01-08 22:50:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 443 transitions. [2025-01-08 22:50:28,488 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 443 transitions. Word has length 45 [2025-01-08 22:50:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:28,488 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 443 transitions. [2025-01-08 22:50:28,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 443 transitions. [2025-01-08 22:50:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-08 22:50:28,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:28,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:28,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:50:28,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:28,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1115258642, now seen corresponding path program 1 times [2025-01-08 22:50:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125499105] [2025-01-08 22:50:28,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:28,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-08 22:50:28,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:50:28,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:28,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125499105] [2025-01-08 22:50:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125499105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:28,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:28,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:28,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050921439] [2025-01-08 22:50:28,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:28,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:28,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:28,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:28,693 INFO L87 Difference]: Start difference. First operand 317 states and 443 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:29,464 INFO L93 Difference]: Finished difference Result 356 states and 492 transitions. [2025-01-08 22:50:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-08 22:50:29,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:29,466 INFO L225 Difference]: With dead ends: 356 [2025-01-08 22:50:29,466 INFO L226 Difference]: Without dead ends: 315 [2025-01-08 22:50:29,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:29,467 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 327 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:29,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 543 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:50:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-01-08 22:50:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-01-08 22:50:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 284 states have (on average 1.408450704225352) internal successors, (400), 288 states have internal predecessors, (400), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-01-08 22:50:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 439 transitions. [2025-01-08 22:50:29,477 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 439 transitions. Word has length 45 [2025-01-08 22:50:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:29,477 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 439 transitions. [2025-01-08 22:50:29,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 439 transitions. [2025-01-08 22:50:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-08 22:50:29,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:29,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:29,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:50:29,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:29,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1689247762, now seen corresponding path program 1 times [2025-01-08 22:50:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:29,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372283079] [2025-01-08 22:50:29,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:29,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:29,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-08 22:50:29,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:50:29,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:29,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:29,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:29,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372283079] [2025-01-08 22:50:29,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372283079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:29,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:29,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:29,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785325651] [2025-01-08 22:50:29,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:29,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:29,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:29,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:29,587 INFO L87 Difference]: Start difference. First operand 315 states and 439 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:29,607 INFO L93 Difference]: Finished difference Result 332 states and 460 transitions. [2025-01-08 22:50:29,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:29,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-08 22:50:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:29,608 INFO L225 Difference]: With dead ends: 332 [2025-01-08 22:50:29,609 INFO L226 Difference]: Without dead ends: 309 [2025-01-08 22:50:29,609 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-08 22:50:29,609 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 306 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:29,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 312 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:29,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-08 22:50:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-01-08 22:50:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 279 states have (on average 1.3978494623655915) internal successors, (390), 282 states have internal predecessors, (390), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-01-08 22:50:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 428 transitions. [2025-01-08 22:50:29,622 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 428 transitions. Word has length 45 [2025-01-08 22:50:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:29,622 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 428 transitions. [2025-01-08 22:50:29,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 428 transitions. [2025-01-08 22:50:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 22:50:29,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:29,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:29,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:50:29,623 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:29,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash -818542556, now seen corresponding path program 1 times [2025-01-08 22:50:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:29,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216813036] [2025-01-08 22:50:29,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:29,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-08 22:50:29,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 22:50:29,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:29,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216813036] [2025-01-08 22:50:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216813036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:29,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:29,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:50:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229614143] [2025-01-08 22:50:29,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:29,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:50:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:29,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:50:29,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:29,791 INFO L87 Difference]: Start difference. First operand 309 states and 428 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:30,353 INFO L93 Difference]: Finished difference Result 329 states and 450 transitions. [2025-01-08 22:50:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:50:30,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-08 22:50:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:30,354 INFO L225 Difference]: With dead ends: 329 [2025-01-08 22:50:30,354 INFO L226 Difference]: Without dead ends: 308 [2025-01-08 22:50:30,355 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-08 22:50:30,355 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 5 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:30,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1570 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:50:30,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-08 22:50:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-01-08 22:50:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 278 states have (on average 1.39568345323741) internal successors, (388), 281 states have internal predecessors, (388), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-01-08 22:50:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 426 transitions. [2025-01-08 22:50:30,365 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 426 transitions. Word has length 46 [2025-01-08 22:50:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:30,365 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 426 transitions. [2025-01-08 22:50:30,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 426 transitions. [2025-01-08 22:50:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 22:50:30,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:30,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:30,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:50:30,366 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:30,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash -268857801, now seen corresponding path program 1 times [2025-01-08 22:50:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796456081] [2025-01-08 22:50:30,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:30,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:50:30,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:50:30,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:30,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:30,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:30,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796456081] [2025-01-08 22:50:30,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796456081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:30,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:30,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:50:30,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436111977] [2025-01-08 22:50:30,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:30,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:30,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:30,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:30,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:30,520 INFO L87 Difference]: Start difference. First operand 308 states and 426 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:30,849 INFO L93 Difference]: Finished difference Result 360 states and 485 transitions. [2025-01-08 22:50:30,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:30,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-08 22:50:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:30,851 INFO L225 Difference]: With dead ends: 360 [2025-01-08 22:50:30,851 INFO L226 Difference]: Without dead ends: 307 [2025-01-08 22:50:30,851 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-08 22:50:30,852 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 1 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:30,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1256 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:50:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-08 22:50:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-01-08 22:50:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 277 states have (on average 1.3935018050541517) internal successors, (386), 280 states have internal predecessors, (386), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-01-08 22:50:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 424 transitions. [2025-01-08 22:50:30,862 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 424 transitions. Word has length 47 [2025-01-08 22:50:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:30,862 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 424 transitions. [2025-01-08 22:50:30,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2025-01-08 22:50:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 22:50:30,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:30,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:30,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:50:30,863 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:30,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1768293772, now seen corresponding path program 1 times [2025-01-08 22:50:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144455411] [2025-01-08 22:50:30,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:30,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:50:30,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:50:30,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:30,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:31,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144455411] [2025-01-08 22:50:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144455411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:31,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:31,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:50:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223571517] [2025-01-08 22:50:31,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:31,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:31,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:31,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:31,017 INFO L87 Difference]: Start difference. First operand 307 states and 424 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:31,853 INFO L93 Difference]: Finished difference Result 359 states and 483 transitions. [2025-01-08 22:50:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-08 22:50:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:31,856 INFO L225 Difference]: With dead ends: 359 [2025-01-08 22:50:31,856 INFO L226 Difference]: Without dead ends: 307 [2025-01-08 22:50:31,856 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-08 22:50:31,857 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 1 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:31,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1216 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:50:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-08 22:50:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-01-08 22:50:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 277 states have (on average 1.3826714801444044) internal successors, (383), 280 states have internal predecessors, (383), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-01-08 22:50:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2025-01-08 22:50:31,870 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 47 [2025-01-08 22:50:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:31,871 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2025-01-08 22:50:31,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2025-01-08 22:50:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 22:50:31,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:31,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:31,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:50:31,872 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:31,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:31,872 INFO L85 PathProgramCache]: Analyzing trace with hash 109202980, now seen corresponding path program 1 times [2025-01-08 22:50:31,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:31,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022543280] [2025-01-08 22:50:31,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:31,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:50:31,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:50:31,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:31,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:32,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:32,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022543280] [2025-01-08 22:50:32,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022543280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:32,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:32,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:32,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438669886] [2025-01-08 22:50:32,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:32,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:32,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:32,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:32,075 INFO L87 Difference]: Start difference. First operand 307 states and 421 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:32,184 INFO L93 Difference]: Finished difference Result 342 states and 463 transitions. [2025-01-08 22:50:32,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:32,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-08 22:50:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:32,185 INFO L225 Difference]: With dead ends: 342 [2025-01-08 22:50:32,185 INFO L226 Difference]: Without dead ends: 228 [2025-01-08 22:50:32,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:32,186 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 318 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:32,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 553 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:50:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-08 22:50:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 205. [2025-01-08 22:50:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 185 states have (on average 1.3513513513513513) internal successors, (250), 189 states have internal predecessors, (250), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-08 22:50:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 272 transitions. [2025-01-08 22:50:32,195 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 272 transitions. Word has length 47 [2025-01-08 22:50:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:32,195 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 272 transitions. [2025-01-08 22:50:32,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 272 transitions. [2025-01-08 22:50:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:50:32,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:32,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:32,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:50:32,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:32,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash -334050122, now seen corresponding path program 1 times [2025-01-08 22:50:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:32,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222283854] [2025-01-08 22:50:32,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:32,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:50:32,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:50:32,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:32,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222283854] [2025-01-08 22:50:32,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222283854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416069802] [2025-01-08 22:50:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:32,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:32,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:32,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:32,326 INFO L87 Difference]: Start difference. First operand 205 states and 272 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:32,336 INFO L93 Difference]: Finished difference Result 223 states and 289 transitions. [2025-01-08 22:50:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:32,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-08 22:50:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:32,337 INFO L225 Difference]: With dead ends: 223 [2025-01-08 22:50:32,337 INFO L226 Difference]: Without dead ends: 179 [2025-01-08 22:50:32,337 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-08 22:50:32,338 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:32,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 324 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-08 22:50:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 142. [2025-01-08 22:50:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 127 states have (on average 1.31496062992126) internal successors, (167), 130 states have internal predecessors, (167), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-08 22:50:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 182 transitions. [2025-01-08 22:50:32,346 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 182 transitions. Word has length 48 [2025-01-08 22:50:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:32,347 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 182 transitions. [2025-01-08 22:50:32,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2025-01-08 22:50:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 22:50:32,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:32,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:32,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:50:32,348 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:32,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1339230031, now seen corresponding path program 1 times [2025-01-08 22:50:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:32,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863189610] [2025-01-08 22:50:32,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:32,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 22:50:32,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:50:32,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:32,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:32,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:32,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863189610] [2025-01-08 22:50:32,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863189610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:32,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:32,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:32,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673667609] [2025-01-08 22:50:32,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:32,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:32,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:32,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:32,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:32,490 INFO L87 Difference]: Start difference. First operand 142 states and 182 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:32,940 INFO L93 Difference]: Finished difference Result 197 states and 252 transitions. [2025-01-08 22:50:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:32,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-08 22:50:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:32,941 INFO L225 Difference]: With dead ends: 197 [2025-01-08 22:50:32,942 INFO L226 Difference]: Without dead ends: 142 [2025-01-08 22:50:32,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:32,942 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 133 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:32,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 266 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:50:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-08 22:50:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-01-08 22:50:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 130 states have internal predecessors, (166), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-08 22:50:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 181 transitions. [2025-01-08 22:50:32,948 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 181 transitions. Word has length 49 [2025-01-08 22:50:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:32,948 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 181 transitions. [2025-01-08 22:50:32,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:50:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 181 transitions. [2025-01-08 22:50:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-08 22:50:32,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:32,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:32,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:50:32,949 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:32,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:32,949 INFO L85 PathProgramCache]: Analyzing trace with hash -853739752, now seen corresponding path program 1 times [2025-01-08 22:50:32,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:32,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79975441] [2025-01-08 22:50:32,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:32,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:32,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-08 22:50:33,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-08 22:50:33,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:33,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:33,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:33,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79975441] [2025-01-08 22:50:33,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79975441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:33,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:33,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817985446] [2025-01-08 22:50:33,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:33,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:33,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:33,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:33,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:33,063 INFO L87 Difference]: Start difference. First operand 142 states and 181 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:50:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:33,356 INFO L93 Difference]: Finished difference Result 191 states and 243 transitions. [2025-01-08 22:50:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:33,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2025-01-08 22:50:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:33,357 INFO L225 Difference]: With dead ends: 191 [2025-01-08 22:50:33,357 INFO L226 Difference]: Without dead ends: 140 [2025-01-08 22:50:33,357 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-08 22:50:33,358 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 257 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.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:33,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 257 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:50:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-08 22:50:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-01-08 22:50:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 128 states have internal predecessors, (163), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-08 22:50:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2025-01-08 22:50:33,366 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 54 [2025-01-08 22:50:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:33,366 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2025-01-08 22:50:33,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:50:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2025-01-08 22:50:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-08 22:50:33,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:33,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:33,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:50:33,368 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:33,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1958668952, now seen corresponding path program 1 times [2025-01-08 22:50:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404356331] [2025-01-08 22:50:33,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:33,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:33,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-08 22:50:33,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-08 22:50:33,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:33,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:33,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404356331] [2025-01-08 22:50:33,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404356331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:33,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:33,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:50:33,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112290784] [2025-01-08 22:50:33,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:33,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:50:33,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:33,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:50:33,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:33,514 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:50:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:33,554 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2025-01-08 22:50:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:50:33,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-01-08 22:50:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:33,555 INFO L225 Difference]: With dead ends: 216 [2025-01-08 22:50:33,555 INFO L226 Difference]: Without dead ends: 163 [2025-01-08 22:50:33,555 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-08 22:50:33,556 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 8 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:33,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 653 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-08 22:50:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2025-01-08 22:50:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 140 states have (on average 1.2714285714285714) internal successors, (178), 142 states have internal predecessors, (178), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-08 22:50:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 194 transitions. [2025-01-08 22:50:33,564 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 194 transitions. Word has length 56 [2025-01-08 22:50:33,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:33,564 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 194 transitions. [2025-01-08 22:50:33,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:50:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2025-01-08 22:50:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-08 22:50:33,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:33,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:33,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 22:50:33,565 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:33,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -978280269, now seen corresponding path program 1 times [2025-01-08 22:50:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:33,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718093632] [2025-01-08 22:50:33,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:33,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-08 22:50:33,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 22:50:33,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:33,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:33,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:33,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718093632] [2025-01-08 22:50:33,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718093632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:33,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:33,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:33,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043855722] [2025-01-08 22:50:33,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:33,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:33,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:33,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:33,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:33,686 INFO L87 Difference]: Start difference. First operand 156 states and 194 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:50:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:33,719 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2025-01-08 22:50:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-01-08 22:50:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:33,720 INFO L225 Difference]: With dead ends: 182 [2025-01-08 22:50:33,720 INFO L226 Difference]: Without dead ends: 179 [2025-01-08 22:50:33,720 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-08 22:50:33,721 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 20 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:33,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 264 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-08 22:50:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 160. [2025-01-08 22:50:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 144 states have (on average 1.2777777777777777) internal successors, (184), 146 states have internal predecessors, (184), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-08 22:50:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 200 transitions. [2025-01-08 22:50:33,728 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 200 transitions. Word has length 57 [2025-01-08 22:50:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 200 transitions. [2025-01-08 22:50:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:50:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 200 transitions. [2025-01-08 22:50:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-08 22:50:33,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:33,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:33,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 22:50:33,729 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:33,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:33,730 INFO L85 PathProgramCache]: Analyzing trace with hash -788745437, now seen corresponding path program 1 times [2025-01-08 22:50:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:33,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041440575] [2025-01-08 22:50:33,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:33,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-08 22:50:33,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-08 22:50:33,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:33,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:33,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:33,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041440575] [2025-01-08 22:50:33,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041440575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:33,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:33,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870928408] [2025-01-08 22:50:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:33,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:33,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:33,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:33,866 INFO L87 Difference]: Start difference. First operand 160 states and 200 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:50:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:33,886 INFO L93 Difference]: Finished difference Result 316 states and 394 transitions. [2025-01-08 22:50:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:33,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-01-08 22:50:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:33,888 INFO L225 Difference]: With dead ends: 316 [2025-01-08 22:50:33,888 INFO L226 Difference]: Without dead ends: 289 [2025-01-08 22:50:33,888 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-08 22:50:33,889 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 77 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:33,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 271 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-08 22:50:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2025-01-08 22:50:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 259 states have (on average 1.2895752895752897) internal successors, (334), 261 states have internal predecessors, (334), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2025-01-08 22:50:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 359 transitions. [2025-01-08 22:50:33,902 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 359 transitions. Word has length 59 [2025-01-08 22:50:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:33,902 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 359 transitions. [2025-01-08 22:50:33,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:50:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2025-01-08 22:50:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-08 22:50:33,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:33,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:33,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 22:50:33,903 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:33,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:33,904 INFO L85 PathProgramCache]: Analyzing trace with hash 986261925, now seen corresponding path program 1 times [2025-01-08 22:50:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:33,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492519221] [2025-01-08 22:50:33,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:33,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-08 22:50:33,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-08 22:50:33,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:33,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492519221] [2025-01-08 22:50:34,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492519221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:34,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:50:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697062972] [2025-01-08 22:50:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:34,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:34,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:34,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:34,101 INFO L87 Difference]: Start difference. First operand 284 states and 359 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:50:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:34,542 INFO L93 Difference]: Finished difference Result 516 states and 651 transitions. [2025-01-08 22:50:34,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:34,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-01-08 22:50:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:34,544 INFO L225 Difference]: With dead ends: 516 [2025-01-08 22:50:34,544 INFO L226 Difference]: Without dead ends: 284 [2025-01-08 22:50:34,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:50:34,545 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:34,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:50:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-08 22:50:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 280. [2025-01-08 22:50:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 255 states have (on average 1.2862745098039217) internal successors, (328), 257 states have internal predecessors, (328), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2025-01-08 22:50:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 353 transitions. [2025-01-08 22:50:34,556 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 353 transitions. Word has length 59 [2025-01-08 22:50:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:34,556 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 353 transitions. [2025-01-08 22:50:34,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:50:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 353 transitions. [2025-01-08 22:50:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-08 22:50:34,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:34,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:50:34,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 22:50:34,558 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:34,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash -33813175, now seen corresponding path program 1 times [2025-01-08 22:50:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:34,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968504140] [2025-01-08 22:50:34,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:34,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:34,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-08 22:50:34,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-08 22:50:34,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:34,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:34,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968504140] [2025-01-08 22:50:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968504140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:34,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:34,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:50:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324583924] [2025-01-08 22:50:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:34,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:34,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:34,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:34,818 INFO L87 Difference]: Start difference. First operand 280 states and 353 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:50:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:34,844 INFO L93 Difference]: Finished difference Result 366 states and 463 transitions. [2025-01-08 22:50:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:34,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2025-01-08 22:50:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:34,849 INFO L225 Difference]: With dead ends: 366 [2025-01-08 22:50:34,849 INFO L226 Difference]: Without dead ends: 266 [2025-01-08 22:50:34,849 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-08 22:50:34,850 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:34,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-08 22:50:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-01-08 22:50:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 241 states have (on average 1.2780082987551866) internal successors, (308), 243 states have internal predecessors, (308), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2025-01-08 22:50:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 333 transitions. [2025-01-08 22:50:34,869 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 333 transitions. Word has length 68 [2025-01-08 22:50:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:34,869 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 333 transitions. [2025-01-08 22:50:34,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:50:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 333 transitions. [2025-01-08 22:50:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-08 22:50:34,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:34,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:34,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 22:50:34,872 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:34,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1454550846, now seen corresponding path program 1 times [2025-01-08 22:50:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:34,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100658860] [2025-01-08 22:50:34,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:34,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:34,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-08 22:50:34,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-08 22:50:34,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:34,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:35,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100658860] [2025-01-08 22:50:35,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100658860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:35,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:50:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17405934] [2025-01-08 22:50:35,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:35,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:35,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:35,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:35,132 INFO L87 Difference]: Start difference. First operand 266 states and 333 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:50:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:36,162 INFO L93 Difference]: Finished difference Result 342 states and 432 transitions. [2025-01-08 22:50:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:36,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72 [2025-01-08 22:50:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:36,163 INFO L225 Difference]: With dead ends: 342 [2025-01-08 22:50:36,163 INFO L226 Difference]: Without dead ends: 256 [2025-01-08 22:50:36,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:50:36,164 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 104 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:36,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 329 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 22:50:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-08 22:50:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2025-01-08 22:50:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 233 states have internal predecessors, (294), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-08 22:50:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 317 transitions. [2025-01-08 22:50:36,174 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 317 transitions. Word has length 72 [2025-01-08 22:50:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:36,174 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 317 transitions. [2025-01-08 22:50:36,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:50:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 317 transitions. [2025-01-08 22:50:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:50:36,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:36,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:36,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-08 22:50:36,175 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:36,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1871918771, now seen corresponding path program 1 times [2025-01-08 22:50:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:36,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852512890] [2025-01-08 22:50:36,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:36,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:50:36,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:50:36,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:36,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852512890] [2025-01-08 22:50:36,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852512890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:36,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:36,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:36,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232814804] [2025-01-08 22:50:36,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:36,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:36,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:36,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:36,323 INFO L87 Difference]: Start difference. First operand 254 states and 317 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:50:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:36,339 INFO L93 Difference]: Finished difference Result 336 states and 425 transitions. [2025-01-08 22:50:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:36,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2025-01-08 22:50:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:36,340 INFO L225 Difference]: With dead ends: 336 [2025-01-08 22:50:36,340 INFO L226 Difference]: Without dead ends: 262 [2025-01-08 22:50:36,340 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-08 22:50:36,341 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:36,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 267 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-08 22:50:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2025-01-08 22:50:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 239 states have internal predecessors, (300), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-08 22:50:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 323 transitions. [2025-01-08 22:50:36,351 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 323 transitions. Word has length 73 [2025-01-08 22:50:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:36,351 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 323 transitions. [2025-01-08 22:50:36,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:50:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 323 transitions. [2025-01-08 22:50:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:50:36,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:36,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:36,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-08 22:50:36,352 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:36,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1613753333, now seen corresponding path program 1 times [2025-01-08 22:50:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:36,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248572118] [2025-01-08 22:50:36,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:36,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:36,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:50:36,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:50:36,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:36,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:36,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:36,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248572118] [2025-01-08 22:50:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248572118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:50:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290507146] [2025-01-08 22:50:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:36,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:36,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:36,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:36,618 INFO L87 Difference]: Start difference. First operand 260 states and 323 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:50:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:37,457 INFO L93 Difference]: Finished difference Result 295 states and 363 transitions. [2025-01-08 22:50:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 73 [2025-01-08 22:50:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:37,459 INFO L225 Difference]: With dead ends: 295 [2025-01-08 22:50:37,459 INFO L226 Difference]: Without dead ends: 254 [2025-01-08 22:50:37,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:37,460 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 270 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:37,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 201 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:50:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-08 22:50:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-01-08 22:50:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 231 states have (on average 1.2380952380952381) internal successors, (286), 233 states have internal predecessors, (286), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-08 22:50:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 309 transitions. [2025-01-08 22:50:37,475 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 309 transitions. Word has length 73 [2025-01-08 22:50:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:37,476 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 309 transitions. [2025-01-08 22:50:37,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:50:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 309 transitions. [2025-01-08 22:50:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:50:37,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:37,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:37,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-08 22:50:37,477 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:37,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash 122116493, now seen corresponding path program 1 times [2025-01-08 22:50:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:37,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130047815] [2025-01-08 22:50:37,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:37,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:50:37,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:50:37,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:37,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130047815] [2025-01-08 22:50:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130047815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315160813] [2025-01-08 22:50:37,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:37,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:37,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:37,598 INFO L87 Difference]: Start difference. First operand 254 states and 309 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:50:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:38,307 INFO L93 Difference]: Finished difference Result 339 states and 411 transitions. [2025-01-08 22:50:38,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:38,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 73 [2025-01-08 22:50:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:38,308 INFO L225 Difference]: With dead ends: 339 [2025-01-08 22:50:38,308 INFO L226 Difference]: Without dead ends: 283 [2025-01-08 22:50:38,308 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-08 22:50:38,310 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 46 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:38,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 226 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:50:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-01-08 22:50:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 267. [2025-01-08 22:50:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 243 states have (on average 1.2222222222222223) internal successors, (297), 245 states have internal predecessors, (297), 11 states have call successors, (11), 10 states have call predecessors, (11), 12 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2025-01-08 22:50:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 321 transitions. [2025-01-08 22:50:38,325 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 321 transitions. Word has length 73 [2025-01-08 22:50:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:38,326 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 321 transitions. [2025-01-08 22:50:38,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:50:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 321 transitions. [2025-01-08 22:50:38,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-08 22:50:38,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:38,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-08 22:50:38,327 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:38,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1581505911, now seen corresponding path program 1 times [2025-01-08 22:50:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:38,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966699728] [2025-01-08 22:50:38,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:38,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-08 22:50:38,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-08 22:50:38,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:38,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:38,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966699728] [2025-01-08 22:50:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966699728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:38,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:38,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:50:38,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936946311] [2025-01-08 22:50:38,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:38,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:50:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:38,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:50:38,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:38,577 INFO L87 Difference]: Start difference. First operand 267 states and 321 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:50:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:38,647 INFO L93 Difference]: Finished difference Result 317 states and 379 transitions. [2025-01-08 22:50:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:50:38,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2025-01-08 22:50:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:38,651 INFO L225 Difference]: With dead ends: 317 [2025-01-08 22:50:38,652 INFO L226 Difference]: Without dead ends: 284 [2025-01-08 22:50:38,652 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-08 22:50:38,652 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 16 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:38,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 664 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:50:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-08 22:50:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2025-01-08 22:50:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 251 states have (on average 1.207171314741036) internal successors, (303), 253 states have internal predecessors, (303), 11 states have call successors, (11), 10 states have call predecessors, (11), 14 states have return successors, (15), 13 states have call predecessors, (15), 9 states have call successors, (15) [2025-01-08 22:50:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 329 transitions. [2025-01-08 22:50:38,666 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 329 transitions. Word has length 74 [2025-01-08 22:50:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:38,667 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 329 transitions. [2025-01-08 22:50:38,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:50:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 329 transitions. [2025-01-08 22:50:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-08 22:50:38,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:38,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:38,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-08 22:50:38,669 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:38,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -300303064, now seen corresponding path program 1 times [2025-01-08 22:50:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:38,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63094884] [2025-01-08 22:50:38,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:38,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-08 22:50:38,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:50:38,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:38,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:38,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63094884] [2025-01-08 22:50:38,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63094884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:38,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:50:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145390332] [2025-01-08 22:50:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:38,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:50:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:38,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:50:38,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:38,881 INFO L87 Difference]: Start difference. First operand 277 states and 329 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:50:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:38,924 INFO L93 Difference]: Finished difference Result 333 states and 395 transitions. [2025-01-08 22:50:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:50:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 75 [2025-01-08 22:50:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:38,925 INFO L225 Difference]: With dead ends: 333 [2025-01-08 22:50:38,925 INFO L226 Difference]: Without dead ends: 274 [2025-01-08 22:50:38,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08 22:50:38,926 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 15 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:38,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 664 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-08 22:50:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 267. [2025-01-08 22:50:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 243 states have (on average 1.1893004115226338) internal successors, (289), 245 states have internal predecessors, (289), 11 states have call successors, (11), 10 states have call predecessors, (11), 12 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2025-01-08 22:50:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 313 transitions. [2025-01-08 22:50:38,938 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 313 transitions. Word has length 75 [2025-01-08 22:50:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:38,938 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 313 transitions. [2025-01-08 22:50:38,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:50:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 313 transitions. [2025-01-08 22:50:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-08 22:50:38,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:38,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:38,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-08 22:50:38,939 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:38,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1877065200, now seen corresponding path program 1 times [2025-01-08 22:50:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953096280] [2025-01-08 22:50:38,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:39,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-08 22:50:39,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-08 22:50:39,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:39,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:39,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953096280] [2025-01-08 22:50:39,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953096280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:39,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713943801] [2025-01-08 22:50:39,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:39,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:39,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:39,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:39,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:39,087 INFO L87 Difference]: Start difference. First operand 267 states and 313 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:50:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:39,661 INFO L93 Difference]: Finished difference Result 301 states and 350 transitions. [2025-01-08 22:50:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:39,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 81 [2025-01-08 22:50:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:39,663 INFO L225 Difference]: With dead ends: 301 [2025-01-08 22:50:39,663 INFO L226 Difference]: Without dead ends: 246 [2025-01-08 22:50:39,663 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-08 22:50:39,663 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:39,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 245 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:50:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-08 22:50:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2025-01-08 22:50:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 208 states have (on average 1.1682692307692308) internal successors, (243), 208 states have internal predecessors, (243), 8 states have call successors, (8), 8 states have call predecessors, (8), 11 states have return successors, (11), 11 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-08 22:50:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 262 transitions. [2025-01-08 22:50:39,672 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 262 transitions. Word has length 81 [2025-01-08 22:50:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:39,672 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 262 transitions. [2025-01-08 22:50:39,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:50:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 262 transitions. [2025-01-08 22:50:39,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-08 22:50:39,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:39,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:39,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-08 22:50:39,673 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:39,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1837241296, now seen corresponding path program 1 times [2025-01-08 22:50:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075309206] [2025-01-08 22:50:39,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:39,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-08 22:50:39,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-08 22:50:39,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:39,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075309206] [2025-01-08 22:50:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075309206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:39,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-08 22:50:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065800246] [2025-01-08 22:50:39,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:39,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:50:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:39,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:50:39,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:50:39,905 INFO L87 Difference]: Start difference. First operand 228 states and 262 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:40,881 INFO L93 Difference]: Finished difference Result 250 states and 286 transitions. [2025-01-08 22:50:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:50:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2025-01-08 22:50:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:40,882 INFO L225 Difference]: With dead ends: 250 [2025-01-08 22:50:40,882 INFO L226 Difference]: Without dead ends: 210 [2025-01-08 22:50:40,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:50:40,883 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 2 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:40,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 839 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 22:50:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-08 22:50:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-01-08 22:50:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 192 states have (on average 1.171875) internal successors, (225), 192 states have internal predecessors, (225), 8 states have call successors, (8), 8 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-08 22:50:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 242 transitions. [2025-01-08 22:50:40,890 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 242 transitions. Word has length 89 [2025-01-08 22:50:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:40,891 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 242 transitions. [2025-01-08 22:50:40,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:40,891 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 242 transitions. [2025-01-08 22:50:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-08 22:50:40,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:40,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:40,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-08 22:50:40,892 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:40,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash -685044864, now seen corresponding path program 1 times [2025-01-08 22:50:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:40,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289653895] [2025-01-08 22:50:40,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:40,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-08 22:50:41,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-08 22:50:41,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:41,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:41,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289653895] [2025-01-08 22:50:41,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289653895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:41,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:41,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:50:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208506622] [2025-01-08 22:50:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:41,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:41,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:41,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:41,154 INFO L87 Difference]: Start difference. First operand 210 states and 242 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:41,653 INFO L93 Difference]: Finished difference Result 228 states and 261 transitions. [2025-01-08 22:50:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:41,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2025-01-08 22:50:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:41,655 INFO L225 Difference]: With dead ends: 228 [2025-01-08 22:50:41,655 INFO L226 Difference]: Without dead ends: 210 [2025-01-08 22:50:41,655 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-08 22:50:41,655 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 488 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.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:41,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 488 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:50:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-08 22:50:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2025-01-08 22:50:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.1631578947368422) internal successors, (221), 190 states have internal predecessors, (221), 8 states have call successors, (8), 8 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-08 22:50:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 238 transitions. [2025-01-08 22:50:41,670 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 238 transitions. Word has length 89 [2025-01-08 22:50:41,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:41,670 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 238 transitions. [2025-01-08 22:50:41,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 238 transitions. [2025-01-08 22:50:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-08 22:50:41,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:41,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:41,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-08 22:50:41,671 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:41,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash 492753349, now seen corresponding path program 1 times [2025-01-08 22:50:41,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:41,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049052192] [2025-01-08 22:50:41,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:41,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:41,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-08 22:50:41,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-08 22:50:41,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:41,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:41,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:41,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049052192] [2025-01-08 22:50:41,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049052192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:41,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:41,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:50:41,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388185783] [2025-01-08 22:50:41,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:41,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:50:41,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:41,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:50:41,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:41,876 INFO L87 Difference]: Start difference. First operand 208 states and 238 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:41,903 INFO L93 Difference]: Finished difference Result 244 states and 277 transitions. [2025-01-08 22:50:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:50:41,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 90 [2025-01-08 22:50:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:41,904 INFO L225 Difference]: With dead ends: 244 [2025-01-08 22:50:41,904 INFO L226 Difference]: Without dead ends: 184 [2025-01-08 22:50:41,905 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-08 22:50:41,905 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:41,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-08 22:50:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-01-08 22:50:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 168 states have (on average 1.1488095238095237) internal successors, (193), 168 states have internal predecessors, (193), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-08 22:50:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2025-01-08 22:50:41,913 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 90 [2025-01-08 22:50:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:41,913 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2025-01-08 22:50:41,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2025-01-08 22:50:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-08 22:50:41,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:41,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:41,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-08 22:50:41,914 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:41,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1029011211, now seen corresponding path program 1 times [2025-01-08 22:50:41,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:41,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041990742] [2025-01-08 22:50:41,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:41,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-08 22:50:41,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-08 22:50:41,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:42,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041990742] [2025-01-08 22:50:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041990742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297553427] [2025-01-08 22:50:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:42,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:42,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:42,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:42,226 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:42,244 INFO L93 Difference]: Finished difference Result 282 states and 311 transitions. [2025-01-08 22:50:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:42,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 95 [2025-01-08 22:50:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:42,245 INFO L225 Difference]: With dead ends: 282 [2025-01-08 22:50:42,245 INFO L226 Difference]: Without dead ends: 184 [2025-01-08 22:50:42,246 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-08 22:50:42,246 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:42,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 229 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:42,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-08 22:50:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-01-08 22:50:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 168 states have (on average 1.1369047619047619) internal successors, (191), 168 states have internal predecessors, (191), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-08 22:50:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2025-01-08 22:50:42,254 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 95 [2025-01-08 22:50:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:42,255 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2025-01-08 22:50:42,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2025-01-08 22:50:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-08 22:50:42,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:42,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:42,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-08 22:50:42,259 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:42,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1462523538, now seen corresponding path program 1 times [2025-01-08 22:50:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:42,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177131725] [2025-01-08 22:50:42,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:42,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-08 22:50:42,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-08 22:50:42,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:42,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177131725] [2025-01-08 22:50:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177131725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:42,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:42,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980297380] [2025-01-08 22:50:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:42,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:42,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:42,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:42,712 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:42,725 INFO L93 Difference]: Finished difference Result 348 states and 389 transitions. [2025-01-08 22:50:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:42,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2025-01-08 22:50:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:42,726 INFO L225 Difference]: With dead ends: 348 [2025-01-08 22:50:42,726 INFO L226 Difference]: Without dead ends: 186 [2025-01-08 22:50:42,727 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-08 22:50:42,727 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:42,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-08 22:50:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-01-08 22:50:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 170 states have (on average 1.1352941176470588) internal successors, (193), 170 states have internal predecessors, (193), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-08 22:50:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2025-01-08 22:50:42,739 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 97 [2025-01-08 22:50:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:42,739 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2025-01-08 22:50:42,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2025-01-08 22:50:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-08 22:50:42,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:42,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:42,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-08 22:50:42,740 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:42,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash -338509039, now seen corresponding path program 1 times [2025-01-08 22:50:42,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:42,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526999982] [2025-01-08 22:50:42,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:42,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:42,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-08 22:50:42,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-08 22:50:42,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:42,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:43,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:43,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526999982] [2025-01-08 22:50:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526999982] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:50:43,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500322110] [2025-01-08 22:50:43,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:50:43,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:50:43,041 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-08 22:50:43,046 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-08 22:50:43,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-08 22:50:43,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-08 22:50:43,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:43,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:43,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-08 22:50:43,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:50:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:50:43,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:50:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500322110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:43,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:50:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-01-08 22:50:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087962618] [2025-01-08 22:50:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:43,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:43,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:43,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:50:43,840 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:50:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:43,951 INFO L93 Difference]: Finished difference Result 332 states and 367 transitions. [2025-01-08 22:50:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:43,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2025-01-08 22:50:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:43,952 INFO L225 Difference]: With dead ends: 332 [2025-01-08 22:50:43,952 INFO L226 Difference]: Without dead ends: 194 [2025-01-08 22:50:43,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:50:43,953 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:43,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 435 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:50:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-08 22:50:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2025-01-08 22:50:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 176 states have (on average 1.1306818181818181) internal successors, (199), 176 states have internal predecessors, (199), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-08 22:50:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 214 transitions. [2025-01-08 22:50:43,962 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 214 transitions. Word has length 98 [2025-01-08 22:50:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:43,962 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 214 transitions. [2025-01-08 22:50:43,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-08 22:50:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 214 transitions. [2025-01-08 22:50:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-08 22:50:43,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:43,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:43,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:50:44,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-08 22:50:44,167 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:44,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash 776741780, now seen corresponding path program 1 times [2025-01-08 22:50:44,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:44,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690085867] [2025-01-08 22:50:44,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:44,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:44,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 22:50:44,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 22:50:44,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:44,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:44,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690085867] [2025-01-08 22:50:44,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690085867] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:50:44,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399557603] [2025-01-08 22:50:44,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:44,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:50:44,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:50:44,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:50:44,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:50:45,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 22:50:45,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 22:50:45,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:45,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:45,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:50:45,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:50:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:50:45,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:50:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:50:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399557603] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:50:45,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:50:45,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-01-08 22:50:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241882648] [2025-01-08 22:50:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:45,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:45,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:45,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:45,586 INFO L87 Difference]: Start difference. First operand 192 states and 214 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:45,629 INFO L93 Difference]: Finished difference Result 308 states and 339 transitions. [2025-01-08 22:50:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 100 [2025-01-08 22:50:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:45,630 INFO L225 Difference]: With dead ends: 308 [2025-01-08 22:50:45,630 INFO L226 Difference]: Without dead ends: 194 [2025-01-08 22:50:45,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:50:45,635 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:45,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-08 22:50:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-01-08 22:50:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 178 states have (on average 1.1292134831460674) internal successors, (201), 178 states have internal predecessors, (201), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-08 22:50:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 216 transitions. [2025-01-08 22:50:45,647 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 216 transitions. Word has length 100 [2025-01-08 22:50:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:45,647 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 216 transitions. [2025-01-08 22:50:45,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2025-01-08 22:50:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-08 22:50:45,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:45,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:45,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:50:45,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-01-08 22:50:45,852 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:45,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:45,853 INFO L85 PathProgramCache]: Analyzing trace with hash 67266847, now seen corresponding path program 1 times [2025-01-08 22:50:45,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:45,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967857673] [2025-01-08 22:50:45,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:45,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:45,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-08 22:50:45,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-08 22:50:45,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:45,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:50:46,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967857673] [2025-01-08 22:50:46,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967857673] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:50:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998987792] [2025-01-08 22:50:46,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:46,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:50:46,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:50:46,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:50:46,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:50:46,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-08 22:50:46,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-08 22:50:46,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:46,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:46,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:50:46,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:50:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:50:47,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:50:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:50:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998987792] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:50:47,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:50:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 8 [2025-01-08 22:50:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081083777] [2025-01-08 22:50:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:47,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:50:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:47,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:50:47,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:50:47,066 INFO L87 Difference]: Start difference. First operand 194 states and 216 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:47,090 INFO L93 Difference]: Finished difference Result 308 states and 337 transitions. [2025-01-08 22:50:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:50:47,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 101 [2025-01-08 22:50:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:47,092 INFO L225 Difference]: With dead ends: 308 [2025-01-08 22:50:47,092 INFO L226 Difference]: Without dead ends: 196 [2025-01-08 22:50:47,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:50:47,092 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:47,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 228 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-08 22:50:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-01-08 22:50:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 180 states have (on average 1.1277777777777778) internal successors, (203), 180 states have internal predecessors, (203), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-08 22:50:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2025-01-08 22:50:47,115 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 101 [2025-01-08 22:50:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:47,116 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2025-01-08 22:50:47,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2025-01-08 22:50:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-08 22:50:47,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:47,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:47,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:50:47,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:50:47,317 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:47,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash -260979402, now seen corresponding path program 1 times [2025-01-08 22:50:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727967644] [2025-01-08 22:50:47,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:47,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-08 22:50:47,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-08 22:50:47,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:47,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:50:47,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727967644] [2025-01-08 22:50:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727967644] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:50:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213199297] [2025-01-08 22:50:47,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:50:47,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:50:47,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:50:47,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:50:48,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-08 22:50:48,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-08 22:50:48,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:48,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:48,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:50:48,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:50:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:50:48,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:50:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:50:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213199297] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:50:48,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:50:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-08 22:50:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654942156] [2025-01-08 22:50:48,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:50:48,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:50:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:48,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:50:48,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:50:48,555 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-08 22:50:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:48,590 INFO L93 Difference]: Finished difference Result 374 states and 419 transitions. [2025-01-08 22:50:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:50:48,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2025-01-08 22:50:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:48,591 INFO L225 Difference]: With dead ends: 374 [2025-01-08 22:50:48,591 INFO L226 Difference]: Without dead ends: 202 [2025-01-08 22:50:48,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:50:48,591 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:48,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-08 22:50:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-01-08 22:50:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 186 states have (on average 1.1236559139784945) internal successors, (209), 186 states have internal predecessors, (209), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-08 22:50:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2025-01-08 22:50:48,602 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 102 [2025-01-08 22:50:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:48,602 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2025-01-08 22:50:48,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-08 22:50:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2025-01-08 22:50:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-08 22:50:48,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:48,602 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:48,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:50:48,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-01-08 22:50:48,807 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:48,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1205688877, now seen corresponding path program 2 times [2025-01-08 22:50:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116655858] [2025-01-08 22:50:48,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:50:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:48,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-01-08 22:50:48,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 105 statements. [2025-01-08 22:50:48,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-08 22:50:48,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:50:49,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:49,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116655858] [2025-01-08 22:50:49,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116655858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:49,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:49,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:50:49,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18694771] [2025-01-08 22:50:49,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:49,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:50:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:49,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:50:49,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:50:49,290 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:49,325 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2025-01-08 22:50:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:50:49,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 105 [2025-01-08 22:50:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:49,327 INFO L225 Difference]: With dead ends: 292 [2025-01-08 22:50:49,327 INFO L226 Difference]: Without dead ends: 202 [2025-01-08 22:50:49,327 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-08 22:50:49,328 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 2 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:49,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 442 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-08 22:50:49,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-01-08 22:50:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 186 states have (on average 1.1129032258064515) internal successors, (207), 186 states have internal predecessors, (207), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-08 22:50:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 222 transitions. [2025-01-08 22:50:49,345 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 222 transitions. Word has length 105 [2025-01-08 22:50:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:49,347 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 222 transitions. [2025-01-08 22:50:49,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:50:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 222 transitions. [2025-01-08 22:50:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-08 22:50:49,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:49,347 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:49,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-08 22:50:49,348 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:49,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2009458730, now seen corresponding path program 1 times [2025-01-08 22:50:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198349151] [2025-01-08 22:50:49,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:49,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-08 22:50:49,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-08 22:50:49,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:49,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:50:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198349151] [2025-01-08 22:50:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198349151] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:50:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405962354] [2025-01-08 22:50:49,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:49,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:50:49,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:50:49,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:50:49,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:50:50,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-08 22:50:50,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-08 22:50:50,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:50,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:50,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-08 22:50:50,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:50:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:50:50,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:50:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:50:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405962354] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:50:50,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:50:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-08 22:50:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987872671] [2025-01-08 22:50:50,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:50:50,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-08 22:50:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:50,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-08 22:50:50,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:50:50,919 INFO L87 Difference]: Start difference. First operand 202 states and 222 transitions. Second operand has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-08 22:50:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:51,088 INFO L93 Difference]: Finished difference Result 386 states and 433 transitions. [2025-01-08 22:50:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:50:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 107 [2025-01-08 22:50:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:51,089 INFO L225 Difference]: With dead ends: 386 [2025-01-08 22:50:51,089 INFO L226 Difference]: Without dead ends: 214 [2025-01-08 22:50:51,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:50:51,090 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:51,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 687 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-08 22:50:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-01-08 22:50:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 198 states have (on average 1.106060606060606) internal successors, (219), 198 states have internal predecessors, (219), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-08 22:50:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 234 transitions. [2025-01-08 22:50:51,102 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 234 transitions. Word has length 107 [2025-01-08 22:50:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:51,102 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 234 transitions. [2025-01-08 22:50:51,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-08 22:50:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 234 transitions. [2025-01-08 22:50:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-08 22:50:51,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:51,102 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:50:51,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:50:51,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-01-08 22:50:51,303 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:51,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1053230326, now seen corresponding path program 2 times [2025-01-08 22:50:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:51,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081647035] [2025-01-08 22:50:51,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:50:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:51,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-01-08 22:50:51,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-01-08 22:50:51,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:50:51,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:50:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081647035] [2025-01-08 22:50:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081647035] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:50:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640908302] [2025-01-08 22:50:51,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:50:51,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:50:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:50:51,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:50:51,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:50:52,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes.