./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 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU --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.2.5-dev-4fc63b2 [2024-10-31 22:03:56,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:03:56,403 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:03:56,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:03:56,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:03:56,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:03:56,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:03:56,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:03:56,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:03:56,432 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:03:56,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:03:56,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:03:56,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:03:56,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:03:56,434 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:03:56,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:03:56,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:03:56,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:03:56,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:03:56,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:03:56,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:03:56,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:03:56,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:03:56,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:03:56,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:03:56,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:03:56,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:03:56,439 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:03:56,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:03:56,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:03:56,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:03:56,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:03:56,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:03:56,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:03:56,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:03:56,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:03:56,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:03:56,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:03:56,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:03:56,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:03:56,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:03:56,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:03:56,443 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU 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 [2024-10-31 22:03:56,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:03:56,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:03:56,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:03:56,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:03:56,782 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:03:56,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c Unable to find full path for "g++" [2024-10-31 22:03:58,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:03:59,207 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:03:59,210 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2024-10-31 22:03:59,251 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/data/52b288295/8552829ee6a940e68a71750cf0704692/FLAG56c662010 [2024-10-31 22:03:59,272 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/data/52b288295/8552829ee6a940e68a71750cf0704692 [2024-10-31 22:03:59,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:03:59,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:03:59,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:03:59,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:03:59,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:03:59,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:59" (1/1) ... [2024-10-31 22:03:59,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adc9938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:59, skipping insertion in model container [2024-10-31 22:03:59,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:59" (1/1) ... [2024-10-31 22:03:59,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:04:00,011 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2024-10-31 22:04:00,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:00,256 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:04:00,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [16] [2024-10-31 22:04:00,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [17] [2024-10-31 22:04:00,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [175] [2024-10-31 22:04:00,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [181] [2024-10-31 22:04:00,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [402] [2024-10-31 22:04:00,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [455] [2024-10-31 22:04:00,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [474] [2024-10-31 22:04:00,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [475] [2024-10-31 22:04:00,271 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1148] [2024-10-31 22:04:00,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1321] [2024-10-31 22:04:00,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [1417] [2024-10-31 22:04:00,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1418] [2024-10-31 22:04:00,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1421] [2024-10-31 22:04:00,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1422] [2024-10-31 22:04:00,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1423] [2024-10-31 22:04:00,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1424] [2024-10-31 22:04:00,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [1425] [2024-10-31 22:04:00,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1426] [2024-10-31 22:04:00,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1433] [2024-10-31 22:04:00,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1434] [2024-10-31 22:04:00,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1435] [2024-10-31 22:04:00,275 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1436] [2024-10-31 22:04:00,275 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1437] [2024-10-31 22:04:00,275 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1441] [2024-10-31 22:04:00,275 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1442] [2024-10-31 22:04:00,275 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1464] [2024-10-31 22:04:00,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1465] [2024-10-31 22:04:00,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1466] [2024-10-31 22:04:00,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1473] [2024-10-31 22:04:00,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1474] [2024-10-31 22:04:00,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [1475] [2024-10-31 22:04:00,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [1476] [2024-10-31 22:04:00,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [1477] [2024-10-31 22:04:00,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1478] [2024-10-31 22:04:00,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1479] [2024-10-31 22:04:00,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1480] [2024-10-31 22:04:00,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1481] [2024-10-31 22:04:00,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1482] [2024-10-31 22:04:00,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1535] [2024-10-31 22:04:00,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1536] [2024-10-31 22:04:00,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [1600] [2024-10-31 22:04:00,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [1601] [2024-10-31 22:04:00,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(INIT,DriverEntry) [1642] [2024-10-31 22:04:00,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_AddDevice) [1643] [2024-10-31 22:04:00,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_CreateClose) [1644] [2024-10-31 22:04:00,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_IoCtl) [1645] [2024-10-31 22:04:00,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_InternIoCtl) [1646] [2024-10-31 22:04:00,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Unload) [1647] [2024-10-31 22:04:00,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_DispatchPassThrough) [1648] [2024-10-31 22:04:00,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_PnP) [1649] [2024-10-31 22:04:00,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Power) [1650] [2024-10-31 22:04:00,282 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2349] [2024-10-31 22:04:00,282 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2350] [2024-10-31 22:04:00,282 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2351] [2024-10-31 22:04:00,282 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2352] [2024-10-31 22:04:00,282 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2353] [2024-10-31 22:04:00,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2354] [2024-10-31 22:04:00,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2355] [2024-10-31 22:04:00,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2356] [2024-10-31 22:04:00,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2357] [2024-10-31 22:04:00,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2358] [2024-10-31 22:04:00,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [2359] [2024-10-31 22:04:00,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [2360] [2024-10-31 22:04:00,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [2361] [2024-10-31 22:04:00,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2362] [2024-10-31 22:04:00,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2363] [2024-10-31 22:04:00,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2364] [2024-10-31 22:04:00,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2365] [2024-10-31 22:04:00,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2366] [2024-10-31 22:04:00,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2367] [2024-10-31 22:04:00,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2368] [2024-10-31 22:04:00,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [2369] [2024-10-31 22:04:00,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [2370] [2024-10-31 22:04:00,345 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2024-10-31 22:04:00,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:00,474 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:04:00,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00 WrapperNode [2024-10-31 22:04:00,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:00,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:00,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:04:00,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:04:00,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,590 INFO L138 Inliner]: procedures = 109, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1142 [2024-10-31 22:04:00,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:00,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:04:00,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:04:00,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:04:00,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,706 INFO L175 MemorySlicer]: Split 203 memory accesses to 7 slices as follows [2, 3, 8, 37, 9, 79, 65]. 39 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 92 writes are split as follows [0, 2, 1, 18, 8, 28, 35]. [2024-10-31 22:04:00,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:04:00,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:04:00,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:04:00,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:04:00,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:00,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:00,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:04:00,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db015e4-3d50-44d9-bf2e-25f10c5ebc09/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:04:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2024-10-31 22:04:00,937 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2024-10-31 22:04:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-31 22:04:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-31 22:04:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-31 22:04:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-31 22:04:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-31 22:04:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-31 22:04:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-31 22:04:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-31 22:04:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-31 22:04:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-31 22:04:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-31 22:04:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-31 22:04:00,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-31 22:04:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-31 22:04:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-31 22:04:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-31 22:04:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-31 22:04:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-31 22:04:00,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-31 22:04:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-31 22:04:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-31 22:04:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:04:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:04:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:04:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 22:04:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 22:04:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 22:04:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-31 22:04:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2024-10-31 22:04:00,942 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2024-10-31 22:04:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:04:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:04:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:04:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 22:04:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 22:04:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 22:04:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-31 22:04:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2024-10-31 22:04:00,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2024-10-31 22:04:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2024-10-31 22:04:00,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2024-10-31 22:04:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:04:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:04:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:04:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:04:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:04:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 22:04:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-31 22:04:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-31 22:04:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-31 22:04:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-31 22:04:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2024-10-31 22:04:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2024-10-31 22:04:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2024-10-31 22:04:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2024-10-31 22:04:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:04:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:04:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-31 22:04:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-31 22:04:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-31 22:04:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-31 22:04:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-31 22:04:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:04:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:04:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:04:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:04:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 22:04:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 22:04:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 22:04:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-31 22:04:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-31 22:04:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-31 22:04:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-31 22:04:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-31 22:04:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-31 22:04:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-31 22:04:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-31 22:04:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:04:00,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:04:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2024-10-31 22:04:00,950 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2024-10-31 22:04:01,347 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:04:01,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:04:01,502 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-31 22:04:01,540 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2024-10-31 22:04:01,540 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2024-10-31 22:04:01,542 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-31 22:04:01,544 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-31 22:04:01,548 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-31 22:04:01,553 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-31 22:04:01,557 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-31 22:04:01,562 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-31 22:04:01,564 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-31 22:04:03,604 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume !false; [2024-10-31 22:04:03,604 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##95: assume false; [2024-10-31 22:04:03,604 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2024-10-31 22:04:03,604 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2024-10-31 22:04:03,605 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !false; [2024-10-31 22:04:03,605 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume false; [2024-10-31 22:04:03,605 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2024-10-31 22:04:03,605 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2024-10-31 22:04:03,605 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2024-10-31 22:04:03,605 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2024-10-31 22:04:03,605 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2024-10-31 22:04:03,605 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2024-10-31 22:04:03,606 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2024-10-31 22:04:03,606 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2024-10-31 22:04:03,826 INFO L? ?]: Removed 283 outVars from TransFormulas that were not future-live. [2024-10-31 22:04:03,826 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:04:03,851 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:04:03,853 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:04:03,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:03 BoogieIcfgContainer [2024-10-31 22:04:03,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:04:03,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:04:03,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:04:03,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:04:03,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:03:59" (1/3) ... [2024-10-31 22:04:03,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa6994d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:03, skipping insertion in model container [2024-10-31 22:04:03,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00" (2/3) ... [2024-10-31 22:04:03,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa6994d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:03, skipping insertion in model container [2024-10-31 22:04:03,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:03" (3/3) ... [2024-10-31 22:04:03,864 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2024-10-31 22:04:03,883 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:04:03,883 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:04:03,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:04:03,990 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;@46e3d7cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:04:03,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:04:03,996 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) [2024-10-31 22:04:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-31 22:04:04,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:04,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:04,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:04,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash -911916137, now seen corresponding path program 1 times [2024-10-31 22:04:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71689704] [2024-10-31 22:04:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71689704] [2024-10-31 22:04:04,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71689704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:04,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:04:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115593025] [2024-10-31 22:04:04,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:04,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:04:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:04,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:04:04,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:04:04,659 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) [2024-10-31 22:04:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:04,720 INFO L93 Difference]: Finished difference Result 504 states and 803 transitions. [2024-10-31 22:04:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:04:04,724 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 [2024-10-31 22:04:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:04,737 INFO L225 Difference]: With dead ends: 504 [2024-10-31 22:04:04,737 INFO L226 Difference]: Without dead ends: 247 [2024-10-31 22:04:04,745 INFO L431 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 [2024-10-31 22:04:04,749 INFO L432 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 [2024-10-31 22:04:04,750 INFO L433 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] [2024-10-31 22:04:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-31 22:04:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-10-31 22:04:04,813 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) [2024-10-31 22:04:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 360 transitions. [2024-10-31 22:04:04,823 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 360 transitions. Word has length 16 [2024-10-31 22:04:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:04,825 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 360 transitions. [2024-10-31 22:04:04,827 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) [2024-10-31 22:04:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 360 transitions. [2024-10-31 22:04:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-31 22:04:04,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:04,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:04,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:04:04,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:04,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1498722151, now seen corresponding path program 1 times [2024-10-31 22:04:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:04,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359536720] [2024-10-31 22:04:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:05,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:05,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:05,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359536720] [2024-10-31 22:04:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359536720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:05,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:05,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:05,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860702567] [2024-10-31 22:04:05,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:05,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:05,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:05,343 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) [2024-10-31 22:04:06,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:04:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:06,836 INFO L93 Difference]: Finished difference Result 264 states and 381 transitions. [2024-10-31 22:04:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:04:06,836 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 [2024-10-31 22:04:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:06,839 INFO L225 Difference]: With dead ends: 264 [2024-10-31 22:04:06,839 INFO L226 Difference]: Without dead ends: 247 [2024-10-31 22:04:06,840 INFO L431 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 [2024-10-31 22:04:06,841 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 0 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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, 1.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:06,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1057 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-31 22:04:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-31 22:04:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-10-31 22:04:06,856 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) [2024-10-31 22:04:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 359 transitions. [2024-10-31 22:04:06,859 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 359 transitions. Word has length 16 [2024-10-31 22:04:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:06,859 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 359 transitions. [2024-10-31 22:04:06,859 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) [2024-10-31 22:04:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 359 transitions. [2024-10-31 22:04:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:04:06,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:06,861 INFO L215 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] [2024-10-31 22:04:06,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:04:06,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:06,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1858255287, now seen corresponding path program 1 times [2024-10-31 22:04:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426301299] [2024-10-31 22:04:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:07,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:07,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426301299] [2024-10-31 22:04:07,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426301299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:07,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:07,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:07,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132335722] [2024-10-31 22:04:07,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:07,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:07,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:07,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:07,269 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) [2024-10-31 22:04:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:07,321 INFO L93 Difference]: Finished difference Result 482 states and 704 transitions. [2024-10-31 22:04:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:04:07,322 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 [2024-10-31 22:04:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:07,324 INFO L225 Difference]: With dead ends: 482 [2024-10-31 22:04:07,324 INFO L226 Difference]: Without dead ends: 263 [2024-10-31 22:04:07,325 INFO L431 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 [2024-10-31 22:04:07,327 INFO L432 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 [2024-10-31 22:04:07,327 INFO L433 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] [2024-10-31 22:04:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-31 22:04:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2024-10-31 22:04:07,344 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) [2024-10-31 22:04:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 361 transitions. [2024-10-31 22:04:07,347 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 361 transitions. Word has length 28 [2024-10-31 22:04:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:07,348 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 361 transitions. [2024-10-31 22:04:07,348 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) [2024-10-31 22:04:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2024-10-31 22:04:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:04:07,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:07,350 INFO L215 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] [2024-10-31 22:04:07,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:04:07,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:07,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1246376439, now seen corresponding path program 1 times [2024-10-31 22:04:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858503055] [2024-10-31 22:04:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:07,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858503055] [2024-10-31 22:04:07,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858503055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:07,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:07,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060154641] [2024-10-31 22:04:07,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:07,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:07,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:07,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:07,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:07,723 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) [2024-10-31 22:04:08,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:08,749 INFO L93 Difference]: Finished difference Result 370 states and 527 transitions. [2024-10-31 22:04:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:08,749 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 [2024-10-31 22:04:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:08,752 INFO L225 Difference]: With dead ends: 370 [2024-10-31 22:04:08,752 INFO L226 Difference]: Without dead ends: 315 [2024-10-31 22:04:08,753 INFO L431 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 [2024-10-31 22:04:08,754 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 265 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:08,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 493 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-31 22:04:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-31 22:04:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 299. [2024-10-31 22:04:08,789 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) [2024-10-31 22:04:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 426 transitions. [2024-10-31 22:04:08,799 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 426 transitions. Word has length 28 [2024-10-31 22:04:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:08,800 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 426 transitions. [2024-10-31 22:04:08,800 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) [2024-10-31 22:04:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 426 transitions. [2024-10-31 22:04:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-31 22:04:08,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:08,805 INFO L215 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] [2024-10-31 22:04:08,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:04:08,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:08,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 688413678, now seen corresponding path program 1 times [2024-10-31 22:04:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207620340] [2024-10-31 22:04:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:08,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:09,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207620340] [2024-10-31 22:04:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207620340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:09,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:09,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:09,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230806879] [2024-10-31 22:04:09,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:09,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:09,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:09,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:09,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:09,048 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) [2024-10-31 22:04:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:09,108 INFO L93 Difference]: Finished difference Result 455 states and 634 transitions. [2024-10-31 22:04:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:09,109 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 [2024-10-31 22:04:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:09,113 INFO L225 Difference]: With dead ends: 455 [2024-10-31 22:04:09,114 INFO L226 Difference]: Without dead ends: 356 [2024-10-31 22:04:09,115 INFO L431 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 [2024-10-31 22:04:09,116 INFO L432 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 [2024-10-31 22:04:09,120 INFO L433 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] [2024-10-31 22:04:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-31 22:04:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 333. [2024-10-31 22:04:09,148 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) [2024-10-31 22:04:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 471 transitions. [2024-10-31 22:04:09,151 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 471 transitions. Word has length 30 [2024-10-31 22:04:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:09,151 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 471 transitions. [2024-10-31 22:04:09,152 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) [2024-10-31 22:04:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 471 transitions. [2024-10-31 22:04:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:04:09,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:09,158 INFO L215 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] [2024-10-31 22:04:09,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:04:09,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:09,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1673224715, now seen corresponding path program 1 times [2024-10-31 22:04:09,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:09,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17978289] [2024-10-31 22:04:09,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:09,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:09,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17978289] [2024-10-31 22:04:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17978289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:09,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:09,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735338498] [2024-10-31 22:04:09,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:09,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:09,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:09,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:09,694 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) [2024-10-31 22:04:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:10,819 INFO L93 Difference]: Finished difference Result 357 states and 498 transitions. [2024-10-31 22:04:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:04:10,820 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 [2024-10-31 22:04:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:10,822 INFO L225 Difference]: With dead ends: 357 [2024-10-31 22:04:10,822 INFO L226 Difference]: Without dead ends: 349 [2024-10-31 22:04:10,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:10,824 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 577 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:10,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 419 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-31 22:04:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-31 22:04:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 338. [2024-10-31 22:04:10,851 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) [2024-10-31 22:04:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2024-10-31 22:04:10,854 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 32 [2024-10-31 22:04:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:10,854 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2024-10-31 22:04:10,854 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) [2024-10-31 22:04:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2024-10-31 22:04:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-31 22:04:10,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:10,856 INFO L215 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] [2024-10-31 22:04:10,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:04:10,856 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:10,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash -77064409, now seen corresponding path program 1 times [2024-10-31 22:04:10,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:10,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128900961] [2024-10-31 22:04:10,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:10,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:11,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:11,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128900961] [2024-10-31 22:04:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128900961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:11,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:11,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:11,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059192805] [2024-10-31 22:04:11,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:11,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:11,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:11,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:11,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:11,334 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) [2024-10-31 22:04:12,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:04:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:12,951 INFO L93 Difference]: Finished difference Result 357 states and 497 transitions. [2024-10-31 22:04:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:04:12,952 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 [2024-10-31 22:04:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:12,954 INFO L225 Difference]: With dead ends: 357 [2024-10-31 22:04:12,954 INFO L226 Difference]: Without dead ends: 349 [2024-10-31 22:04:12,955 INFO L431 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 [2024-10-31 22:04:12,955 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 574 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:12,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 422 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-31 22:04:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-31 22:04:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 339. [2024-10-31 22:04:12,973 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) [2024-10-31 22:04:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 478 transitions. [2024-10-31 22:04:12,976 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 478 transitions. Word has length 33 [2024-10-31 22:04:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:12,977 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 478 transitions. [2024-10-31 22:04:12,978 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) [2024-10-31 22:04:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 478 transitions. [2024-10-31 22:04:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-31 22:04:12,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:12,980 INFO L215 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] [2024-10-31 22:04:12,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:04:12,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:12,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -493595954, now seen corresponding path program 1 times [2024-10-31 22:04:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:12,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680067752] [2024-10-31 22:04:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:12,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:13,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680067752] [2024-10-31 22:04:13,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680067752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:13,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:13,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437481476] [2024-10-31 22:04:13,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:13,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:13,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:13,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:13,273 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) [2024-10-31 22:04:15,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:04:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:15,705 INFO L93 Difference]: Finished difference Result 342 states and 480 transitions. [2024-10-31 22:04:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:15,706 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 [2024-10-31 22:04:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:15,708 INFO L225 Difference]: With dead ends: 342 [2024-10-31 22:04:15,708 INFO L226 Difference]: Without dead ends: 338 [2024-10-31 22:04:15,709 INFO L431 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 [2024-10-31 22:04:15,713 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 24 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:15,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 592 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-31 22:04:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-31 22:04:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-10-31 22:04:15,745 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) [2024-10-31 22:04:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 475 transitions. [2024-10-31 22:04:15,748 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 475 transitions. Word has length 37 [2024-10-31 22:04:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:15,749 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 475 transitions. [2024-10-31 22:04:15,749 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) [2024-10-31 22:04:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 475 transitions. [2024-10-31 22:04:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 22:04:15,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:15,752 INFO L215 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] [2024-10-31 22:04:15,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:04:15,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:15,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1667551938, now seen corresponding path program 1 times [2024-10-31 22:04:15,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:15,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207364847] [2024-10-31 22:04:15,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:16,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:16,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207364847] [2024-10-31 22:04:16,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207364847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:16,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:16,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427775532] [2024-10-31 22:04:16,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:16,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:16,090 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) [2024-10-31 22:04:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:16,327 INFO L93 Difference]: Finished difference Result 350 states and 486 transitions. [2024-10-31 22:04:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:04:16,328 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 [2024-10-31 22:04:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:16,330 INFO L225 Difference]: With dead ends: 350 [2024-10-31 22:04:16,330 INFO L226 Difference]: Without dead ends: 308 [2024-10-31 22:04:16,331 INFO L431 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 [2024-10-31 22:04:16,331 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 561 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:16,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 419 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-31 22:04:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2024-10-31 22:04:16,349 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) [2024-10-31 22:04:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 430 transitions. [2024-10-31 22:04:16,351 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 430 transitions. Word has length 34 [2024-10-31 22:04:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:16,352 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 430 transitions. [2024-10-31 22:04:16,352 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) [2024-10-31 22:04:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 430 transitions. [2024-10-31 22:04:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-31 22:04:16,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:16,354 INFO L215 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] [2024-10-31 22:04:16,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:04:16,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:16,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:16,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1931560749, now seen corresponding path program 1 times [2024-10-31 22:04:16,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:16,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310863183] [2024-10-31 22:04:16,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:16,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:16,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310863183] [2024-10-31 22:04:16,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310863183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:16,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482189756] [2024-10-31 22:04:16,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:16,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:16,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:16,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:16,780 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) [2024-10-31 22:04:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:16,989 INFO L93 Difference]: Finished difference Result 359 states and 497 transitions. [2024-10-31 22:04:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:04:16,990 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 [2024-10-31 22:04:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:16,992 INFO L225 Difference]: With dead ends: 359 [2024-10-31 22:04:16,992 INFO L226 Difference]: Without dead ends: 320 [2024-10-31 22:04:16,993 INFO L431 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 [2024-10-31 22:04:16,993 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:16,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 540 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-31 22:04:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 305. [2024-10-31 22:04:17,013 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) [2024-10-31 22:04:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 428 transitions. [2024-10-31 22:04:17,015 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 428 transitions. Word has length 43 [2024-10-31 22:04:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:17,015 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 428 transitions. [2024-10-31 22:04:17,016 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) [2024-10-31 22:04:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 428 transitions. [2024-10-31 22:04:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-31 22:04:17,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:17,017 INFO L215 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] [2024-10-31 22:04:17,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:04:17,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:17,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash 962163972, now seen corresponding path program 1 times [2024-10-31 22:04:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:17,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524811940] [2024-10-31 22:04:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:17,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:04:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524811940] [2024-10-31 22:04:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524811940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:17,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:17,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:04:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56104292] [2024-10-31 22:04:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:17,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:04:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:17,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:04:17,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:04:17,601 INFO L87 Difference]: Start difference. First operand 305 states and 428 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) 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) [2024-10-31 22:04:20,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:04:21,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:04:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:22,268 INFO L93 Difference]: Finished difference Result 332 states and 460 transitions. [2024-10-31 22:04:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:04:22,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) 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 [2024-10-31 22:04:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:22,271 INFO L225 Difference]: With dead ends: 332 [2024-10-31 22:04:22,271 INFO L226 Difference]: Without dead ends: 324 [2024-10-31 22:04:22,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:04:22,273 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 374 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:22,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1030 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-31 22:04:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-31 22:04:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2024-10-31 22:04:22,295 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) [2024-10-31 22:04:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 442 transitions. [2024-10-31 22:04:22,297 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 442 transitions. Word has length 44 [2024-10-31 22:04:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:22,297 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 442 transitions. [2024-10-31 22:04:22,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) 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) [2024-10-31 22:04:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 442 transitions. [2024-10-31 22:04:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-31 22:04:22,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:22,299 INFO L215 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] [2024-10-31 22:04:22,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:04:22,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:22,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -645110962, now seen corresponding path program 1 times [2024-10-31 22:04:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230287810] [2024-10-31 22:04:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:22,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:04:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:22,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:22,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230287810] [2024-10-31 22:04:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230287810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:22,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:22,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:04:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890760027] [2024-10-31 22:04:22,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:22,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:04:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:22,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:04:22,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:04:22,809 INFO L87 Difference]: Start difference. First operand 316 states and 442 transitions. Second operand has 6 states, 6 states have (on average 7.0) 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) [2024-10-31 22:04:24,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:04:25,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:04:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:26,201 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2024-10-31 22:04:26,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:04:26,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) 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 [2024-10-31 22:04:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:26,203 INFO L225 Difference]: With dead ends: 332 [2024-10-31 22:04:26,204 INFO L226 Difference]: Without dead ends: 324 [2024-10-31 22:04:26,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:04:26,205 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 385 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:26,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 787 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-31 22:04:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-31 22:04:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 317. [2024-10-31 22:04:26,227 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) [2024-10-31 22:04:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 443 transitions. [2024-10-31 22:04:26,229 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 443 transitions. Word has length 45 [2024-10-31 22:04:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:26,230 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 443 transitions. [2024-10-31 22:04:26,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) 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) [2024-10-31 22:04:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 443 transitions. [2024-10-31 22:04:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-31 22:04:26,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:26,232 INFO L215 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] [2024-10-31 22:04:26,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:04:26,232 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:26,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1115258642, now seen corresponding path program 1 times [2024-10-31 22:04:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:26,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354975050] [2024-10-31 22:04:26,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:26,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:26,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:26,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354975050] [2024-10-31 22:04:26,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354975050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:26,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:26,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:26,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993948539] [2024-10-31 22:04:26,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:26,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:26,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:26,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:26,642 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) [2024-10-31 22:04:27,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:04:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:28,222 INFO L93 Difference]: Finished difference Result 356 states and 492 transitions. [2024-10-31 22:04:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:04:28,223 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 [2024-10-31 22:04:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:28,227 INFO L225 Difference]: With dead ends: 356 [2024-10-31 22:04:28,227 INFO L226 Difference]: Without dead ends: 315 [2024-10-31 22:04:28,227 INFO L431 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 [2024-10-31 22:04:28,228 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 327 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:28,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 543 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-31 22:04:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-31 22:04:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-10-31 22:04:28,251 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) [2024-10-31 22:04:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 439 transitions. [2024-10-31 22:04:28,253 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 439 transitions. Word has length 45 [2024-10-31 22:04:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:28,253 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 439 transitions. [2024-10-31 22:04:28,254 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) [2024-10-31 22:04:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 439 transitions. [2024-10-31 22:04:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-31 22:04:28,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:28,255 INFO L215 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] [2024-10-31 22:04:28,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:04:28,256 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:28,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:28,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1689247762, now seen corresponding path program 1 times [2024-10-31 22:04:28,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:28,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043850801] [2024-10-31 22:04:28,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:28,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:28,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:28,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043850801] [2024-10-31 22:04:28,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043850801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:28,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:28,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:28,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796350852] [2024-10-31 22:04:28,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:28,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:28,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:28,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:28,486 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) [2024-10-31 22:04:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:28,529 INFO L93 Difference]: Finished difference Result 332 states and 460 transitions. [2024-10-31 22:04:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:28,529 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 [2024-10-31 22:04:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:28,532 INFO L225 Difference]: With dead ends: 332 [2024-10-31 22:04:28,532 INFO L226 Difference]: Without dead ends: 309 [2024-10-31 22:04:28,532 INFO L431 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 [2024-10-31 22:04:28,533 INFO L432 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 [2024-10-31 22:04:28,534 INFO L433 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] [2024-10-31 22:04:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-31 22:04:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-31 22:04:28,554 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) [2024-10-31 22:04:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 428 transitions. [2024-10-31 22:04:28,556 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 428 transitions. Word has length 45 [2024-10-31 22:04:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:28,557 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 428 transitions. [2024-10-31 22:04:28,557 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) [2024-10-31 22:04:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 428 transitions. [2024-10-31 22:04:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-31 22:04:28,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:28,558 INFO L215 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] [2024-10-31 22:04:28,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:04:28,558 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:28,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash -818542556, now seen corresponding path program 1 times [2024-10-31 22:04:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:28,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649263059] [2024-10-31 22:04:28,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:28,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:28,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649263059] [2024-10-31 22:04:28,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649263059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:28,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:28,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:04:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274742036] [2024-10-31 22:04:28,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:28,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:04:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:28,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:04:28,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:04:28,956 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)