./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:16:18,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:16:19,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:16:19,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:16:19,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:16:19,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:16:19,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:16:19,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:16:19,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:16:19,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:16:19,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:16:19,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:16:19,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:16:19,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:16:19,030 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:16:19,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:16:19,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:16:19,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:16:19,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:16:19,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:16:19,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:16:19,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:16:19,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:16:19,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:16:19,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:16:19,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:16:19,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:16:19,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:16:19,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:16:19,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:16:19,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:16:19,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:16:19,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:16:19,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:16:19,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:16:19,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:16:19,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:16:19,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:16:19,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:16:19,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:16:19,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:16:19,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:16:19,038 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 [2024-11-21 21:16:19,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:16:19,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:16:19,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:16:19,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:16:19,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:16:19,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2024-11-21 21:16:20,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:16:20,708 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:16:20,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2024-11-21 21:16:20,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77842fd1c/63e0ee154cdc44a4ac0e1422e134ff7a/FLAG5617ea127 [2024-11-21 21:16:20,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77842fd1c/63e0ee154cdc44a4ac0e1422e134ff7a [2024-11-21 21:16:20,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:16:20,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:16:20,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:16:20,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:16:20,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:16:20,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:16:20" (1/1) ... [2024-11-21 21:16:20,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614561f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:20, skipping insertion in model container [2024-11-21 21:16:20,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:16:20" (1/1) ... [2024-11-21 21:16:20,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:16:21,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2024-11-21 21:16:21,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:16:21,323 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:16:21,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [16] [2024-11-21 21:16:21,332 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [17] [2024-11-21 21:16:21,332 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [175] [2024-11-21 21:16:21,332 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [181] [2024-11-21 21:16:21,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [402] [2024-11-21 21:16:21,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [455] [2024-11-21 21:16:21,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [474] [2024-11-21 21:16:21,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [475] [2024-11-21 21:16:21,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1148] [2024-11-21 21:16:21,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1321] [2024-11-21 21:16:21,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [1417] [2024-11-21 21:16:21,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1418] [2024-11-21 21:16:21,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1421] [2024-11-21 21:16:21,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1422] [2024-11-21 21:16:21,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1423] [2024-11-21 21:16:21,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1424] [2024-11-21 21:16:21,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [1425] [2024-11-21 21:16:21,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1426] [2024-11-21 21:16:21,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1433] [2024-11-21 21:16:21,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1434] [2024-11-21 21:16:21,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1435] [2024-11-21 21:16:21,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1436] [2024-11-21 21:16:21,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1437] [2024-11-21 21:16:21,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1441] [2024-11-21 21:16:21,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1442] [2024-11-21 21:16:21,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1464] [2024-11-21 21:16:21,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1465] [2024-11-21 21:16:21,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1466] [2024-11-21 21:16:21,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1473] [2024-11-21 21:16:21,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1474] [2024-11-21 21:16:21,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [1475] [2024-11-21 21:16:21,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [1476] [2024-11-21 21:16:21,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [1477] [2024-11-21 21:16:21,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1478] [2024-11-21 21:16:21,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1479] [2024-11-21 21:16:21,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1480] [2024-11-21 21:16:21,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1481] [2024-11-21 21:16:21,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1482] [2024-11-21 21:16:21,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1535] [2024-11-21 21:16:21,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1536] [2024-11-21 21:16:21,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [1600] [2024-11-21 21:16:21,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [1601] [2024-11-21 21:16:21,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(INIT,DriverEntry) [1642] [2024-11-21 21:16:21,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_AddDevice) [1643] [2024-11-21 21:16:21,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_CreateClose) [1644] [2024-11-21 21:16:21,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_IoCtl) [1645] [2024-11-21 21:16:21,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_InternIoCtl) [1646] [2024-11-21 21:16:21,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Unload) [1647] [2024-11-21 21:16:21,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_DispatchPassThrough) [1648] [2024-11-21 21:16:21,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_PnP) [1649] [2024-11-21 21:16:21,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Power) [1650] [2024-11-21 21:16:21,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2349] [2024-11-21 21:16:21,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2350] [2024-11-21 21:16:21,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2351] [2024-11-21 21:16:21,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2352] [2024-11-21 21:16:21,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2353] [2024-11-21 21:16:21,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2354] [2024-11-21 21:16:21,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2355] [2024-11-21 21:16:21,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2356] [2024-11-21 21:16:21,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2357] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2358] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [2359] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [2360] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [2361] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2362] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2363] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2364] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2365] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2366] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2367] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2368] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [2369] [2024-11-21 21:16:21,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [2370] [2024-11-21 21:16:21,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2024-11-21 21:16:21,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:16:21,481 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:16:21,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21 WrapperNode [2024-11-21 21:16:21,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:16:21,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:16:21,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:16:21,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:16:21,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,574 INFO L138 Inliner]: procedures = 109, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1142 [2024-11-21 21:16:21,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:16:21,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:16:21,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:16:21,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:16:21,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,659 INFO L175 MemorySlicer]: Split 203 memory accesses to 7 slices as follows [2, 3, 8, 9, 65, 79, 37]. 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, 8, 35, 28, 18]. [2024-11-21 21:16:21,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:16:21,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:16:21,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:16:21,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:16:21,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (1/1) ... [2024-11-21 21:16:21,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:16:21,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:16:21,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 21:16:21,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 21:16:21,818 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2024-11-21 21:16:21,819 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2024-11-21 21:16:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-21 21:16:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-21 21:16:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-21 21:16:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-21 21:16:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-21 21:16:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-21 21:16:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-21 21:16:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-21 21:16:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-21 21:16:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-11-21 21:16:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-11-21 21:16:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-11-21 21:16:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-11-21 21:16:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-11-21 21:16:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-21 21:16:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-21 21:16:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-21 21:16:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-21 21:16:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-21 21:16:21,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-21 21:16:21,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-21 21:16:21,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-21 21:16:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-21 21:16:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-21 21:16:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-21 21:16:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-21 21:16:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-21 21:16:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-21 21:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2024-11-21 21:16:21,824 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2024-11-21 21:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-21 21:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-21 21:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-21 21:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-21 21:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-21 21:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-21 21:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-21 21:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2024-11-21 21:16:21,824 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2024-11-21 21:16:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2024-11-21 21:16:21,825 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2024-11-21 21:16:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-21 21:16:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:16:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 21:16:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-21 21:16:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-21 21:16:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-21 21:16:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-21 21:16:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-21 21:16:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-21 21:16:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-21 21:16:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2024-11-21 21:16:21,826 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2024-11-21 21:16:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2024-11-21 21:16:21,826 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2024-11-21 21:16:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-21 21:16:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-21 21:16:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-21 21:16:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-21 21:16:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-21 21:16:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-21 21:16:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-21 21:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 21:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 21:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-21 21:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-21 21:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-21 21:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-21 21:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-21 21:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-11-21 21:16:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-11-21 21:16:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-11-21 21:16:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-11-21 21:16:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-11-21 21:16:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-11-21 21:16:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-11-21 21:16:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:16:21,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:16:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2024-11-21 21:16:21,830 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2024-11-21 21:16:22,113 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:16:22,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:16:22,223 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-21 21:16:22,249 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2024-11-21 21:16:22,249 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2024-11-21 21:16:22,250 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-21 21:16:22,251 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-21 21:16:22,253 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-21 21:16:22,255 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-21 21:16:22,257 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-21 21:16:22,259 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-21 21:16:22,260 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-21 21:16:23,153 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume !false; [2024-11-21 21:16:23,153 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##95: assume false; [2024-11-21 21:16:23,153 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2024-11-21 21:16:23,153 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2024-11-21 21:16:23,153 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !false; [2024-11-21 21:16:23,154 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume false; [2024-11-21 21:16:23,154 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2024-11-21 21:16:23,154 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2024-11-21 21:16:23,154 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2024-11-21 21:16:23,154 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2024-11-21 21:16:23,155 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2024-11-21 21:16:23,155 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2024-11-21 21:16:23,155 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2024-11-21 21:16:23,155 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2024-11-21 21:16:23,267 INFO L? ?]: Removed 283 outVars from TransFormulas that were not future-live. [2024-11-21 21:16:23,268 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:16:23,285 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:16:23,286 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-21 21:16:23,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:16:23 BoogieIcfgContainer [2024-11-21 21:16:23,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:16:23,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:16:23,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:16:23,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:16:23,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:16:20" (1/3) ... [2024-11-21 21:16:23,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2581a447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:16:23, skipping insertion in model container [2024-11-21 21:16:23,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:16:21" (2/3) ... [2024-11-21 21:16:23,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2581a447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:16:23, skipping insertion in model container [2024-11-21 21:16:23,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:16:23" (3/3) ... [2024-11-21 21:16:23,295 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2024-11-21 21:16:23,308 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:16:23,309 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:16:23,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:16:23,370 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;@17a842cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:16:23,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:16:23,374 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-11-21 21:16:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 21:16:23,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:23,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:23,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:23,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:23,384 INFO L85 PathProgramCache]: Analyzing trace with hash -911916137, now seen corresponding path program 1 times [2024-11-21 21:16:23,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:23,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662237856] [2024-11-21 21:16:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:23,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662237856] [2024-11-21 21:16:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662237856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:23,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:16:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919707224] [2024-11-21 21:16:23,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:23,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 21:16:23,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:23,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 21:16:23,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 21:16:23,773 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-11-21 21:16:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:23,826 INFO L93 Difference]: Finished difference Result 504 states and 803 transitions. [2024-11-21 21:16:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 21:16:23,828 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-11-21 21:16:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:23,836 INFO L225 Difference]: With dead ends: 504 [2024-11-21 21:16:23,836 INFO L226 Difference]: Without dead ends: 247 [2024-11-21 21:16:23,841 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-11-21 21:16:23,843 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-11-21 21:16:23,844 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-11-21 21:16:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-21 21:16:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-21 21:16:23,888 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-11-21 21:16:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 360 transitions. [2024-11-21 21:16:23,895 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 360 transitions. Word has length 16 [2024-11-21 21:16:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:23,896 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 360 transitions. [2024-11-21 21:16:23,896 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-11-21 21:16:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 360 transitions. [2024-11-21 21:16:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 21:16:23,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:23,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:23,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:16:23,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:23,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1498722151, now seen corresponding path program 1 times [2024-11-21 21:16:23,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:23,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404290637] [2024-11-21 21:16:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:24,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:24,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404290637] [2024-11-21 21:16:24,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404290637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:24,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:24,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983649436] [2024-11-21 21:16:24,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:24,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:24,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:24,185 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-11-21 21:16:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:25,244 INFO L93 Difference]: Finished difference Result 264 states and 381 transitions. [2024-11-21 21:16:25,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:25,246 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-11-21 21:16:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:25,247 INFO L225 Difference]: With dead ends: 264 [2024-11-21 21:16:25,247 INFO L226 Difference]: Without dead ends: 247 [2024-11-21 21:16:25,248 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-11-21 21:16:25,250 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 0 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:25,250 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.0s Time] [2024-11-21 21:16:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-21 21:16:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-21 21:16:25,265 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-11-21 21:16:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 359 transitions. [2024-11-21 21:16:25,268 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 359 transitions. Word has length 16 [2024-11-21 21:16:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:25,268 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 359 transitions. [2024-11-21 21:16:25,268 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-11-21 21:16:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 359 transitions. [2024-11-21 21:16:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-21 21:16:25,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:25,269 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-11-21 21:16:25,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:16:25,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1858255287, now seen corresponding path program 1 times [2024-11-21 21:16:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820189235] [2024-11-21 21:16:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:25,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:25,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820189235] [2024-11-21 21:16:25,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820189235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:25,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:25,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175992373] [2024-11-21 21:16:25,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:25,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:25,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:25,504 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-11-21 21:16:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:25,534 INFO L93 Difference]: Finished difference Result 482 states and 704 transitions. [2024-11-21 21:16:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:25,535 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-11-21 21:16:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:25,537 INFO L225 Difference]: With dead ends: 482 [2024-11-21 21:16:25,537 INFO L226 Difference]: Without dead ends: 263 [2024-11-21 21:16:25,538 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-11-21 21:16:25,539 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-11-21 21:16:25,541 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-11-21 21:16:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-21 21:16:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2024-11-21 21:16:25,554 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-11-21 21:16:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 361 transitions. [2024-11-21 21:16:25,556 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 361 transitions. Word has length 28 [2024-11-21 21:16:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:25,556 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 361 transitions. [2024-11-21 21:16:25,556 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-11-21 21:16:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2024-11-21 21:16:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-21 21:16:25,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:25,557 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-11-21 21:16:25,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:16:25,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:25,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1246376439, now seen corresponding path program 1 times [2024-11-21 21:16:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333970937] [2024-11-21 21:16:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:25,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:25,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333970937] [2024-11-21 21:16:25,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333970937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:25,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:25,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857308259] [2024-11-21 21:16:25,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:25,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:25,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:25,775 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-11-21 21:16:27,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:16:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:27,839 INFO L93 Difference]: Finished difference Result 370 states and 527 transitions. [2024-11-21 21:16:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:27,840 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-11-21 21:16:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:27,842 INFO L225 Difference]: With dead ends: 370 [2024-11-21 21:16:27,842 INFO L226 Difference]: Without dead ends: 315 [2024-11-21 21:16:27,842 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-11-21 21:16:27,843 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 265 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:27,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 493 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-21 21:16:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-21 21:16:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 299. [2024-11-21 21:16:27,857 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-11-21 21:16:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 426 transitions. [2024-11-21 21:16:27,858 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 426 transitions. Word has length 28 [2024-11-21 21:16:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:27,860 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 426 transitions. [2024-11-21 21:16:27,860 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-11-21 21:16:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 426 transitions. [2024-11-21 21:16:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-21 21:16:27,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:27,862 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-11-21 21:16:27,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:16:27,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:27,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:27,862 INFO L85 PathProgramCache]: Analyzing trace with hash 688413678, now seen corresponding path program 1 times [2024-11-21 21:16:27,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:27,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045965439] [2024-11-21 21:16:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:28,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045965439] [2024-11-21 21:16:28,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045965439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:28,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:28,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336495815] [2024-11-21 21:16:28,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:28,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:28,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:28,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:28,024 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-11-21 21:16:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:28,055 INFO L93 Difference]: Finished difference Result 455 states and 634 transitions. [2024-11-21 21:16:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:28,055 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-11-21 21:16:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:28,057 INFO L225 Difference]: With dead ends: 455 [2024-11-21 21:16:28,057 INFO L226 Difference]: Without dead ends: 356 [2024-11-21 21:16:28,057 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-11-21 21:16:28,058 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-11-21 21:16:28,058 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-11-21 21:16:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-21 21:16:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 333. [2024-11-21 21:16:28,070 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-11-21 21:16:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 471 transitions. [2024-11-21 21:16:28,072 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 471 transitions. Word has length 30 [2024-11-21 21:16:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:28,072 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 471 transitions. [2024-11-21 21:16:28,072 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-11-21 21:16:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 471 transitions. [2024-11-21 21:16:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-21 21:16:28,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:28,074 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-11-21 21:16:28,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:16:28,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1673224715, now seen corresponding path program 1 times [2024-11-21 21:16:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007752658] [2024-11-21 21:16:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:28,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007752658] [2024-11-21 21:16:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007752658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:28,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:28,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:28,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54601829] [2024-11-21 21:16:28,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:28,417 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-11-21 21:16:29,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:16:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:30,035 INFO L93 Difference]: Finished difference Result 357 states and 498 transitions. [2024-11-21 21:16:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:30,036 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-11-21 21:16:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:30,038 INFO L225 Difference]: With dead ends: 357 [2024-11-21 21:16:30,038 INFO L226 Difference]: Without dead ends: 349 [2024-11-21 21:16:30,038 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-11-21 21:16:30,038 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 575 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:30,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 421 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-21 21:16:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-21 21:16:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 338. [2024-11-21 21:16:30,052 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-11-21 21:16:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2024-11-21 21:16:30,053 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 32 [2024-11-21 21:16:30,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:30,054 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2024-11-21 21:16:30,054 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-11-21 21:16:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2024-11-21 21:16:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-21 21:16:30,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:30,056 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-11-21 21:16:30,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:16:30,056 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:30,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash -77064409, now seen corresponding path program 1 times [2024-11-21 21:16:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:30,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199101950] [2024-11-21 21:16:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:30,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:30,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199101950] [2024-11-21 21:16:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199101950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:30,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:30,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953270410] [2024-11-21 21:16:30,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:30,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:30,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:30,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:30,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:30,311 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-11-21 21:16:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:31,287 INFO L93 Difference]: Finished difference Result 357 states and 497 transitions. [2024-11-21 21:16:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:31,287 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-11-21 21:16:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:31,289 INFO L225 Difference]: With dead ends: 357 [2024-11-21 21:16:31,289 INFO L226 Difference]: Without dead ends: 349 [2024-11-21 21:16:31,289 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-11-21 21:16:31,290 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 574 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:31,290 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.0s Time] [2024-11-21 21:16:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-21 21:16:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 339. [2024-11-21 21:16:31,300 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-11-21 21:16:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 478 transitions. [2024-11-21 21:16:31,305 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 478 transitions. Word has length 33 [2024-11-21 21:16:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:31,305 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 478 transitions. [2024-11-21 21:16:31,305 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-11-21 21:16:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 478 transitions. [2024-11-21 21:16:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-21 21:16:31,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:31,306 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-11-21 21:16:31,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:16:31,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:31,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash -493595954, now seen corresponding path program 1 times [2024-11-21 21:16:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:31,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660742209] [2024-11-21 21:16:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:31,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660742209] [2024-11-21 21:16:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660742209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:31,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:31,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:31,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351030221] [2024-11-21 21:16:31,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:31,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:31,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:31,459 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-11-21 21:16:33,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:16:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:33,248 INFO L93 Difference]: Finished difference Result 342 states and 480 transitions. [2024-11-21 21:16:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:33,248 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-11-21 21:16:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:33,250 INFO L225 Difference]: With dead ends: 342 [2024-11-21 21:16:33,250 INFO L226 Difference]: Without dead ends: 338 [2024-11-21 21:16:33,250 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-11-21 21:16:33,251 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 24 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 1.8s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:33,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 592 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-21 21:16:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-21 21:16:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-11-21 21:16:33,275 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-11-21 21:16:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 475 transitions. [2024-11-21 21:16:33,276 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 475 transitions. Word has length 37 [2024-11-21 21:16:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:33,276 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 475 transitions. [2024-11-21 21:16:33,276 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-11-21 21:16:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 475 transitions. [2024-11-21 21:16:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-21 21:16:33,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:33,277 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-11-21 21:16:33,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:16:33,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:33,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1667551938, now seen corresponding path program 1 times [2024-11-21 21:16:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:33,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3582538] [2024-11-21 21:16:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:33,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3582538] [2024-11-21 21:16:33,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3582538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:33,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:33,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953042681] [2024-11-21 21:16:33,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:33,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:33,436 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-11-21 21:16:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:33,572 INFO L93 Difference]: Finished difference Result 350 states and 486 transitions. [2024-11-21 21:16:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:33,572 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-11-21 21:16:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:33,575 INFO L225 Difference]: With dead ends: 350 [2024-11-21 21:16:33,575 INFO L226 Difference]: Without dead ends: 308 [2024-11-21 21:16:33,576 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-11-21 21:16:33,576 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 560 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:33,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 420 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:16:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-21 21:16:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2024-11-21 21:16:33,588 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-11-21 21:16:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 430 transitions. [2024-11-21 21:16:33,589 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 430 transitions. Word has length 34 [2024-11-21 21:16:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:33,590 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 430 transitions. [2024-11-21 21:16:33,590 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-11-21 21:16:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 430 transitions. [2024-11-21 21:16:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-21 21:16:33,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:33,591 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-11-21 21:16:33,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 21:16:33,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:33,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1931560749, now seen corresponding path program 1 times [2024-11-21 21:16:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779721761] [2024-11-21 21:16:33,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:33,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:33,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779721761] [2024-11-21 21:16:33,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779721761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:33,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:33,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:33,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828186362] [2024-11-21 21:16:33,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:33,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:33,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:33,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:33,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:33,841 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-11-21 21:16:33,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:33,960 INFO L93 Difference]: Finished difference Result 359 states and 497 transitions. [2024-11-21 21:16:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:33,961 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-11-21 21:16:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:33,963 INFO L225 Difference]: With dead ends: 359 [2024-11-21 21:16:33,963 INFO L226 Difference]: Without dead ends: 320 [2024-11-21 21:16:33,963 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-11-21 21:16:33,964 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.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:33,964 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.1s Time] [2024-11-21 21:16:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-21 21:16:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 305. [2024-11-21 21:16:33,974 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-11-21 21:16:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 428 transitions. [2024-11-21 21:16:33,976 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 428 transitions. Word has length 43 [2024-11-21 21:16:33,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:33,976 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 428 transitions. [2024-11-21 21:16:33,976 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-11-21 21:16:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 428 transitions. [2024-11-21 21:16:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-21 21:16:33,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:33,977 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-11-21 21:16:33,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 21:16:33,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:33,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash 962163972, now seen corresponding path program 1 times [2024-11-21 21:16:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294083702] [2024-11-21 21:16:33,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294083702] [2024-11-21 21:16:34,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294083702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:34,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:34,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:16:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903827382] [2024-11-21 21:16:34,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:34,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:16:34,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:34,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:16:34,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:34,248 INFO L87 Difference]: Start difference. First operand 305 states and 428 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:36,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:16:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:37,090 INFO L93 Difference]: Finished difference Result 332 states and 460 transitions. [2024-11-21 21:16:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:16:37,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-11-21 21:16:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:37,093 INFO L225 Difference]: With dead ends: 332 [2024-11-21 21:16:37,093 INFO L226 Difference]: Without dead ends: 324 [2024-11-21 21:16:37,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:37,094 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 349 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:37,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 817 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-21 21:16:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-21 21:16:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2024-11-21 21:16:37,107 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-11-21 21:16:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 442 transitions. [2024-11-21 21:16:37,108 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 442 transitions. Word has length 44 [2024-11-21 21:16:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:37,108 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 442 transitions. [2024-11-21 21:16:37,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 442 transitions. [2024-11-21 21:16:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-21 21:16:37,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:37,110 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-11-21 21:16:37,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 21:16:37,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:37,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:37,111 INFO L85 PathProgramCache]: Analyzing trace with hash -645110962, now seen corresponding path program 1 times [2024-11-21 21:16:37,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:37,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811672142] [2024-11-21 21:16:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811672142] [2024-11-21 21:16:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811672142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:37,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:16:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331693788] [2024-11-21 21:16:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:37,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:16:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:16:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:37,405 INFO L87 Difference]: Start difference. First operand 316 states and 442 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:39,121 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2024-11-21 21:16:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:16:39,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-11-21 21:16:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:39,123 INFO L225 Difference]: With dead ends: 332 [2024-11-21 21:16:39,123 INFO L226 Difference]: Without dead ends: 324 [2024-11-21 21:16:39,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:39,124 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 345 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:39,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 819 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-21 21:16:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-21 21:16:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 317. [2024-11-21 21:16:39,133 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-11-21 21:16:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 443 transitions. [2024-11-21 21:16:39,134 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 443 transitions. Word has length 45 [2024-11-21 21:16:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:39,134 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 443 transitions. [2024-11-21 21:16:39,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 443 transitions. [2024-11-21 21:16:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-21 21:16:39,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:39,135 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-11-21 21:16:39,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 21:16:39,135 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:39,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1115258642, now seen corresponding path program 1 times [2024-11-21 21:16:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:39,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738274797] [2024-11-21 21:16:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:39,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738274797] [2024-11-21 21:16:39,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738274797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:39,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:39,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:39,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193684603] [2024-11-21 21:16:39,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:39,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:39,389 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-11-21 21:16:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:40,488 INFO L93 Difference]: Finished difference Result 356 states and 492 transitions. [2024-11-21 21:16:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:40,488 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-11-21 21:16:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:40,490 INFO L225 Difference]: With dead ends: 356 [2024-11-21 21:16:40,490 INFO L226 Difference]: Without dead ends: 315 [2024-11-21 21:16:40,490 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-11-21 21:16:40,490 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 327 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:40,491 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.1s Time] [2024-11-21 21:16:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-21 21:16:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-11-21 21:16:40,500 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-11-21 21:16:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 439 transitions. [2024-11-21 21:16:40,501 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 439 transitions. Word has length 45 [2024-11-21 21:16:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:40,501 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 439 transitions. [2024-11-21 21:16:40,501 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-11-21 21:16:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 439 transitions. [2024-11-21 21:16:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-21 21:16:40,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:40,502 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-11-21 21:16:40,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 21:16:40,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:40,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1689247762, now seen corresponding path program 1 times [2024-11-21 21:16:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161931305] [2024-11-21 21:16:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161931305] [2024-11-21 21:16:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161931305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:40,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201473771] [2024-11-21 21:16:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:40,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:40,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:40,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:40,611 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-11-21 21:16:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:40,634 INFO L93 Difference]: Finished difference Result 332 states and 460 transitions. [2024-11-21 21:16:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:40,634 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-11-21 21:16:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:40,635 INFO L225 Difference]: With dead ends: 332 [2024-11-21 21:16:40,635 INFO L226 Difference]: Without dead ends: 309 [2024-11-21 21:16:40,636 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-11-21 21:16:40,637 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-11-21 21:16:40,637 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-11-21 21:16:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-21 21:16:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-21 21:16:40,648 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-11-21 21:16:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 428 transitions. [2024-11-21 21:16:40,649 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 428 transitions. Word has length 45 [2024-11-21 21:16:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:40,649 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 428 transitions. [2024-11-21 21:16:40,649 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-11-21 21:16:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 428 transitions. [2024-11-21 21:16:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-21 21:16:40,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:40,650 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-11-21 21:16:40,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 21:16:40,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:40,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:40,651 INFO L85 PathProgramCache]: Analyzing trace with hash -818542556, now seen corresponding path program 1 times [2024-11-21 21:16:40,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:40,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809604041] [2024-11-21 21:16:40,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:40,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:40,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:40,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809604041] [2024-11-21 21:16:40,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809604041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:40,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:40,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 21:16:40,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027697077] [2024-11-21 21:16:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:40,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 21:16:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:40,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 21:16:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:40,880 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) [2024-11-21 21:16:43,170 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-11-21 21:16:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:43,226 INFO L93 Difference]: Finished difference Result 329 states and 450 transitions. [2024-11-21 21:16:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:16:43,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-21 21:16:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:43,227 INFO L225 Difference]: With dead ends: 329 [2024-11-21 21:16:43,227 INFO L226 Difference]: Without dead ends: 308 [2024-11-21 21:16:43,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:43,228 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 5 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:43,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1570 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-21 21:16:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-21 21:16:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-21 21:16:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 278 states have (on average 1.39568345323741) internal successors, (388), 281 states have internal predecessors, (388), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-21 21:16:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 426 transitions. [2024-11-21 21:16:43,239 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 426 transitions. Word has length 46 [2024-11-21 21:16:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:43,239 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 426 transitions. [2024-11-21 21:16:43,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:16:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 426 transitions. [2024-11-21 21:16:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-21 21:16:43,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:43,240 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, 1] [2024-11-21 21:16:43,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-21 21:16:43,240 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:43,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -268857801, now seen corresponding path program 1 times [2024-11-21 21:16:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791161503] [2024-11-21 21:16:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:43,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791161503] [2024-11-21 21:16:43,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791161503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:43,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:43,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:16:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292306231] [2024-11-21 21:16:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:43,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:16:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:16:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:43,533 INFO L87 Difference]: Start difference. First operand 308 states and 426 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:45,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:16:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:45,537 INFO L93 Difference]: Finished difference Result 360 states and 485 transitions. [2024-11-21 21:16:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:16:45,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-11-21 21:16:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:45,539 INFO L225 Difference]: With dead ends: 360 [2024-11-21 21:16:45,539 INFO L226 Difference]: Without dead ends: 307 [2024-11-21 21:16:45,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:45,539 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:45,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1256 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-21 21:16:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-21 21:16:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-21 21:16:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 277 states have (on average 1.3935018050541517) internal successors, (386), 280 states have internal predecessors, (386), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-21 21:16:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 424 transitions. [2024-11-21 21:16:45,551 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 424 transitions. Word has length 47 [2024-11-21 21:16:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:45,551 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 424 transitions. [2024-11-21 21:16:45,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2024-11-21 21:16:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-21 21:16:45,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:45,552 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, 1] [2024-11-21 21:16:45,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 21:16:45,552 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:45,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:45,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1768293772, now seen corresponding path program 1 times [2024-11-21 21:16:45,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:45,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215795585] [2024-11-21 21:16:45,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:45,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:45,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:45,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215795585] [2024-11-21 21:16:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215795585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:45,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:45,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:16:45,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511060751] [2024-11-21 21:16:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:45,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:16:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:45,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:16:45,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:45,722 INFO L87 Difference]: Start difference. First operand 307 states and 424 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:46,515 INFO L93 Difference]: Finished difference Result 359 states and 483 transitions. [2024-11-21 21:16:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:16:46,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-11-21 21:16:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:46,517 INFO L225 Difference]: With dead ends: 359 [2024-11-21 21:16:46,517 INFO L226 Difference]: Without dead ends: 307 [2024-11-21 21:16:46,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:46,517 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:46,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1216 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 21:16:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-21 21:16:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-21 21:16:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 277 states have (on average 1.3826714801444044) internal successors, (383), 280 states have internal predecessors, (383), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-21 21:16:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2024-11-21 21:16:46,529 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 47 [2024-11-21 21:16:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:46,529 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2024-11-21 21:16:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2024-11-21 21:16:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-21 21:16:46,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:46,530 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, 1] [2024-11-21 21:16:46,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-21 21:16:46,530 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:46,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash 109202980, now seen corresponding path program 1 times [2024-11-21 21:16:46,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:46,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256755904] [2024-11-21 21:16:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:46,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:46,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256755904] [2024-11-21 21:16:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256755904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:46,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257212202] [2024-11-21 21:16:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:46,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:46,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:46,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:46,778 INFO L87 Difference]: Start difference. First operand 307 states and 421 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:16:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:46,897 INFO L93 Difference]: Finished difference Result 342 states and 463 transitions. [2024-11-21 21:16:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:46,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-21 21:16:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:46,898 INFO L225 Difference]: With dead ends: 342 [2024-11-21 21:16:46,898 INFO L226 Difference]: Without dead ends: 228 [2024-11-21 21:16:46,899 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-11-21 21:16:46,899 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 318 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:46,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 553 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:16:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-21 21:16:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 205. [2024-11-21 21:16:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 185 states have (on average 1.3513513513513513) internal successors, (250), 189 states have internal predecessors, (250), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-21 21:16:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 272 transitions. [2024-11-21 21:16:46,907 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 272 transitions. Word has length 47 [2024-11-21 21:16:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:46,907 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 272 transitions. [2024-11-21 21:16:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:16:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 272 transitions. [2024-11-21 21:16:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-21 21:16:46,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:46,908 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, 1, 1] [2024-11-21 21:16:46,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-21 21:16:46,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:46,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash -334050122, now seen corresponding path program 1 times [2024-11-21 21:16:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142000798] [2024-11-21 21:16:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:47,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142000798] [2024-11-21 21:16:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142000798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:47,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:47,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:47,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36360099] [2024-11-21 21:16:47,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:47,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:47,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:47,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:47,043 INFO L87 Difference]: Start difference. First operand 205 states and 272 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:47,053 INFO L93 Difference]: Finished difference Result 223 states and 289 transitions. [2024-11-21 21:16:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:47,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-11-21 21:16:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:47,056 INFO L225 Difference]: With dead ends: 223 [2024-11-21 21:16:47,056 INFO L226 Difference]: Without dead ends: 179 [2024-11-21 21:16:47,056 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-11-21 21:16:47,057 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:47,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 324 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-21 21:16:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 142. [2024-11-21 21:16:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 127 states have (on average 1.31496062992126) internal successors, (167), 130 states have internal predecessors, (167), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-21 21:16:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 182 transitions. [2024-11-21 21:16:47,063 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 182 transitions. Word has length 48 [2024-11-21 21:16:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:47,064 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 182 transitions. [2024-11-21 21:16:47,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2024-11-21 21:16:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-21 21:16:47,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:47,064 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, 1, 1, 1] [2024-11-21 21:16:47,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-21 21:16:47,064 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:47,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1339230031, now seen corresponding path program 1 times [2024-11-21 21:16:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:47,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043624070] [2024-11-21 21:16:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:47,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043624070] [2024-11-21 21:16:47,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043624070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:47,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:47,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422286932] [2024-11-21 21:16:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:47,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:47,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:47,240 INFO L87 Difference]: Start difference. First operand 142 states and 182 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:48,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:16:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:48,554 INFO L93 Difference]: Finished difference Result 197 states and 252 transitions. [2024-11-21 21:16:48,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:48,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2024-11-21 21:16:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:48,555 INFO L225 Difference]: With dead ends: 197 [2024-11-21 21:16:48,555 INFO L226 Difference]: Without dead ends: 142 [2024-11-21 21:16:48,556 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-11-21 21:16:48,556 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 133 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:48,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 266 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-21 21:16:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-21 21:16:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-21 21:16:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 130 states have internal predecessors, (166), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-21 21:16:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 181 transitions. [2024-11-21 21:16:48,562 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 181 transitions. Word has length 49 [2024-11-21 21:16:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:48,562 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 181 transitions. [2024-11-21 21:16:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:16:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 181 transitions. [2024-11-21 21:16:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-21 21:16:48,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:48,563 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:48,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-21 21:16:48,563 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:48,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash -853739752, now seen corresponding path program 1 times [2024-11-21 21:16:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:48,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974661477] [2024-11-21 21:16:48,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:48,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974661477] [2024-11-21 21:16:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974661477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:48,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:48,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:48,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274178584] [2024-11-21 21:16:48,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:48,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:48,694 INFO L87 Difference]: Start difference. First operand 142 states and 181 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 21:16:50,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:16:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:50,731 INFO L93 Difference]: Finished difference Result 191 states and 243 transitions. [2024-11-21 21:16:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:50,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-21 21:16:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:50,732 INFO L225 Difference]: With dead ends: 191 [2024-11-21 21:16:50,732 INFO L226 Difference]: Without dead ends: 140 [2024-11-21 21:16:50,733 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-11-21 21:16:50,733 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:50,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 257 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-21 21:16:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-21 21:16:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-21 21:16:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 128 states have internal predecessors, (163), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-21 21:16:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2024-11-21 21:16:50,742 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 54 [2024-11-21 21:16:50,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:50,743 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2024-11-21 21:16:50,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 21:16:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2024-11-21 21:16:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-21 21:16:50,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:50,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:50,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-21 21:16:50,744 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:50,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1958668952, now seen corresponding path program 1 times [2024-11-21 21:16:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:50,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214664263] [2024-11-21 21:16:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:50,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:50,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:50,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214664263] [2024-11-21 21:16:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214664263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:50,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:50,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 21:16:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150265708] [2024-11-21 21:16:50,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:50,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 21:16:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:50,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 21:16:50,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:50,936 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 21:16:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:50,982 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2024-11-21 21:16:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:16:50,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2024-11-21 21:16:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:50,985 INFO L225 Difference]: With dead ends: 216 [2024-11-21 21:16:50,985 INFO L226 Difference]: Without dead ends: 163 [2024-11-21 21:16:50,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:50,986 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 8 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:50,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 653 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-21 21:16:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2024-11-21 21:16:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 140 states have (on average 1.2714285714285714) internal successors, (178), 142 states have internal predecessors, (178), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-21 21:16:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 194 transitions. [2024-11-21 21:16:50,995 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 194 transitions. Word has length 56 [2024-11-21 21:16:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:50,995 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 194 transitions. [2024-11-21 21:16:50,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 21:16:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2024-11-21 21:16:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-21 21:16:50,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:50,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:50,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-21 21:16:50,996 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:50,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -978280269, now seen corresponding path program 1 times [2024-11-21 21:16:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:50,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457124621] [2024-11-21 21:16:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:51,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:51,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457124621] [2024-11-21 21:16:51,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457124621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:51,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:51,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:51,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966384465] [2024-11-21 21:16:51,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:51,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:51,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:51,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:51,139 INFO L87 Difference]: Start difference. First operand 156 states and 194 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 21:16:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:51,176 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2024-11-21 21:16:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:51,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-21 21:16:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:51,178 INFO L225 Difference]: With dead ends: 182 [2024-11-21 21:16:51,178 INFO L226 Difference]: Without dead ends: 179 [2024-11-21 21:16:51,178 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-11-21 21:16:51,178 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 20 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:51,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 264 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-21 21:16:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 160. [2024-11-21 21:16:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 144 states have (on average 1.2777777777777777) internal successors, (184), 146 states have internal predecessors, (184), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-21 21:16:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 200 transitions. [2024-11-21 21:16:51,186 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 200 transitions. Word has length 57 [2024-11-21 21:16:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:51,186 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 200 transitions. [2024-11-21 21:16:51,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 21:16:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 200 transitions. [2024-11-21 21:16:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-21 21:16:51,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:51,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:51,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-21 21:16:51,187 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:51,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash -788745437, now seen corresponding path program 1 times [2024-11-21 21:16:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:51,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400361174] [2024-11-21 21:16:51,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400361174] [2024-11-21 21:16:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400361174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:51,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:51,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727196181] [2024-11-21 21:16:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:51,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:51,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:51,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:51,341 INFO L87 Difference]: Start difference. First operand 160 states and 200 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 21:16:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:51,363 INFO L93 Difference]: Finished difference Result 316 states and 394 transitions. [2024-11-21 21:16:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:51,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2024-11-21 21:16:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:51,365 INFO L225 Difference]: With dead ends: 316 [2024-11-21 21:16:51,365 INFO L226 Difference]: Without dead ends: 289 [2024-11-21 21:16:51,366 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-11-21 21:16:51,366 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 77 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:51,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 271 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-21 21:16:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-11-21 21:16:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 259 states have (on average 1.2895752895752897) internal successors, (334), 261 states have internal predecessors, (334), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-21 21:16:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 359 transitions. [2024-11-21 21:16:51,381 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 359 transitions. Word has length 59 [2024-11-21 21:16:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:51,381 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 359 transitions. [2024-11-21 21:16:51,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 21:16:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2024-11-21 21:16:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-21 21:16:51,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:51,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:51,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-21 21:16:51,383 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:51,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash 986261925, now seen corresponding path program 1 times [2024-11-21 21:16:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5740406] [2024-11-21 21:16:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:51,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:51,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5740406] [2024-11-21 21:16:51,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5740406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:51,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:51,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:16:51,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755555850] [2024-11-21 21:16:51,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:51,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:16:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:51,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:16:51,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:16:51,572 INFO L87 Difference]: Start difference. First operand 284 states and 359 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 21:16:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:52,156 INFO L93 Difference]: Finished difference Result 516 states and 651 transitions. [2024-11-21 21:16:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:16:52,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2024-11-21 21:16:52,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:52,158 INFO L225 Difference]: With dead ends: 516 [2024-11-21 21:16:52,158 INFO L226 Difference]: Without dead ends: 284 [2024-11-21 21:16:52,158 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-11-21 21:16:52,159 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:52,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:16:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-21 21:16:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 280. [2024-11-21 21:16:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 255 states have (on average 1.2862745098039217) internal successors, (328), 257 states have internal predecessors, (328), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-21 21:16:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 353 transitions. [2024-11-21 21:16:52,170 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 353 transitions. Word has length 59 [2024-11-21 21:16:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:52,170 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 353 transitions. [2024-11-21 21:16:52,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 21:16:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 353 transitions. [2024-11-21 21:16:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-21 21:16:52,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:52,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:52,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-21 21:16:52,172 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:52,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash -33813175, now seen corresponding path program 1 times [2024-11-21 21:16:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886462281] [2024-11-21 21:16:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:52,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886462281] [2024-11-21 21:16:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886462281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:52,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:52,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:16:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011583257] [2024-11-21 21:16:52,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:52,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:16:52,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:52,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:16:52,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:52,431 INFO L87 Difference]: Start difference. First operand 280 states and 353 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 21:16:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:52,451 INFO L93 Difference]: Finished difference Result 366 states and 463 transitions. [2024-11-21 21:16:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:16:52,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-21 21:16:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:52,455 INFO L225 Difference]: With dead ends: 366 [2024-11-21 21:16:52,455 INFO L226 Difference]: Without dead ends: 266 [2024-11-21 21:16:52,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:52,456 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:52,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-21 21:16:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-21 21:16:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 241 states have (on average 1.2780082987551866) internal successors, (308), 243 states have internal predecessors, (308), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-21 21:16:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 333 transitions. [2024-11-21 21:16:52,471 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 333 transitions. Word has length 68 [2024-11-21 21:16:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:52,471 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 333 transitions. [2024-11-21 21:16:52,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 21:16:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 333 transitions. [2024-11-21 21:16:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-21 21:16:52,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:52,491 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, 1, 1, 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-11-21 21:16:52,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-21 21:16:52,492 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:52,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1454550846, now seen corresponding path program 1 times [2024-11-21 21:16:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:52,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523830870] [2024-11-21 21:16:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:52,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523830870] [2024-11-21 21:16:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523830870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:16:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114866099] [2024-11-21 21:16:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:52,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:16:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:52,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:16:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:52,845 INFO L87 Difference]: Start difference. First operand 266 states and 333 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 21:16:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:53,570 INFO L93 Difference]: Finished difference Result 342 states and 432 transitions. [2024-11-21 21:16:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:16:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72 [2024-11-21 21:16:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:53,572 INFO L225 Difference]: With dead ends: 342 [2024-11-21 21:16:53,572 INFO L226 Difference]: Without dead ends: 256 [2024-11-21 21:16:53,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:16:53,573 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 104 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:53,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 329 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 21:16:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-21 21:16:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2024-11-21 21:16:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 233 states have internal predecessors, (294), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-21 21:16:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 317 transitions. [2024-11-21 21:16:53,583 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 317 transitions. Word has length 72 [2024-11-21 21:16:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:53,583 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 317 transitions. [2024-11-21 21:16:53,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 21:16:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 317 transitions. [2024-11-21 21:16:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-21 21:16:53,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:53,584 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, 1, 1, 1, 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-11-21 21:16:53,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-21 21:16:53,584 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:53,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1871918771, now seen corresponding path program 1 times [2024-11-21 21:16:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012076969] [2024-11-21 21:16:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:53,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:53,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012076969] [2024-11-21 21:16:53,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012076969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:53,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:53,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106672604] [2024-11-21 21:16:53,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:53,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:53,749 INFO L87 Difference]: Start difference. First operand 254 states and 317 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:16:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:53,766 INFO L93 Difference]: Finished difference Result 336 states and 425 transitions. [2024-11-21 21:16:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:53,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2024-11-21 21:16:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:53,767 INFO L225 Difference]: With dead ends: 336 [2024-11-21 21:16:53,768 INFO L226 Difference]: Without dead ends: 262 [2024-11-21 21:16:53,768 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-11-21 21:16:53,768 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:53,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 267 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-21 21:16:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2024-11-21 21:16:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 239 states have internal predecessors, (300), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-21 21:16:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 323 transitions. [2024-11-21 21:16:53,779 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 323 transitions. Word has length 73 [2024-11-21 21:16:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:53,779 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 323 transitions. [2024-11-21 21:16:53,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:16:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 323 transitions. [2024-11-21 21:16:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-21 21:16:53,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:53,780 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, 1, 1, 1, 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-11-21 21:16:53,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-21 21:16:53,780 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:53,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1613753333, now seen corresponding path program 1 times [2024-11-21 21:16:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:53,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752849849] [2024-11-21 21:16:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:53,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752849849] [2024-11-21 21:16:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752849849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:16:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169588978] [2024-11-21 21:16:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:54,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:16:54,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:16:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:54,055 INFO L87 Difference]: Start difference. First operand 260 states and 323 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 21:16:56,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:16:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:56,176 INFO L93 Difference]: Finished difference Result 295 states and 363 transitions. [2024-11-21 21:16:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:16:56,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 73 [2024-11-21 21:16:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:56,178 INFO L225 Difference]: With dead ends: 295 [2024-11-21 21:16:56,179 INFO L226 Difference]: Without dead ends: 254 [2024-11-21 21:16:56,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:56,180 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 270 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:56,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 201 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-21 21:16:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-21 21:16:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-21 21:16:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 231 states have (on average 1.2380952380952381) internal successors, (286), 233 states have internal predecessors, (286), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-21 21:16:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 309 transitions. [2024-11-21 21:16:56,192 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 309 transitions. Word has length 73 [2024-11-21 21:16:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:56,192 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 309 transitions. [2024-11-21 21:16:56,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 21:16:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 309 transitions. [2024-11-21 21:16:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-21 21:16:56,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:56,193 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, 1, 1, 1, 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-11-21 21:16:56,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-21 21:16:56,193 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:56,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash 122116493, now seen corresponding path program 1 times [2024-11-21 21:16:56,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:56,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597161752] [2024-11-21 21:16:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597161752] [2024-11-21 21:16:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597161752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:56,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720510454] [2024-11-21 21:16:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:56,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:56,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:56,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:56,342 INFO L87 Difference]: Start difference. First operand 254 states and 309 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 21:16:57,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:16:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:57,450 INFO L93 Difference]: Finished difference Result 339 states and 411 transitions. [2024-11-21 21:16:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:57,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 73 [2024-11-21 21:16:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:57,452 INFO L225 Difference]: With dead ends: 339 [2024-11-21 21:16:57,452 INFO L226 Difference]: Without dead ends: 283 [2024-11-21 21:16:57,452 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-11-21 21:16:57,453 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 46 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:57,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 226 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-21 21:16:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-21 21:16:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 267. [2024-11-21 21:16:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 243 states have (on average 1.2222222222222223) internal successors, (297), 245 states have internal predecessors, (297), 11 states have call successors, (11), 10 states have call predecessors, (11), 12 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-21 21:16:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 321 transitions. [2024-11-21 21:16:57,465 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 321 transitions. Word has length 73 [2024-11-21 21:16:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:57,465 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 321 transitions. [2024-11-21 21:16:57,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 21:16:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 321 transitions. [2024-11-21 21:16:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-21 21:16:57,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:57,466 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, 1, 1, 1, 1, 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-11-21 21:16:57,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-21 21:16:57,466 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:57,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1581505911, now seen corresponding path program 1 times [2024-11-21 21:16:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174701699] [2024-11-21 21:16:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:57,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174701699] [2024-11-21 21:16:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174701699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 21:16:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811125112] [2024-11-21 21:16:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:57,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 21:16:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:57,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 21:16:57,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:57,666 INFO L87 Difference]: Start difference. First operand 267 states and 321 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:16:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:57,718 INFO L93 Difference]: Finished difference Result 317 states and 379 transitions. [2024-11-21 21:16:57,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:16:57,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2024-11-21 21:16:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:57,719 INFO L225 Difference]: With dead ends: 317 [2024-11-21 21:16:57,720 INFO L226 Difference]: Without dead ends: 284 [2024-11-21 21:16:57,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:57,720 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 16 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:57,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 664 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-21 21:16:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2024-11-21 21:16:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 251 states have (on average 1.207171314741036) internal successors, (303), 253 states have internal predecessors, (303), 11 states have call successors, (11), 10 states have call predecessors, (11), 14 states have return successors, (15), 13 states have call predecessors, (15), 9 states have call successors, (15) [2024-11-21 21:16:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 329 transitions. [2024-11-21 21:16:57,757 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 329 transitions. Word has length 74 [2024-11-21 21:16:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:57,757 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 329 transitions. [2024-11-21 21:16:57,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:16:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 329 transitions. [2024-11-21 21:16:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-21 21:16:57,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:57,759 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, 1, 1, 1, 1, 1, 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-11-21 21:16:57,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-21 21:16:57,759 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash -300303064, now seen corresponding path program 1 times [2024-11-21 21:16:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:57,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598804997] [2024-11-21 21:16:57,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:57,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598804997] [2024-11-21 21:16:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598804997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 21:16:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252033547] [2024-11-21 21:16:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:57,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 21:16:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 21:16:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:57,996 INFO L87 Difference]: Start difference. First operand 277 states and 329 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:16:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:58,045 INFO L93 Difference]: Finished difference Result 333 states and 395 transitions. [2024-11-21 21:16:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:16:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 75 [2024-11-21 21:16:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:58,046 INFO L225 Difference]: With dead ends: 333 [2024-11-21 21:16:58,046 INFO L226 Difference]: Without dead ends: 274 [2024-11-21 21:16:58,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:16:58,049 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 15 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:58,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 664 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-21 21:16:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 267. [2024-11-21 21:16:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 243 states have (on average 1.1893004115226338) internal successors, (289), 245 states have internal predecessors, (289), 11 states have call successors, (11), 10 states have call predecessors, (11), 12 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-21 21:16:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 313 transitions. [2024-11-21 21:16:58,065 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 313 transitions. Word has length 75 [2024-11-21 21:16:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:58,065 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 313 transitions. [2024-11-21 21:16:58,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:16:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 313 transitions. [2024-11-21 21:16:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-21 21:16:58,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:58,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:16:58,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-21 21:16:58,066 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:58,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1877065200, now seen corresponding path program 1 times [2024-11-21 21:16:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:58,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766617680] [2024-11-21 21:16:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766617680] [2024-11-21 21:16:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766617680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:58,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731689269] [2024-11-21 21:16:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:58,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:58,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:58,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:58,220 INFO L87 Difference]: Start difference. First operand 267 states and 313 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:16:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:59,017 INFO L93 Difference]: Finished difference Result 301 states and 350 transitions. [2024-11-21 21:16:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 81 [2024-11-21 21:16:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:59,019 INFO L225 Difference]: With dead ends: 301 [2024-11-21 21:16:59,019 INFO L226 Difference]: Without dead ends: 246 [2024-11-21 21:16:59,019 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-11-21 21:16:59,019 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:59,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 245 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 21:16:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-21 21:16:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2024-11-21 21:16:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 208 states have (on average 1.1682692307692308) internal successors, (243), 208 states have internal predecessors, (243), 8 states have call successors, (8), 8 states have call predecessors, (8), 11 states have return successors, (11), 11 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-21 21:16:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 262 transitions. [2024-11-21 21:16:59,029 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 262 transitions. Word has length 81 [2024-11-21 21:16:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:59,029 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 262 transitions. [2024-11-21 21:16:59,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:16:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 262 transitions. [2024-11-21 21:16:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-21 21:16:59,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:59,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:16:59,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-21 21:16:59,031 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1837241296, now seen corresponding path program 1 times [2024-11-21 21:16:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042526736] [2024-11-21 21:16:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:59,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:59,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042526736] [2024-11-21 21:16:59,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042526736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:59,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-21 21:16:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851216291] [2024-11-21 21:16:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:59,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 21:16:59,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:59,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 21:16:59,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-21 21:16:59,308 INFO L87 Difference]: Start difference. First operand 228 states and 262 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:16:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:59,758 INFO L93 Difference]: Finished difference Result 250 states and 286 transitions. [2024-11-21 21:16:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 21:16:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2024-11-21 21:16:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:59,759 INFO L225 Difference]: With dead ends: 250 [2024-11-21 21:16:59,760 INFO L226 Difference]: Without dead ends: 210 [2024-11-21 21:16:59,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-21 21:16:59,760 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 2 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:59,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 839 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:16:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-21 21:16:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-21 21:16:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 192 states have (on average 1.171875) internal successors, (225), 192 states have internal predecessors, (225), 8 states have call successors, (8), 8 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-21 21:16:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 242 transitions. [2024-11-21 21:16:59,769 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 242 transitions. Word has length 89 [2024-11-21 21:16:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:59,769 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 242 transitions. [2024-11-21 21:16:59,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:16:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 242 transitions. [2024-11-21 21:16:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-21 21:16:59,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:59,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:16:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-21 21:16:59,771 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:59,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash -685044864, now seen corresponding path program 1 times [2024-11-21 21:16:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:59,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488563960] [2024-11-21 21:16:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:16:59,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:59,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488563960] [2024-11-21 21:16:59,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488563960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:59,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:59,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:16:59,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860174069] [2024-11-21 21:16:59,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:59,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:16:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:59,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:16:59,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:16:59,998 INFO L87 Difference]: Start difference. First operand 210 states and 242 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:02,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-21 21:17:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:02,172 INFO L93 Difference]: Finished difference Result 228 states and 261 transitions. [2024-11-21 21:17:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:17:02,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2024-11-21 21:17:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:02,174 INFO L225 Difference]: With dead ends: 228 [2024-11-21 21:17:02,174 INFO L226 Difference]: Without dead ends: 210 [2024-11-21 21:17:02,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:17:02,174 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:02,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 488 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-21 21:17:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-21 21:17:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2024-11-21 21:17:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.1631578947368422) internal successors, (221), 190 states have internal predecessors, (221), 8 states have call successors, (8), 8 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-21 21:17:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 238 transitions. [2024-11-21 21:17:02,183 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 238 transitions. Word has length 89 [2024-11-21 21:17:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:02,183 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 238 transitions. [2024-11-21 21:17:02,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 238 transitions. [2024-11-21 21:17:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-21 21:17:02,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:02,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:17:02,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-21 21:17:02,185 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:02,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:02,185 INFO L85 PathProgramCache]: Analyzing trace with hash 492753349, now seen corresponding path program 1 times [2024-11-21 21:17:02,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:02,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453582479] [2024-11-21 21:17:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:17:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453582479] [2024-11-21 21:17:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453582479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:17:02,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:17:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 21:17:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709516666] [2024-11-21 21:17:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:17:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 21:17:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:17:02,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 21:17:02,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:17:02,420 INFO L87 Difference]: Start difference. First operand 208 states and 238 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:02,452 INFO L93 Difference]: Finished difference Result 244 states and 277 transitions. [2024-11-21 21:17:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:17:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 90 [2024-11-21 21:17:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:02,454 INFO L225 Difference]: With dead ends: 244 [2024-11-21 21:17:02,454 INFO L226 Difference]: Without dead ends: 184 [2024-11-21 21:17:02,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:17:02,454 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:02,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:17:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-21 21:17:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-21 21:17:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 168 states have (on average 1.1488095238095237) internal successors, (193), 168 states have internal predecessors, (193), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-21 21:17:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2024-11-21 21:17:02,463 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 90 [2024-11-21 21:17:02,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:02,464 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2024-11-21 21:17:02,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2024-11-21 21:17:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-21 21:17:02,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:02,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:17:02,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-21 21:17:02,465 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:02,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1029011211, now seen corresponding path program 1 times [2024-11-21 21:17:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:02,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566225390] [2024-11-21 21:17:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:02,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:17:02,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566225390] [2024-11-21 21:17:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566225390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:17:02,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:17:02,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:17:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692033420] [2024-11-21 21:17:02,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:17:02,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:17:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:17:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:17:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:17:02,842 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:02,857 INFO L93 Difference]: Finished difference Result 282 states and 311 transitions. [2024-11-21 21:17:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:17:02,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 95 [2024-11-21 21:17:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:02,858 INFO L225 Difference]: With dead ends: 282 [2024-11-21 21:17:02,858 INFO L226 Difference]: Without dead ends: 184 [2024-11-21 21:17:02,858 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-11-21 21:17:02,859 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:02,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 229 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:17:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-21 21:17:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-21 21:17:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 168 states have (on average 1.1369047619047619) internal successors, (191), 168 states have internal predecessors, (191), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-21 21:17:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2024-11-21 21:17:02,891 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 95 [2024-11-21 21:17:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:02,891 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2024-11-21 21:17:02,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2024-11-21 21:17:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-21 21:17:02,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:02,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:17:02,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-21 21:17:02,893 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1462523538, now seen corresponding path program 1 times [2024-11-21 21:17:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:02,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631822221] [2024-11-21 21:17:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:02,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:17:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:03,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631822221] [2024-11-21 21:17:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631822221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:17:03,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:17:03,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:17:03,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636791307] [2024-11-21 21:17:03,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:17:03,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:17:03,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:17:03,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:17:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:17:03,257 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:03,269 INFO L93 Difference]: Finished difference Result 348 states and 389 transitions. [2024-11-21 21:17:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:17:03,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2024-11-21 21:17:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:03,270 INFO L225 Difference]: With dead ends: 348 [2024-11-21 21:17:03,270 INFO L226 Difference]: Without dead ends: 186 [2024-11-21 21:17:03,270 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-11-21 21:17:03,271 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:03,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:17:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-21 21:17:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-21 21:17:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 170 states have (on average 1.1352941176470588) internal successors, (193), 170 states have internal predecessors, (193), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-21 21:17:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2024-11-21 21:17:03,279 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 97 [2024-11-21 21:17:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:03,279 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2024-11-21 21:17:03,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2024-11-21 21:17:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-21 21:17:03,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:03,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:17:03,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-21 21:17:03,280 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:03,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash -338509039, now seen corresponding path program 1 times [2024-11-21 21:17:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538898873] [2024-11-21 21:17:03,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:17:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538898873] [2024-11-21 21:17:03,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538898873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:17:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761568024] [2024-11-21 21:17:03,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:03,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:17:03,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:17:03,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:17:03,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-21 21:17:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:04,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-21 21:17:04,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:17:04,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-21 21:17:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 21:17:04,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:17:04,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761568024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:17:04,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:17:04,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2024-11-21 21:17:04,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525940494] [2024-11-21 21:17:04,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:17:04,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 21:17:04,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:17:04,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 21:17:04,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-21 21:17:04,521 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-21 21:17:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:04,619 INFO L93 Difference]: Finished difference Result 334 states and 369 transitions. [2024-11-21 21:17:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:17:04,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2024-11-21 21:17:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:04,620 INFO L225 Difference]: With dead ends: 334 [2024-11-21 21:17:04,620 INFO L226 Difference]: Without dead ends: 196 [2024-11-21 21:17:04,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-21 21:17:04,621 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 7 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:04,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 436 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:17:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-21 21:17:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2024-11-21 21:17:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 176 states have (on average 1.1306818181818181) internal successors, (199), 176 states have internal predecessors, (199), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-21 21:17:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 214 transitions. [2024-11-21 21:17:04,631 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 214 transitions. Word has length 98 [2024-11-21 21:17:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:04,631 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 214 transitions. [2024-11-21 21:17:04,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-21 21:17:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 214 transitions. [2024-11-21 21:17:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-21 21:17:04,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:04,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:17:04,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-21 21:17:04,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-21 21:17:04,833 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:04,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:04,834 INFO L85 PathProgramCache]: Analyzing trace with hash 776741780, now seen corresponding path program 1 times [2024-11-21 21:17:04,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:04,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393769455] [2024-11-21 21:17:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:04,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:17:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393769455] [2024-11-21 21:17:05,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393769455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:17:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10817149] [2024-11-21 21:17:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:05,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:17:05,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:17:05,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:17:05,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 21:17:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:06,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 21:17:06,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:17:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 21:17:06,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:17:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10817149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:17:06,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:17:06,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-21 21:17:06,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872205183] [2024-11-21 21:17:06,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:17:06,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:17:06,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:17:06,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:17:06,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:17:06,430 INFO L87 Difference]: Start difference. First operand 192 states and 214 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-21 21:17:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:06,458 INFO L93 Difference]: Finished difference Result 308 states and 339 transitions. [2024-11-21 21:17:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:17:06,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 100 [2024-11-21 21:17:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:06,460 INFO L225 Difference]: With dead ends: 308 [2024-11-21 21:17:06,460 INFO L226 Difference]: Without dead ends: 194 [2024-11-21 21:17:06,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:17:06,460 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:06,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:17:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-21 21:17:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-21 21:17:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 178 states have (on average 1.1292134831460674) internal successors, (201), 178 states have internal predecessors, (201), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-21 21:17:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 216 transitions. [2024-11-21 21:17:06,470 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 216 transitions. Word has length 100 [2024-11-21 21:17:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:06,470 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 216 transitions. [2024-11-21 21:17:06,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-21 21:17:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2024-11-21 21:17:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-21 21:17:06,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:06,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:17:06,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 21:17:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-21 21:17:06,672 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:06,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 67266847, now seen corresponding path program 1 times [2024-11-21 21:17:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50403496] [2024-11-21 21:17:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 21:17:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50403496] [2024-11-21 21:17:07,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50403496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:17:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664600948] [2024-11-21 21:17:07,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:07,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:17:07,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:17:07,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:17:07,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 21:17:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:07,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 21:17:07,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:17:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 21:17:07,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:17:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 21:17:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664600948] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-21 21:17:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:17:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 8 [2024-11-21 21:17:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454591610] [2024-11-21 21:17:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:17:07,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:17:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:17:07,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:17:07,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-21 21:17:07,984 INFO L87 Difference]: Start difference. First operand 194 states and 216 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:08,016 INFO L93 Difference]: Finished difference Result 308 states and 337 transitions. [2024-11-21 21:17:08,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:17:08,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 101 [2024-11-21 21:17:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:08,018 INFO L225 Difference]: With dead ends: 308 [2024-11-21 21:17:08,018 INFO L226 Difference]: Without dead ends: 196 [2024-11-21 21:17:08,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-21 21:17:08,019 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:08,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 341 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:17:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-21 21:17:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-21 21:17:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 180 states have (on average 1.1277777777777778) internal successors, (203), 180 states have internal predecessors, (203), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-21 21:17:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2024-11-21 21:17:08,032 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 101 [2024-11-21 21:17:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:08,032 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2024-11-21 21:17:08,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2024-11-21 21:17:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-21 21:17:08,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:08,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:17:08,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 21:17:08,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:17:08,238 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:08,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:08,238 INFO L85 PathProgramCache]: Analyzing trace with hash -260979402, now seen corresponding path program 1 times [2024-11-21 21:17:08,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:08,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361211002] [2024-11-21 21:17:08,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-21 21:17:08,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:08,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361211002] [2024-11-21 21:17:08,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361211002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:17:08,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708945258] [2024-11-21 21:17:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:08,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:17:08,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:17:08,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:17:08,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 21:17:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:09,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-21 21:17:09,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:17:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-21 21:17:09,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:17:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-21 21:17:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708945258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:17:09,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:17:09,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-21 21:17:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874422448] [2024-11-21 21:17:09,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:17:09,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 21:17:09,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:17:09,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 21:17:09,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-21 21:17:09,974 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-21 21:17:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:10,039 INFO L93 Difference]: Finished difference Result 376 states and 421 transitions. [2024-11-21 21:17:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 21:17:10,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2024-11-21 21:17:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:10,040 INFO L225 Difference]: With dead ends: 376 [2024-11-21 21:17:10,040 INFO L226 Difference]: Without dead ends: 204 [2024-11-21 21:17:10,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-21 21:17:10,041 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:10,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 690 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:17:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-21 21:17:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2024-11-21 21:17:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 186 states have (on average 1.1236559139784945) internal successors, (209), 186 states have internal predecessors, (209), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-21 21:17:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2024-11-21 21:17:10,052 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 102 [2024-11-21 21:17:10,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:10,052 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2024-11-21 21:17:10,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-21 21:17:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2024-11-21 21:17:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-21 21:17:10,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:10,053 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:17:10,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-21 21:17:10,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:17:10,254 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:10,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:10,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1205688877, now seen corresponding path program 2 times [2024-11-21 21:17:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:10,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900904615] [2024-11-21 21:17:10,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:17:10,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:10,362 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-21 21:17:10,362 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:17:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 21:17:10,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:10,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900904615] [2024-11-21 21:17:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900904615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:17:10,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:17:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:17:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289528701] [2024-11-21 21:17:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:17:10,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:17:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:17:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:17:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:17:10,745 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:10,777 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2024-11-21 21:17:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:17:10,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 105 [2024-11-21 21:17:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:10,779 INFO L225 Difference]: With dead ends: 292 [2024-11-21 21:17:10,779 INFO L226 Difference]: Without dead ends: 202 [2024-11-21 21:17:10,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:17:10,780 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 2 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:10,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 442 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:17:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-21 21:17:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-21 21:17:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 186 states have (on average 1.1129032258064515) internal successors, (207), 186 states have internal predecessors, (207), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-21 21:17:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 222 transitions. [2024-11-21 21:17:10,817 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 222 transitions. Word has length 105 [2024-11-21 21:17:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:10,817 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 222 transitions. [2024-11-21 21:17:10,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:17:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 222 transitions. [2024-11-21 21:17:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-21 21:17:10,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:10,818 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:17:10,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-21 21:17:10,818 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2009458730, now seen corresponding path program 1 times [2024-11-21 21:17:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224754559] [2024-11-21 21:17:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-21 21:17:11,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224754559] [2024-11-21 21:17:11,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224754559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:17:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111873365] [2024-11-21 21:17:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:17:11,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:17:11,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:17:11,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:17:11,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 21:17:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:17:12,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-21 21:17:12,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:17:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 21:17:12,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:17:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-21 21:17:12,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111873365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:17:12,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:17:12,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 4] total 16 [2024-11-21 21:17:12,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457603798] [2024-11-21 21:17:12,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:17:12,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-21 21:17:12,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:17:12,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-21 21:17:12,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-21 21:17:12,246 INFO L87 Difference]: Start difference. First operand 202 states and 222 transitions. Second operand has 16 states, 16 states have (on average 9.5) internal successors, (152), 16 states have internal predecessors, (152), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-21 21:17:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:17:12,419 INFO L93 Difference]: Finished difference Result 382 states and 425 transitions. [2024-11-21 21:17:12,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 21:17:12,420 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.5) internal successors, (152), 16 states have internal predecessors, (152), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 107 [2024-11-21 21:17:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:17:12,421 INFO L225 Difference]: With dead ends: 382 [2024-11-21 21:17:12,421 INFO L226 Difference]: Without dead ends: 210 [2024-11-21 21:17:12,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-21 21:17:12,422 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:17:12,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1353 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:17:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-21 21:17:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-21 21:17:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 194 states have (on average 1.1082474226804124) internal successors, (215), 194 states have internal predecessors, (215), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-21 21:17:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 230 transitions. [2024-11-21 21:17:12,438 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 230 transitions. Word has length 107 [2024-11-21 21:17:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:17:12,438 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 230 transitions. [2024-11-21 21:17:12,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.5) internal successors, (152), 16 states have internal predecessors, (152), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-21 21:17:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 230 transitions. [2024-11-21 21:17:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-21 21:17:12,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:17:12,440 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:17:12,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-21 21:17:12,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-11-21 21:17:12,641 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:17:12,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:17:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash -674398748, now seen corresponding path program 2 times [2024-11-21 21:17:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:17:12,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126655773] [2024-11-21 21:17:12,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:17:12,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:17:12,894 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:17:12,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:17:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-21 21:17:13,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:17:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126655773] [2024-11-21 21:17:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126655773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:17:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783647999] [2024-11-21 21:17:13,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:17:13,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:17:13,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:17:13,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:17:13,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process