./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/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-mul-div-a046e57-m [2024-10-12 15:12:57,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:12:57,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:12:57,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:12:57,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:12:57,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:12:57,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:12:57,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:12:57,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:12:57,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:12:57,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:12:57,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:12:57,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:12:57,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:12:57,383 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:12:57,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:12:57,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:12:57,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:12:57,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:12:57,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:12:57,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:12:57,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:12:57,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:12:57,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:12:57,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:12:57,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:12:57,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:12:57,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:12:57,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:12:57,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:12:57,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:12:57,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:12:57,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:12:57,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:12:57,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:12:57,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:12:57,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:12:57,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:12:57,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:12:57,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:12:57,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:12:57,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:12:57,392 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-10-12 15:12:57,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:12:57,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:12:57,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:12:57,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:12:57,638 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:12:57,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2024-10-12 15:12:58,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:12:59,236 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:12:59,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2024-10-12 15:12:59,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9e5070ae/c0d4265fd5b24089ba7e63a84cf8bce7/FLAG5272de4a0 [2024-10-12 15:12:59,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9e5070ae/c0d4265fd5b24089ba7e63a84cf8bce7 [2024-10-12 15:12:59,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:12:59,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:12:59,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:12:59,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:12:59,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:12:59,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:12:59" (1/1) ... [2024-10-12 15:12:59,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1923a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:59, skipping insertion in model container [2024-10-12 15:12:59,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:12:59" (1/1) ... [2024-10-12 15:12:59,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:12:59,961 WARN L248 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-10-12 15:13:00,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:13:00,112 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:13:00,120 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [16] [2024-10-12 15:13:00,122 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [17] [2024-10-12 15:13:00,122 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [175] [2024-10-12 15:13:00,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [181] [2024-10-12 15:13:00,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [402] [2024-10-12 15:13:00,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [455] [2024-10-12 15:13:00,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [474] [2024-10-12 15:13:00,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [475] [2024-10-12 15:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1148] [2024-10-12 15:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1321] [2024-10-12 15:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [1417] [2024-10-12 15:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1418] [2024-10-12 15:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1421] [2024-10-12 15:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1422] [2024-10-12 15:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1423] [2024-10-12 15:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1424] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [1425] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1426] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1433] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1434] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1435] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1436] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1437] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1441] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1442] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1464] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1465] [2024-10-12 15:13:00,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1466] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1473] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1474] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [1475] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [1476] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [1477] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1478] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1479] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1480] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1481] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1482] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1535] [2024-10-12 15:13:00,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1536] [2024-10-12 15:13:00,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [1600] [2024-10-12 15:13:00,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [1601] [2024-10-12 15:13:00,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(INIT,DriverEntry) [1642] [2024-10-12 15:13:00,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_AddDevice) [1643] [2024-10-12 15:13:00,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_CreateClose) [1644] [2024-10-12 15:13:00,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_IoCtl) [1645] [2024-10-12 15:13:00,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_InternIoCtl) [1646] [2024-10-12 15:13:00,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Unload) [1647] [2024-10-12 15:13:00,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_DispatchPassThrough) [1648] [2024-10-12 15:13:00,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_PnP) [1649] [2024-10-12 15:13:00,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Power) [1650] [2024-10-12 15:13:00,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2349] [2024-10-12 15:13:00,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2350] [2024-10-12 15:13:00,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2351] [2024-10-12 15:13:00,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2352] [2024-10-12 15:13:00,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2353] [2024-10-12 15:13:00,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2354] [2024-10-12 15:13:00,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2355] [2024-10-12 15:13:00,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2356] [2024-10-12 15:13:00,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2357] [2024-10-12 15:13:00,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2358] [2024-10-12 15:13:00,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [2359] [2024-10-12 15:13:00,134 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [2360] [2024-10-12 15:13:00,134 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [2361] [2024-10-12 15:13:00,135 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2362] [2024-10-12 15:13:00,136 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2363] [2024-10-12 15:13:00,136 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2364] [2024-10-12 15:13:00,136 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2365] [2024-10-12 15:13:00,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2366] [2024-10-12 15:13:00,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2367] [2024-10-12 15:13:00,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2368] [2024-10-12 15:13:00,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [2369] [2024-10-12 15:13:00,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [2370] [2024-10-12 15:13:00,177 WARN L248 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-10-12 15:13:00,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:13:00,297 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:13:00,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00 WrapperNode [2024-10-12 15:13:00,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:13:00,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:13:00,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:13:00,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:13:00,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,405 INFO L138 Inliner]: procedures = 109, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1142 [2024-10-12 15:13:00,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:13:00,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:13:00,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:13:00,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:13:00,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,496 INFO L175 MemorySlicer]: Split 203 memory accesses to 7 slices as follows [2, 9, 8, 37, 65, 3, 79]. 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, 8, 1, 18, 35, 2, 28]. [2024-10-12 15:13:00,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:13:00,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:13:00,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:13:00,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:13:00,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (1/1) ... [2024-10-12 15:13:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:13:00,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:13:00,604 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-10-12 15:13:00,609 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-10-12 15:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2024-10-12 15:13:00,648 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2024-10-12 15:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-12 15:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-12 15:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-12 15:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-12 15:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-12 15:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-12 15:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-12 15:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-12 15:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-12 15:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-12 15:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-12 15:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-12 15:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-12 15:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-12 15:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-12 15:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-12 15:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-12 15:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-12 15:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-12 15:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-12 15:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-12 15:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 15:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 15:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 15:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 15:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 15:13:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-12 15:13:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-12 15:13:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2024-10-12 15:13:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2024-10-12 15:13:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 15:13:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 15:13:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 15:13:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 15:13:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 15:13:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-12 15:13:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-12 15:13:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2024-10-12 15:13:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2024-10-12 15:13:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2024-10-12 15:13:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2024-10-12 15:13:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 15:13:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:13:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 15:13:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 15:13:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 15:13:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 15:13:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 15:13:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-12 15:13:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-12 15:13:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-12 15:13:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2024-10-12 15:13:00,655 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2024-10-12 15:13:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2024-10-12 15:13:00,656 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2024-10-12 15:13:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 15:13:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 15:13:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 15:13:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 15:13:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-12 15:13:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-12 15:13:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-12 15:13:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 15:13:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:13:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 15:13:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 15:13:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 15:13:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 15:13:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 15:13:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 15:13:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-12 15:13:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-12 15:13:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-12 15:13:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-12 15:13:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-12 15:13:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-12 15:13:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-12 15:13:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:13:00,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:13:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2024-10-12 15:13:00,659 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2024-10-12 15:13:00,958 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:13:00,960 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:13:01,086 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:13:01,124 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2024-10-12 15:13:01,124 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2024-10-12 15:13:01,126 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:13:01,126 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:13:01,132 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:13:01,140 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:13:01,142 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:13:01,146 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:13:01,150 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:13:02,053 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume !false; [2024-10-12 15:13:02,054 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##95: assume false; [2024-10-12 15:13:02,054 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2024-10-12 15:13:02,054 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2024-10-12 15:13:02,054 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !false; [2024-10-12 15:13:02,054 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume false; [2024-10-12 15:13:02,054 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2024-10-12 15:13:02,054 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2024-10-12 15:13:02,054 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2024-10-12 15:13:02,055 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2024-10-12 15:13:02,055 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2024-10-12 15:13:02,055 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2024-10-12 15:13:02,055 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2024-10-12 15:13:02,055 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2024-10-12 15:13:02,126 INFO L? ?]: Removed 283 outVars from TransFormulas that were not future-live. [2024-10-12 15:13:02,127 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:13:02,234 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:13:02,235 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 15:13:02,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:13:02 BoogieIcfgContainer [2024-10-12 15:13:02,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:13:02,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:13:02,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:13:02,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:13:02,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:12:59" (1/3) ... [2024-10-12 15:13:02,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c8819c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:13:02, skipping insertion in model container [2024-10-12 15:13:02,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:13:00" (2/3) ... [2024-10-12 15:13:02,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c8819c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:13:02, skipping insertion in model container [2024-10-12 15:13:02,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:13:02" (3/3) ... [2024-10-12 15:13:02,244 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2024-10-12 15:13:02,259 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:13:02,259 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:13:02,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:13:02,320 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;@2f5279df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:13:02,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:13:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 214 states, 176 states have (on average 1.6988636363636365) internal successors, (299), 194 states have internal predecessors, (299), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 15:13:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 15:13:02,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:02,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:13:02,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:02,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1092688700, now seen corresponding path program 1 times [2024-10-12 15:13:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:02,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94347210] [2024-10-12 15:13:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:13:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94347210] [2024-10-12 15:13:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94347210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:02,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:02,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:13:02,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804767177] [2024-10-12 15:13:02,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:02,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:13:02,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:02,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:13:02,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:13:02,737 INFO L87 Difference]: Start difference. First operand has 214 states, 176 states have (on average 1.6988636363636365) internal successors, (299), 194 states have internal predecessors, (299), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:03,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:03,965 INFO L93 Difference]: Finished difference Result 425 states and 724 transitions. [2024-10-12 15:13:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:13:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 13 [2024-10-12 15:13:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:03,983 INFO L225 Difference]: With dead ends: 425 [2024-10-12 15:13:03,983 INFO L226 Difference]: Without dead ends: 209 [2024-10-12 15:13:03,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:13:03,993 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:03,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 15:13:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-12 15:13:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-12 15:13:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 173 states have (on average 1.606936416184971) internal successors, (278), 189 states have internal predecessors, (278), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 15:13:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2024-10-12 15:13:04,049 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 13 [2024-10-12 15:13:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:04,049 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2024-10-12 15:13:04,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2024-10-12 15:13:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 15:13:04,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:04,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:13:04,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:13:04,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:04,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -834523262, now seen corresponding path program 1 times [2024-10-12 15:13:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:04,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501363158] [2024-10-12 15:13:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:13:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:04,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501363158] [2024-10-12 15:13:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501363158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313752597] [2024-10-12 15:13:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:04,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:13:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:13:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:04,281 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:07,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:07,338 INFO L93 Difference]: Finished difference Result 226 states and 343 transitions. [2024-10-12 15:13:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:13:07,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-10-12 15:13:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:07,342 INFO L225 Difference]: With dead ends: 226 [2024-10-12 15:13:07,342 INFO L226 Difference]: Without dead ends: 209 [2024-10-12 15:13:07,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:07,344 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 0 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:07,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 15:13:07,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-12 15:13:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-12 15:13:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 173 states have (on average 1.6011560693641618) internal successors, (277), 189 states have internal predecessors, (277), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 15:13:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 321 transitions. [2024-10-12 15:13:07,361 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 321 transitions. Word has length 13 [2024-10-12 15:13:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:07,361 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 321 transitions. [2024-10-12 15:13:07,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 321 transitions. [2024-10-12 15:13:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 15:13:07,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:07,363 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] [2024-10-12 15:13:07,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:13:07,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:07,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1051561641, now seen corresponding path program 1 times [2024-10-12 15:13:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:07,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871994786] [2024-10-12 15:13:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:13:07,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871994786] [2024-10-12 15:13:07,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871994786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:07,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:07,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:07,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056205327] [2024-10-12 15:13:07,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:07,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:13:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:07,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:13:07,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:07,547 INFO L87 Difference]: Start difference. First operand 209 states and 321 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:10,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:11,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:12,018 INFO L93 Difference]: Finished difference Result 313 states and 470 transitions. [2024-10-12 15:13:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:13:12,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 20 [2024-10-12 15:13:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:12,020 INFO L225 Difference]: With dead ends: 313 [2024-10-12 15:13:12,020 INFO L226 Difference]: Without dead ends: 262 [2024-10-12 15:13:12,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:12,021 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 237 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:12,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 378 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-12 15:13:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-12 15:13:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 246. [2024-10-12 15:13:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 209 states have (on average 1.5311004784688995) internal successors, (320), 212 states have internal predecessors, (320), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2024-10-12 15:13:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 373 transitions. [2024-10-12 15:13:12,039 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 373 transitions. Word has length 20 [2024-10-12 15:13:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:12,040 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 373 transitions. [2024-10-12 15:13:12,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 373 transitions. [2024-10-12 15:13:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 15:13:12,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:12,042 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] [2024-10-12 15:13:12,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:13:12,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:12,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1408550771, now seen corresponding path program 1 times [2024-10-12 15:13:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992374104] [2024-10-12 15:13:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:13:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992374104] [2024-10-12 15:13:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992374104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:12,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081175466] [2024-10-12 15:13:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:12,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:13:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:13:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:12,215 INFO L87 Difference]: Start difference. First operand 246 states and 373 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:13,116 INFO L93 Difference]: Finished difference Result 371 states and 550 transitions. [2024-10-12 15:13:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:13:13,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 22 [2024-10-12 15:13:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:13,118 INFO L225 Difference]: With dead ends: 371 [2024-10-12 15:13:13,118 INFO L226 Difference]: Without dead ends: 292 [2024-10-12 15:13:13,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:13,120 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 261 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:13,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 364 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:13:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-12 15:13:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 270. [2024-10-12 15:13:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 235 states have (on average 1.5319148936170213) internal successors, (360), 236 states have internal predecessors, (360), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-12 15:13:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 408 transitions. [2024-10-12 15:13:13,132 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 408 transitions. Word has length 22 [2024-10-12 15:13:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:13,132 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 408 transitions. [2024-10-12 15:13:13,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 408 transitions. [2024-10-12 15:13:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 15:13:13,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:13,134 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] [2024-10-12 15:13:13,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:13:13,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:13,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1351311379, now seen corresponding path program 1 times [2024-10-12 15:13:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627881561] [2024-10-12 15:13:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:13:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627881561] [2024-10-12 15:13:13,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627881561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:13,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:13,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418597625] [2024-10-12 15:13:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:13,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:13:13,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:13,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:13:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:13,474 INFO L87 Difference]: Start difference. First operand 270 states and 408 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:16,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:18,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:18,634 INFO L93 Difference]: Finished difference Result 294 states and 435 transitions. [2024-10-12 15:13:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:13:18,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 26 [2024-10-12 15:13:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:18,636 INFO L225 Difference]: With dead ends: 294 [2024-10-12 15:13:18,639 INFO L226 Difference]: Without dead ends: 286 [2024-10-12 15:13:18,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:13:18,641 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 508 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:18,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 304 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-12 15:13:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-12 15:13:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 275. [2024-10-12 15:13:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.525) internal successors, (366), 241 states have internal predecessors, (366), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-12 15:13:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 414 transitions. [2024-10-12 15:13:18,653 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 414 transitions. Word has length 26 [2024-10-12 15:13:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:18,653 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 414 transitions. [2024-10-12 15:13:18,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 414 transitions. [2024-10-12 15:13:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 15:13:18,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:18,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:13:18,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:13:18,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:18,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2053465166, now seen corresponding path program 1 times [2024-10-12 15:13:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:18,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33389725] [2024-10-12 15:13:18,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:13:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:18,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33389725] [2024-10-12 15:13:18,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33389725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:18,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:18,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:13:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037787537] [2024-10-12 15:13:18,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:18,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:13:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:13:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:18,869 INFO L87 Difference]: Start difference. First operand 275 states and 414 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:20,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:21,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:22,187 INFO L93 Difference]: Finished difference Result 530 states and 800 transitions. [2024-10-12 15:13:22,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:13:22,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-12 15:13:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:22,189 INFO L225 Difference]: With dead ends: 530 [2024-10-12 15:13:22,189 INFO L226 Difference]: Without dead ends: 275 [2024-10-12 15:13:22,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:22,190 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:22,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 15:13:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-12 15:13:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-12 15:13:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.5208333333333333) internal successors, (365), 241 states have internal predecessors, (365), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-12 15:13:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 413 transitions. [2024-10-12 15:13:22,203 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 413 transitions. Word has length 28 [2024-10-12 15:13:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:22,203 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 413 transitions. [2024-10-12 15:13:22,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 413 transitions. [2024-10-12 15:13:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 15:13:22,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:22,205 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] [2024-10-12 15:13:22,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:13:22,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:22,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash -229255744, now seen corresponding path program 1 times [2024-10-12 15:13:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767473248] [2024-10-12 15:13:22,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:13:22,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:22,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767473248] [2024-10-12 15:13:22,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767473248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:22,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:22,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:13:22,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40810689] [2024-10-12 15:13:22,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:22,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:13:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:22,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:13:22,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:22,428 INFO L87 Difference]: Start difference. First operand 275 states and 413 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:24,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:25,675 INFO L93 Difference]: Finished difference Result 543 states and 817 transitions. [2024-10-12 15:13:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:13:25,676 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-12 15:13:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:25,677 INFO L225 Difference]: With dead ends: 543 [2024-10-12 15:13:25,677 INFO L226 Difference]: Without dead ends: 275 [2024-10-12 15:13:25,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:25,678 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:25,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 780 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 15:13:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-12 15:13:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-12 15:13:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.5166666666666666) internal successors, (364), 241 states have internal predecessors, (364), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-12 15:13:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 412 transitions. [2024-10-12 15:13:25,693 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 412 transitions. Word has length 35 [2024-10-12 15:13:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:25,694 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 412 transitions. [2024-10-12 15:13:25,694 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 412 transitions. [2024-10-12 15:13:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 15:13:25,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:25,696 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] [2024-10-12 15:13:25,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:13:25,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:25,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1479102024, now seen corresponding path program 1 times [2024-10-12 15:13:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:25,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496092098] [2024-10-12 15:13:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:13:26,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:26,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496092098] [2024-10-12 15:13:26,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496092098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:26,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:26,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:26,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694849505] [2024-10-12 15:13:26,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:26,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:13:26,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:26,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:13:26,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:26,074 INFO L87 Difference]: Start difference. First operand 275 states and 412 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:28,097 INFO L93 Difference]: Finished difference Result 541 states and 814 transitions. [2024-10-12 15:13:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:13:28,098 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-12 15:13:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:28,099 INFO L225 Difference]: With dead ends: 541 [2024-10-12 15:13:28,100 INFO L226 Difference]: Without dead ends: 276 [2024-10-12 15:13:28,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:28,101 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:28,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 15:13:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-12 15:13:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-12 15:13:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.5145228215767634) internal successors, (365), 242 states have internal predecessors, (365), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-12 15:13:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 413 transitions. [2024-10-12 15:13:28,116 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 413 transitions. Word has length 35 [2024-10-12 15:13:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:28,117 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 413 transitions. [2024-10-12 15:13:28,117 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 413 transitions. [2024-10-12 15:13:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 15:13:28,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:28,118 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] [2024-10-12 15:13:28,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:13:28,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:28,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -783745673, now seen corresponding path program 1 times [2024-10-12 15:13:28,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:28,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731129564] [2024-10-12 15:13:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:13:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731129564] [2024-10-12 15:13:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731129564] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:13:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97068835] [2024-10-12 15:13:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:28,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:13:28,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:13:28,661 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-10-12 15:13:28,666 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-10-12 15:13:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:29,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 15:13:29,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:13:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:29,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:13:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97068835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:29,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:13:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 15:13:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019684364] [2024-10-12 15:13:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:29,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:13:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:29,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:13:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:13:29,162 INFO L87 Difference]: Start difference. First operand 276 states and 413 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:31,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:31,597 INFO L93 Difference]: Finished difference Result 279 states and 415 transitions. [2024-10-12 15:13:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:13:31,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-12 15:13:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:31,601 INFO L225 Difference]: With dead ends: 279 [2024-10-12 15:13:31,601 INFO L226 Difference]: Without dead ends: 275 [2024-10-12 15:13:31,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 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-10-12 15:13:31,602 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 19 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:31,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 455 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 15:13:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-12 15:13:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-12 15:13:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 241 states have (on average 1.5062240663900415) internal successors, (363), 241 states have internal predecessors, (363), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-12 15:13:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 410 transitions. [2024-10-12 15:13:31,627 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 410 transitions. Word has length 36 [2024-10-12 15:13:31,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:31,628 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 410 transitions. [2024-10-12 15:13:31,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 410 transitions. [2024-10-12 15:13:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 15:13:31,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:31,629 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] [2024-10-12 15:13:31,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:13:31,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:13:31,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:31,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1945547580, now seen corresponding path program 1 times [2024-10-12 15:13:31,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:31,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546286151] [2024-10-12 15:13:31,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:32,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:32,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546286151] [2024-10-12 15:13:32,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546286151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:32,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:32,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:32,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102128718] [2024-10-12 15:13:32,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:32,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:13:32,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:32,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:13:32,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:32,158 INFO L87 Difference]: Start difference. First operand 275 states and 410 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:33,242 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-10-12 15:13:34,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:34,513 INFO L93 Difference]: Finished difference Result 294 states and 430 transitions. [2024-10-12 15:13:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:13:34,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 35 [2024-10-12 15:13:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:34,514 INFO L225 Difference]: With dead ends: 294 [2024-10-12 15:13:34,514 INFO L226 Difference]: Without dead ends: 286 [2024-10-12 15:13:34,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:13:34,515 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 492 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:34,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 303 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 15:13:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-12 15:13:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2024-10-12 15:13:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 242 states have (on average 1.5041322314049588) internal successors, (364), 242 states have internal predecessors, (364), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-12 15:13:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 411 transitions. [2024-10-12 15:13:34,532 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 411 transitions. Word has length 35 [2024-10-12 15:13:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:34,533 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 411 transitions. [2024-10-12 15:13:34,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 411 transitions. [2024-10-12 15:13:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 15:13:34,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:34,534 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] [2024-10-12 15:13:34,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:13:34,534 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:34,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:34,535 INFO L85 PathProgramCache]: Analyzing trace with hash -55985843, now seen corresponding path program 1 times [2024-10-12 15:13:34,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:34,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165512314] [2024-10-12 15:13:34,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:34,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:34,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:34,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165512314] [2024-10-12 15:13:34,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165512314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:34,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:34,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574008116] [2024-10-12 15:13:34,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:34,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:13:34,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:34,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:13:34,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:34,827 INFO L87 Difference]: Start difference. First operand 276 states and 411 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:37,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:37,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:37,402 INFO L93 Difference]: Finished difference Result 288 states and 422 transitions. [2024-10-12 15:13:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:13:37,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 36 [2024-10-12 15:13:37,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:37,404 INFO L225 Difference]: With dead ends: 288 [2024-10-12 15:13:37,404 INFO L226 Difference]: Without dead ends: 253 [2024-10-12 15:13:37,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:13:37,406 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 478 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:37,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 305 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 15:13:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-12 15:13:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2024-10-12 15:13:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.5251141552511416) internal successors, (334), 224 states have internal predecessors, (334), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-12 15:13:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2024-10-12 15:13:37,418 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 36 [2024-10-12 15:13:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:37,418 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2024-10-12 15:13:37,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2024-10-12 15:13:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 15:13:37,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:37,420 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] [2024-10-12 15:13:37,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:13:37,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:37,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1963528920, now seen corresponding path program 1 times [2024-10-12 15:13:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:37,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440701942] [2024-10-12 15:13:37,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:37,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:37,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:37,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440701942] [2024-10-12 15:13:37,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440701942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:37,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:37,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457610615] [2024-10-12 15:13:37,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:37,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:13:37,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:13:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:37,683 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:41,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:41,888 INFO L93 Difference]: Finished difference Result 298 states and 434 transitions. [2024-10-12 15:13:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:13:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 42 [2024-10-12 15:13:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:41,890 INFO L225 Difference]: With dead ends: 298 [2024-10-12 15:13:41,890 INFO L226 Difference]: Without dead ends: 265 [2024-10-12 15:13:41,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:13:41,891 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 298 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:41,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 411 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 15:13:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-12 15:13:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 250. [2024-10-12 15:13:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.5159817351598173) internal successors, (332), 224 states have internal predecessors, (332), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-12 15:13:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2024-10-12 15:13:41,901 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 42 [2024-10-12 15:13:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:41,901 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2024-10-12 15:13:41,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2024-10-12 15:13:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 15:13:41,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:41,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:13:41,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:13:41,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:41,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:41,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1026971197, now seen corresponding path program 1 times [2024-10-12 15:13:41,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:41,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137258570] [2024-10-12 15:13:41,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:41,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:42,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:42,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137258570] [2024-10-12 15:13:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137258570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:42,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:42,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:42,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17052478] [2024-10-12 15:13:42,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:42,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:13:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:42,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:13:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:42,073 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:44,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:44,206 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2024-10-12 15:13:44,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:13:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 44 [2024-10-12 15:13:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:44,208 INFO L225 Difference]: With dead ends: 274 [2024-10-12 15:13:44,208 INFO L226 Difference]: Without dead ends: 254 [2024-10-12 15:13:44,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:44,209 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 2 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:44,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 502 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 15:13:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-12 15:13:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2024-10-12 15:13:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 221 states have (on average 1.51131221719457) internal successors, (334), 226 states have internal predecessors, (334), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-12 15:13:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2024-10-12 15:13:44,220 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 44 [2024-10-12 15:13:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:44,220 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2024-10-12 15:13:44,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2024-10-12 15:13:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 15:13:44,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:44,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:13:44,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:13:44,222 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:44,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1953433795, now seen corresponding path program 1 times [2024-10-12 15:13:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141918556] [2024-10-12 15:13:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:44,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:44,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141918556] [2024-10-12 15:13:44,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141918556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:44,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:44,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:44,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268753620] [2024-10-12 15:13:44,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:44,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:13:44,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:44,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:13:44,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:44,366 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:46,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:46,469 INFO L93 Difference]: Finished difference Result 264 states and 388 transitions. [2024-10-12 15:13:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:13:46,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 44 [2024-10-12 15:13:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:46,471 INFO L225 Difference]: With dead ends: 264 [2024-10-12 15:13:46,471 INFO L226 Difference]: Without dead ends: 248 [2024-10-12 15:13:46,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:46,471 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 270 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:46,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 243 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 15:13:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-12 15:13:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-10-12 15:13:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 218 states have (on average 1.5045871559633028) internal successors, (328), 222 states have internal predecessors, (328), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-12 15:13:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 366 transitions. [2024-10-12 15:13:46,483 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 366 transitions. Word has length 44 [2024-10-12 15:13:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:46,484 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 366 transitions. [2024-10-12 15:13:46,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 366 transitions. [2024-10-12 15:13:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 15:13:46,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:46,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:13:46,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:13:46,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:46,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 435436015, now seen corresponding path program 1 times [2024-10-12 15:13:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:46,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332350695] [2024-10-12 15:13:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:46,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:46,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332350695] [2024-10-12 15:13:46,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332350695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:46,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:46,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:13:46,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673287572] [2024-10-12 15:13:46,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:46,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:13:46,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:46,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:13:46,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:46,724 INFO L87 Difference]: Start difference. First operand 248 states and 366 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:48,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:50,040 INFO L93 Difference]: Finished difference Result 264 states and 384 transitions. [2024-10-12 15:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:13:50,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-12 15:13:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:50,042 INFO L225 Difference]: With dead ends: 264 [2024-10-12 15:13:50,042 INFO L226 Difference]: Without dead ends: 246 [2024-10-12 15:13:50,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:13:50,042 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 5 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:50,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 722 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 15:13:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-12 15:13:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-12 15:13:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 220 states have internal predecessors, (325), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-12 15:13:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 363 transitions. [2024-10-12 15:13:50,054 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 363 transitions. Word has length 45 [2024-10-12 15:13:50,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:50,055 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 363 transitions. [2024-10-12 15:13:50,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:13:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 363 transitions. [2024-10-12 15:13:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:13:50,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:13:50,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:13:50,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2012317390, now seen corresponding path program 1 times [2024-10-12 15:13:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652959509] [2024-10-12 15:13:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 15:13:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:50,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652959509] [2024-10-12 15:13:50,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652959509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:50,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:50,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:13:50,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37132087] [2024-10-12 15:13:50,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:50,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:13:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:13:50,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:13:50,301 INFO L87 Difference]: Start difference. First operand 246 states and 363 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 15:13:51,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:53,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:53,716 INFO L93 Difference]: Finished difference Result 266 states and 384 transitions. [2024-10-12 15:13:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:13:53,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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 46 [2024-10-12 15:13:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:53,718 INFO L225 Difference]: With dead ends: 266 [2024-10-12 15:13:53,718 INFO L226 Difference]: Without dead ends: 260 [2024-10-12 15:13:53,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:13:53,719 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 314 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:53,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 757 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-12 15:13:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-12 15:13:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2024-10-12 15:13:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 227 states have internal predecessors, (334), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-12 15:13:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 372 transitions. [2024-10-12 15:13:53,731 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 372 transitions. Word has length 46 [2024-10-12 15:13:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:53,731 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 372 transitions. [2024-10-12 15:13:53,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 15:13:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 372 transitions. [2024-10-12 15:13:53,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 15:13:53,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:53,733 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-10-12 15:13:53,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:13:53,733 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:53,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash -502045003, now seen corresponding path program 1 times [2024-10-12 15:13:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584079890] [2024-10-12 15:13:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 15:13:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:53,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:53,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584079890] [2024-10-12 15:13:53,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584079890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:53,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 15:13:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223361550] [2024-10-12 15:13:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:53,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:13:53,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:53,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:13:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:13:53,974 INFO L87 Difference]: Start difference. First operand 254 states and 372 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 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-10-12 15:13:55,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:56,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:58,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:13:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:13:58,336 INFO L93 Difference]: Finished difference Result 291 states and 409 transitions. [2024-10-12 15:13:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:13:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 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-10-12 15:13:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:13:58,338 INFO L225 Difference]: With dead ends: 291 [2024-10-12 15:13:58,338 INFO L226 Difference]: Without dead ends: 245 [2024-10-12 15:13:58,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-10-12 15:13:58,339 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 323 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:13:58,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 648 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-12 15:13:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-12 15:13:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2024-10-12 15:13:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 203 states have (on average 1.4679802955665024) internal successors, (298), 206 states have internal predecessors, (298), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-12 15:13:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 331 transitions. [2024-10-12 15:13:58,350 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 331 transitions. Word has length 47 [2024-10-12 15:13:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:13:58,350 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 331 transitions. [2024-10-12 15:13:58,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 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-10-12 15:13:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 331 transitions. [2024-10-12 15:13:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:13:58,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:13:58,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:13:58,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 15:13:58,351 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:13:58,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:13:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash -252186788, now seen corresponding path program 1 times [2024-10-12 15:13:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:13:58,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577909007] [2024-10-12 15:13:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:13:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:13:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:13:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:13:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:13:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577909007] [2024-10-12 15:13:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577909007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:13:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:13:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:13:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496494292] [2024-10-12 15:13:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:13:58,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:13:58,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:13:58,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:13:58,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:13:58,503 INFO L87 Difference]: Start difference. First operand 231 states and 331 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:14:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:14:00,164 INFO L93 Difference]: Finished difference Result 251 states and 354 transitions. [2024-10-12 15:14:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:14:00,164 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, (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-10-12 15:14:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:14:00,165 INFO L225 Difference]: With dead ends: 251 [2024-10-12 15:14:00,165 INFO L226 Difference]: Without dead ends: 235 [2024-10-12 15:14:00,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:14:00,166 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 2 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:14:00,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 488 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 15:14:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-12 15:14:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2024-10-12 15:14:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 205 states have (on average 1.4634146341463414) internal successors, (300), 208 states have internal predecessors, (300), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-12 15:14:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2024-10-12 15:14:00,177 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 46 [2024-10-12 15:14:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:14:00,177 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2024-10-12 15:14:00,177 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:14:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2024-10-12 15:14:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:14:00,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:14:00,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:14:00,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 15:14:00,178 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:14:00,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:14:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1946054748, now seen corresponding path program 1 times [2024-10-12 15:14:00,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:14:00,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771614535] [2024-10-12 15:14:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:14:00,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:14:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:14:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:14:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771614535] [2024-10-12 15:14:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771614535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:14:00,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:14:00,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:14:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156228414] [2024-10-12 15:14:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:14:00,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:14:00,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:14:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:14:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:14:00,386 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-10-12 15:14:02,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:04,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:14:05,080 INFO L93 Difference]: Finished difference Result 249 states and 351 transitions. [2024-10-12 15:14:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:14:05,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-10-12 15:14:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:14:05,082 INFO L225 Difference]: With dead ends: 249 [2024-10-12 15:14:05,082 INFO L226 Difference]: Without dead ends: 231 [2024-10-12 15:14:05,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:14:05,083 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 5 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:14:05,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 724 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-12 15:14:05,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-12 15:14:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-10-12 15:14:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 203 states have (on average 1.4630541871921183) internal successors, (297), 206 states have internal predecessors, (297), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-12 15:14:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 330 transitions. [2024-10-12 15:14:05,093 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 330 transitions. Word has length 46 [2024-10-12 15:14:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:14:05,093 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 330 transitions. [2024-10-12 15:14:05,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-10-12 15:14:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 330 transitions. [2024-10-12 15:14:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:14:05,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:14:05,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:14:05,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 15:14:05,094 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:14:05,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:14:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash -762720965, now seen corresponding path program 1 times [2024-10-12 15:14:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:14:05,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577052444] [2024-10-12 15:14:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:14:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:14:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:14:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:14:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577052444] [2024-10-12 15:14:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577052444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:14:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:14:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:14:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830641752] [2024-10-12 15:14:05,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:14:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:14:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:14:05,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:14:05,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:14:05,317 INFO L87 Difference]: Start difference. First operand 231 states and 330 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-10-12 15:14:06,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:14:07,824 INFO L93 Difference]: Finished difference Result 292 states and 412 transitions. [2024-10-12 15:14:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:14:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-10-12 15:14:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:14:07,825 INFO L225 Difference]: With dead ends: 292 [2024-10-12 15:14:07,825 INFO L226 Difference]: Without dead ends: 286 [2024-10-12 15:14:07,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:14:07,826 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 300 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:14:07,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 431 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 15:14:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-12 15:14:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 244. [2024-10-12 15:14:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 213 states have (on average 1.4413145539906103) internal successors, (307), 212 states have internal predecessors, (307), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2024-10-12 15:14:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 348 transitions. [2024-10-12 15:14:07,837 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 348 transitions. Word has length 46 [2024-10-12 15:14:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:14:07,838 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 348 transitions. [2024-10-12 15:14:07,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-10-12 15:14:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 348 transitions. [2024-10-12 15:14:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:14:07,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:14:07,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:14:07,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 15:14:07,839 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:14:07,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:14:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1435520571, now seen corresponding path program 1 times [2024-10-12 15:14:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:14:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538407264] [2024-10-12 15:14:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:14:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:14:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:14:08,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:14:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538407264] [2024-10-12 15:14:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538407264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:14:08,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:14:08,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:14:08,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617329945] [2024-10-12 15:14:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:14:08,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:14:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:14:08,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:14:08,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:14:08,075 INFO L87 Difference]: Start difference. First operand 244 states and 348 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-10-12 15:14:09,891 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-10-12 15:14:11,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:14:11,675 INFO L93 Difference]: Finished difference Result 274 states and 387 transitions. [2024-10-12 15:14:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:14:11,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-10-12 15:14:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:14:11,677 INFO L225 Difference]: With dead ends: 274 [2024-10-12 15:14:11,677 INFO L226 Difference]: Without dead ends: 241 [2024-10-12 15:14:11,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:14:11,677 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 279 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:14:11,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 458 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 15:14:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-12 15:14:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 221. [2024-10-12 15:14:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 197 states have internal predecessors, (283), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-12 15:14:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 316 transitions. [2024-10-12 15:14:11,690 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 316 transitions. Word has length 46 [2024-10-12 15:14:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:14:11,690 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 316 transitions. [2024-10-12 15:14:11,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-10-12 15:14:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 316 transitions. [2024-10-12 15:14:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 15:14:11,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:14:11,691 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-10-12 15:14:11,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 15:14:11,691 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:14:11,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:14:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2041543136, now seen corresponding path program 1 times [2024-10-12 15:14:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:14:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527462987] [2024-10-12 15:14:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:14:11,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:14:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:11,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 15:14:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:14:11,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:14:11,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527462987] [2024-10-12 15:14:11,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527462987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:14:11,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:14:11,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:14:11,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059260657] [2024-10-12 15:14:11,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:14:11,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:14:11,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:14:11,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:14:11,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:14:11,979 INFO L87 Difference]: Start difference. First operand 221 states and 316 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) 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-10-12 15:14:13,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:14,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:15,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:17,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:19,267 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-10-12 15:14:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:14:19,611 INFO L93 Difference]: Finished difference Result 268 states and 370 transitions. [2024-10-12 15:14:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:14:19,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) 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-10-12 15:14:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:14:19,612 INFO L225 Difference]: With dead ends: 268 [2024-10-12 15:14:19,612 INFO L226 Difference]: Without dead ends: 221 [2024-10-12 15:14:19,613 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-10-12 15:14:19,613 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 34 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:14:19,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1116 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-10-12 15:14:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-12 15:14:19,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-10-12 15:14:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 193 states have (on average 1.461139896373057) internal successors, (282), 197 states have internal predecessors, (282), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-12 15:14:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2024-10-12 15:14:19,635 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 47 [2024-10-12 15:14:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:14:19,635 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2024-10-12 15:14:19,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) 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-10-12 15:14:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2024-10-12 15:14:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 15:14:19,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:14:19,639 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-10-12 15:14:19,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 15:14:19,640 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:14:19,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:14:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2124326647, now seen corresponding path program 1 times [2024-10-12 15:14:19,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:14:19,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777137944] [2024-10-12 15:14:19,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:14:19,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:14:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:14:19,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:14:19,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777137944] [2024-10-12 15:14:19,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777137944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:14:19,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:14:19,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:14:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340058068] [2024-10-12 15:14:19,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:14:19,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:14:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:14:19,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:14:19,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:14:19,880 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 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-10-12 15:14:22,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:14:22,368 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2024-10-12 15:14:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:14:22,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 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-10-12 15:14:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:14:22,370 INFO L225 Difference]: With dead ends: 269 [2024-10-12 15:14:22,370 INFO L226 Difference]: Without dead ends: 263 [2024-10-12 15:14:22,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:14:22,371 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 282 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:14:22,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 418 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 15:14:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-12 15:14:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 230. [2024-10-12 15:14:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 205 states have internal predecessors, (292), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-12 15:14:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2024-10-12 15:14:22,383 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 47 [2024-10-12 15:14:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:14:22,383 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2024-10-12 15:14:22,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 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-10-12 15:14:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2024-10-12 15:14:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 15:14:22,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:14:22,384 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-10-12 15:14:22,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 15:14:22,385 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:14:22,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:14:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1433169863, now seen corresponding path program 1 times [2024-10-12 15:14:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:14:22,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935948581] [2024-10-12 15:14:22,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:14:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:14:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 15:14:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:14:22,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:14:22,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935948581] [2024-10-12 15:14:22,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935948581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:14:22,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:14:22,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:14:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258434629] [2024-10-12 15:14:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:14:22,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:14:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:14:22,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:14:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:14:22,632 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 15:14:23,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:24,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:29,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:32,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 15:14:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:14:32,395 INFO L93 Difference]: Finished difference Result 277 states and 378 transitions. [2024-10-12 15:14:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:14:32,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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 48 [2024-10-12 15:14:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:14:32,396 INFO L225 Difference]: With dead ends: 277 [2024-10-12 15:14:32,396 INFO L226 Difference]: Without dead ends: 230 [2024-10-12 15:14:32,397 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-10-12 15:14:32,397 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 34 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:14:32,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1113 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 244 Invalid, 1 Unknown, 0 Unchecked, 9.7s Time] [2024-10-12 15:14:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-12 15:14:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-10-12 15:14:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 202 states have (on average 1.4306930693069306) internal successors, (289), 205 states have internal predecessors, (289), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-12 15:14:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 322 transitions. [2024-10-12 15:14:32,410 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 322 transitions. Word has length 48 [2024-10-12 15:14:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:14:32,410 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 322 transitions. [2024-10-12 15:14:32,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 15:14:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 322 transitions. [2024-10-12 15:14:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 15:14:32,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:14:32,412 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] [2024-10-12 15:14:32,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 15:14:32,412 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:14:32,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:14:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash 97286813, now seen corresponding path program 1 times [2024-10-12 15:14:32,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:14:32,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675861309] [2024-10-12 15:14:32,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:14:32,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:14:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:32,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 15:14:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:32,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 15:14:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:14:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:14:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:14:32,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675861309] [2024-10-12 15:14:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675861309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:14:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:14:32,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 15:14:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140706535] [2024-10-12 15:14:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:14:32,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:14:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:14:32,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:14:32,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:14:32,582 INFO L87 Difference]: Start difference. First operand 230 states and 322 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)