./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:02:48,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:02:48,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:02:48,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:02:48,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:02:48,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:02:48,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:02:48,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:02:48,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:02:48,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:02:48,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:02:48,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:02:48,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:02:48,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:02:48,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:02:48,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:02:48,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:02:48,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:02:48,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:02:48,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:02:48,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:02:48,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:02:48,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:02:48,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:02:48,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:02:48,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:02:48,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:02:48,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:02:48,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:02:48,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:02:48,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:02:48,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:02:48,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:02:48,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:02:48,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:02:48,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:02:48,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:02:48,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:02:48,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:02:48,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:02:48,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:02:48,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:02:48,596 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 [2024-11-16 03:02:48,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:02:48,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:02:48,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:02:48,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:02:48,873 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:02:48,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2024-11-16 03:02:50,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:02:50,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:02:50,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2024-11-16 03:02:50,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b833d50b/888af4083b09493e83fd3ee999fd617f/FLAG110db0d50 [2024-11-16 03:02:50,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b833d50b/888af4083b09493e83fd3ee999fd617f [2024-11-16 03:02:50,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:02:50,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:02:50,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:02:50,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:02:50,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:02:50,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:02:50" (1/1) ... [2024-11-16 03:02:50,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7938312f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:50, skipping insertion in model container [2024-11-16 03:02:50,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:02:50" (1/1) ... [2024-11-16 03:02:50,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:02:51,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2024-11-16 03:02:51,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:02:51,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:02:51,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [16] [2024-11-16 03:02:51,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [17] [2024-11-16 03:02:51,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [175] [2024-11-16 03:02:51,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [181] [2024-11-16 03:02:51,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [402] [2024-11-16 03:02:51,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [455] [2024-11-16 03:02:51,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [474] [2024-11-16 03:02:51,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [475] [2024-11-16 03:02:51,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1148] [2024-11-16 03:02:51,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1321] [2024-11-16 03:02:51,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [1417] [2024-11-16 03:02:51,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1418] [2024-11-16 03:02:51,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1421] [2024-11-16 03:02:51,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1422] [2024-11-16 03:02:51,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1423] [2024-11-16 03:02:51,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1424] [2024-11-16 03:02:51,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [1425] [2024-11-16 03:02:51,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1426] [2024-11-16 03:02:51,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1433] [2024-11-16 03:02:51,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1434] [2024-11-16 03:02:51,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1435] [2024-11-16 03:02:51,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1436] [2024-11-16 03:02:51,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1437] [2024-11-16 03:02:51,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1441] [2024-11-16 03:02:51,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1442] [2024-11-16 03:02:51,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1464] [2024-11-16 03:02:51,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1465] [2024-11-16 03:02:51,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1466] [2024-11-16 03:02:51,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1473] [2024-11-16 03:02:51,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1474] [2024-11-16 03:02:51,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [1475] [2024-11-16 03:02:51,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [1476] [2024-11-16 03:02:51,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [1477] [2024-11-16 03:02:51,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1478] [2024-11-16 03:02:51,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1479] [2024-11-16 03:02:51,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1480] [2024-11-16 03:02:51,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1481] [2024-11-16 03:02:51,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1482] [2024-11-16 03:02:51,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1535] [2024-11-16 03:02:51,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1536] [2024-11-16 03:02:51,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [1600] [2024-11-16 03:02:51,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [1601] [2024-11-16 03:02:51,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(INIT,DriverEntry) [1642] [2024-11-16 03:02:51,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_AddDevice) [1643] [2024-11-16 03:02:51,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_CreateClose) [1644] [2024-11-16 03:02:51,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_IoCtl) [1645] [2024-11-16 03:02:51,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_InternIoCtl) [1646] [2024-11-16 03:02:51,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Unload) [1647] [2024-11-16 03:02:51,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_DispatchPassThrough) [1648] [2024-11-16 03:02:51,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_PnP) [1649] [2024-11-16 03:02:51,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Power) [1650] [2024-11-16 03:02:51,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2349] [2024-11-16 03:02:51,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2350] [2024-11-16 03:02:51,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2351] [2024-11-16 03:02:51,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2352] [2024-11-16 03:02:51,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2353] [2024-11-16 03:02:51,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2354] [2024-11-16 03:02:51,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2355] [2024-11-16 03:02:51,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2356] [2024-11-16 03:02:51,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2357] [2024-11-16 03:02:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2358] [2024-11-16 03:02:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [2359] [2024-11-16 03:02:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [2360] [2024-11-16 03:02:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [2361] [2024-11-16 03:02:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2362] [2024-11-16 03:02:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2363] [2024-11-16 03:02:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2364] [2024-11-16 03:02:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2365] [2024-11-16 03:02:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2366] [2024-11-16 03:02:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2367] [2024-11-16 03:02:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2368] [2024-11-16 03:02:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [2369] [2024-11-16 03:02:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [2370] [2024-11-16 03:02:51,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2024-11-16 03:02:51,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:02:51,698 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:02:51,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51 WrapperNode [2024-11-16 03:02:51,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:02:51,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:02:51,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:02:51,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:02:51,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,798 INFO L138 Inliner]: procedures = 109, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1142 [2024-11-16 03:02:51,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:02:51,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:02:51,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:02:51,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:02:51,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,886 INFO L175 MemorySlicer]: Split 203 memory accesses to 7 slices as follows [2, 8, 79, 3, 37, 9, 65]. 39 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 92 writes are split as follows [0, 1, 28, 2, 18, 8, 35]. [2024-11-16 03:02:51,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:02:51,989 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:02:51,989 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:02:51,989 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:02:51,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (1/1) ... [2024-11-16 03:02:51,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:02:52,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:02:52,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:02:52,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:02:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2024-11-16 03:02:52,082 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2024-11-16 03:02:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-16 03:02:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-16 03:02:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-16 03:02:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-16 03:02:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-16 03:02:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-16 03:02:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-16 03:02:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-16 03:02:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-16 03:02:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-11-16 03:02:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-11-16 03:02:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-11-16 03:02:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-11-16 03:02:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-11-16 03:02:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-16 03:02:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-16 03:02:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-16 03:02:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-16 03:02:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-16 03:02:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-16 03:02:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-16 03:02:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 03:02:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 03:02:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 03:02:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 03:02:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 03:02:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-16 03:02:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-16 03:02:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2024-11-16 03:02:52,086 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2024-11-16 03:02:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 03:02:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 03:02:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 03:02:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 03:02:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 03:02:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-16 03:02:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-16 03:02:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2024-11-16 03:02:52,087 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2024-11-16 03:02:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2024-11-16 03:02:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-16 03:02:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2024-11-16 03:02:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2024-11-16 03:02:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2024-11-16 03:02:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2024-11-16 03:02:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 03:02:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 03:02:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 03:02:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-16 03:02:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-16 03:02:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-16 03:02:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-16 03:02:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 03:02:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:02:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 03:02:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 03:02:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 03:02:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 03:02:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-16 03:02:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-16 03:02:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-11-16 03:02:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-11-16 03:02:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-11-16 03:02:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-11-16 03:02:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-11-16 03:02:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-11-16 03:02:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-11-16 03:02:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:02:52,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:02:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2024-11-16 03:02:52,096 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2024-11-16 03:02:52,465 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:02:52,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:02:52,604 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: havoc InterlockedDecrement_#t~mem15#1;havoc InterlockedDecrement_#t~pre16#1; [2024-11-16 03:02:52,604 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: havoc InterlockedIncrement_#t~mem13#1;havoc InterlockedIncrement_#t~pre14#1; [2024-11-16 03:02:52,659 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: assume false; [2024-11-16 03:02:52,659 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: assume !false; [2024-11-16 03:02:54,685 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2711: assume false; [2024-11-16 03:02:54,686 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2711: assume !false; [2024-11-16 03:02:54,686 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3422: assume false; [2024-11-16 03:02:54,686 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3422: assume !false; [2024-11-16 03:02:54,686 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint IoAttachDeviceToDeviceStack_switch_6_break#1: assume true; [2024-11-16 03:02:54,687 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812: assume false; [2024-11-16 03:02:54,687 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812: assume !false; [2024-11-16 03:02:54,687 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint IoCreateDevice_switch_9_break#1: assume true; [2024-11-16 03:02:54,687 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1974: call ULTIMATE.dealloc(KbFilter_PnP_~#event~1#1.base, KbFilter_PnP_~#event~1#1.offset);havoc KbFilter_PnP_~#event~1#1.base, KbFilter_PnP_~#event~1#1.offset; [2024-11-16 03:02:54,687 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: call ULTIMATE.dealloc(KbFilter_Power_~#powerState~0#1.base, KbFilter_Power_~#powerState~0#1.offset);havoc KbFilter_Power_~#powerState~0#1.base, KbFilter_Power_~#powerState~0#1.offset; [2024-11-16 03:02:54,688 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#u~0#1.base, main_~#u~0#1.offset);havoc main_~#u~0#1.base, main_~#u~0#1.offset;call ULTIMATE.dealloc(main_~#irp~0#1.base, main_~#irp~0#1.offset);havoc main_~#irp~0#1.base, main_~#irp~0#1.offset;call ULTIMATE.dealloc(main_~#devext~0#1.base, main_~#devext~0#1.offset);havoc main_~#devext~0#1.base, main_~#devext~0#1.offset;call ULTIMATE.dealloc(main_~#devobj~0#1.base, main_~#devobj~0#1.offset);havoc main_~#devobj~0#1.base, main_~#devobj~0#1.offset;call ULTIMATE.dealloc(main_~#ext~0#1.base, main_~#ext~0#1.offset);havoc main_~#ext~0#1.base, main_~#ext~0#1.offset;call ULTIMATE.dealloc(main_~#hookkb~0#1.base, main_~#hookkb~0#1.offset);havoc main_~#hookkb~0#1.base, main_~#hookkb~0#1.offset;call ULTIMATE.dealloc(main_~#stack~0#1.base, main_~#stack~0#1.offset);havoc main_~#stack~0#1.base, main_~#stack~0#1.offset; [2024-11-16 03:02:54,688 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3265: assume false; [2024-11-16 03:02:54,688 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3265: assume !false; [2024-11-16 03:02:54,688 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint KeWaitForSingleObject_switch_17_break#1: assume true; [2024-11-16 03:02:54,689 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1715: call ULTIMATE.dealloc(KbFilter_AddDevice_~#device~0#1.base, KbFilter_AddDevice_~#device~0#1.offset);havoc KbFilter_AddDevice_~#device~0#1.base, KbFilter_AddDevice_~#device~0#1.offset; [2024-11-16 03:02:54,689 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume false; [2024-11-16 03:02:54,689 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume !false; [2024-11-16 03:02:54,689 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2229: assume false; [2024-11-16 03:02:54,689 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2229: assume !false; [2024-11-16 03:02:54,689 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048: assume false; [2024-11-16 03:02:54,689 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048: assume !false; [2024-11-16 03:02:54,780 INFO L? ?]: Removed 283 outVars from TransFormulas that were not future-live. [2024-11-16 03:02:54,781 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:02:54,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:02:54,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:02:54,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:02:54 BoogieIcfgContainer [2024-11-16 03:02:54,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:02:54,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:02:54,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:02:54,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:02:54,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:02:50" (1/3) ... [2024-11-16 03:02:54,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d67a5a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:02:54, skipping insertion in model container [2024-11-16 03:02:54,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:02:51" (2/3) ... [2024-11-16 03:02:54,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d67a5a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:02:54, skipping insertion in model container [2024-11-16 03:02:54,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:02:54" (3/3) ... [2024-11-16 03:02:54,822 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2024-11-16 03:02:54,838 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:02:54,838 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:02:54,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:02:54,940 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;@73c0e0d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:02:54,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:02:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 261 states have (on average 1.471264367816092) internal successors, (384), 279 states have internal predecessors, (384), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 03:02:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 03:02:54,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:54,959 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-11-16 03:02:54,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash -919284245, now seen corresponding path program 1 times [2024-11-16 03:02:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:02:54,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431479143] [2024-11-16 03:02:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:02:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:02:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:02:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431479143] [2024-11-16 03:02:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431479143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:55,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:55,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:02:55,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573245690] [2024-11-16 03:02:55,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:55,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 03:02:55,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:02:55,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 03:02:55,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 03:02:55,590 INFO L87 Difference]: Start difference. First operand has 299 states, 261 states have (on average 1.471264367816092) internal successors, (384), 279 states have internal predecessors, (384), 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 9.5) internal successors, (19), 2 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-11-16 03:02:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:55,675 INFO L93 Difference]: Finished difference Result 591 states and 890 transitions. [2024-11-16 03:02:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 03:02:55,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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-11-16 03:02:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:55,690 INFO L225 Difference]: With dead ends: 591 [2024-11-16 03:02:55,691 INFO L226 Difference]: Without dead ends: 290 [2024-11-16 03:02:55,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 03:02:55,703 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:55,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:02:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-16 03:02:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-11-16 03:02:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 254 states have (on average 1.4133858267716535) internal successors, (359), 270 states have internal predecessors, (359), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 03:02:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 403 transitions. [2024-11-16 03:02:55,773 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 403 transitions. Word has length 20 [2024-11-16 03:02:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:55,773 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 403 transitions. [2024-11-16 03:02:55,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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-11-16 03:02:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 403 transitions. [2024-11-16 03:02:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 03:02:55,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:55,775 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-11-16 03:02:55,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:02:55,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:55,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:55,776 INFO L85 PathProgramCache]: Analyzing trace with hash 434025452, now seen corresponding path program 1 times [2024-11-16 03:02:55,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:02:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572871143] [2024-11-16 03:02:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:02:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:02:56,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:02:56,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572871143] [2024-11-16 03:02:56,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572871143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:56,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:56,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:02:56,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698489383] [2024-11-16 03:02:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:56,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:02:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:02:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:02:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:02:56,132 INFO L87 Difference]: Start difference. First operand 290 states and 403 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-11-16 03:02:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:56,856 INFO L93 Difference]: Finished difference Result 311 states and 428 transitions. [2024-11-16 03:02:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:02:56,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-11-16 03:02:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:56,859 INFO L225 Difference]: With dead ends: 311 [2024-11-16 03:02:56,859 INFO L226 Difference]: Without dead ends: 290 [2024-11-16 03:02:56,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:02:56,864 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 0 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:56,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1174 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:02:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-16 03:02:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-11-16 03:02:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 254 states have (on average 1.4094488188976377) internal successors, (358), 270 states have internal predecessors, (358), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 03:02:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 402 transitions. [2024-11-16 03:02:56,887 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 402 transitions. Word has length 20 [2024-11-16 03:02:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:56,887 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 402 transitions. [2024-11-16 03:02:56,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-11-16 03:02:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 402 transitions. [2024-11-16 03:02:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 03:02:56,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:56,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:56,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:02:56,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2035564873, now seen corresponding path program 1 times [2024-11-16 03:02:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:02:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561168252] [2024-11-16 03:02:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:02:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:02:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:02:57,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561168252] [2024-11-16 03:02:57,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561168252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:57,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:57,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:02:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416234579] [2024-11-16 03:02:57,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:57,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:02:57,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:02:57,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:02:57,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:02:57,208 INFO L87 Difference]: Start difference. First operand 290 states and 402 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:02:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:57,258 INFO L93 Difference]: Finished difference Result 568 states and 790 transitions. [2024-11-16 03:02:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:02:57,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-16 03:02:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:57,262 INFO L225 Difference]: With dead ends: 568 [2024-11-16 03:02:57,262 INFO L226 Difference]: Without dead ends: 306 [2024-11-16 03:02:57,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:02:57,264 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 19 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:57,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1180 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:02:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-16 03:02:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 292. [2024-11-16 03:02:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 256 states have (on average 1.40625) internal successors, (360), 272 states have internal predecessors, (360), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 03:02:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 404 transitions. [2024-11-16 03:02:57,288 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 404 transitions. Word has length 30 [2024-11-16 03:02:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:57,288 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 404 transitions. [2024-11-16 03:02:57,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:02:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 404 transitions. [2024-11-16 03:02:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 03:02:57,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:57,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:57,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:02:57,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:57,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1006565510, now seen corresponding path program 1 times [2024-11-16 03:02:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:02:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737171699] [2024-11-16 03:02:57,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:57,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:02:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:02:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:02:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737171699] [2024-11-16 03:02:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737171699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:02:57,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384808838] [2024-11-16 03:02:57,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:57,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:02:57,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:02:57,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:02:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:02:57,604 INFO L87 Difference]: Start difference. First operand 292 states and 404 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:02:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:58,161 INFO L93 Difference]: Finished difference Result 426 states and 583 transitions. [2024-11-16 03:02:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:02:58,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-16 03:02:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:58,164 INFO L225 Difference]: With dead ends: 426 [2024-11-16 03:02:58,165 INFO L226 Difference]: Without dead ends: 365 [2024-11-16 03:02:58,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:02:58,167 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 306 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:58,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 551 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:02:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-16 03:02:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 345. [2024-11-16 03:02:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 311 states have internal predecessors, (419), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2024-11-16 03:02:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 472 transitions. [2024-11-16 03:02:58,195 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 472 transitions. Word has length 30 [2024-11-16 03:02:58,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:58,196 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 472 transitions. [2024-11-16 03:02:58,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:02:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 472 transitions. [2024-11-16 03:02:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 03:02:58,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:58,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:58,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:02:58,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:58,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1506261243, now seen corresponding path program 1 times [2024-11-16 03:02:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:02:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990988242] [2024-11-16 03:02:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:02:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:02:58,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:02:58,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990988242] [2024-11-16 03:02:58,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990988242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:58,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:58,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:02:58,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791540140] [2024-11-16 03:02:58,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:58,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:02:58,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:02:58,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:02:58,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:02:58,428 INFO L87 Difference]: Start difference. First operand 345 states and 472 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:02:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:58,480 INFO L93 Difference]: Finished difference Result 517 states and 696 transitions. [2024-11-16 03:02:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:02:58,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-16 03:02:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:58,484 INFO L225 Difference]: With dead ends: 517 [2024-11-16 03:02:58,484 INFO L226 Difference]: Without dead ends: 410 [2024-11-16 03:02:58,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:02:58,486 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 334 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:58,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 502 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:02:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-16 03:02:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 382. [2024-11-16 03:02:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 347 states have (on average 1.3602305475504324) internal successors, (472), 348 states have internal predecessors, (472), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-11-16 03:02:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 520 transitions. [2024-11-16 03:02:58,507 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 520 transitions. Word has length 32 [2024-11-16 03:02:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:58,508 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 520 transitions. [2024-11-16 03:02:58,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:02:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 520 transitions. [2024-11-16 03:02:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 03:02:58,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:58,510 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] [2024-11-16 03:02:58,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:02:58,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:58,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash -293738751, now seen corresponding path program 1 times [2024-11-16 03:02:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:02:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622105314] [2024-11-16 03:02:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:02:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:02:58,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:02:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622105314] [2024-11-16 03:02:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622105314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:02:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511957167] [2024-11-16 03:02:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:58,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:02:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:02:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:02:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:02:58,779 INFO L87 Difference]: Start difference. First operand 382 states and 520 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:02:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:59,355 INFO L93 Difference]: Finished difference Result 386 states and 523 transitions. [2024-11-16 03:02:59,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:02:59,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-16 03:02:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:59,358 INFO L225 Difference]: With dead ends: 386 [2024-11-16 03:02:59,358 INFO L226 Difference]: Without dead ends: 381 [2024-11-16 03:02:59,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:02:59,359 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 25 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:59,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 669 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:02:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-16 03:02:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-16 03:02:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 347 states have (on average 1.3544668587896254) internal successors, (470), 347 states have internal predecessors, (470), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-11-16 03:02:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 517 transitions. [2024-11-16 03:02:59,371 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 517 transitions. Word has length 40 [2024-11-16 03:02:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:59,371 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 517 transitions. [2024-11-16 03:02:59,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:02:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 517 transitions. [2024-11-16 03:02:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 03:02:59,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:59,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:59,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:02:59,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:59,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1115888370, now seen corresponding path program 1 times [2024-11-16 03:02:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:02:59,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762070123] [2024-11-16 03:02:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:02:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:02:59,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:02:59,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762070123] [2024-11-16 03:02:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762070123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:59,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:59,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:02:59,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528630080] [2024-11-16 03:02:59,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:59,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:02:59,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:02:59,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:02:59,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:02:59,684 INFO L87 Difference]: Start difference. First operand 381 states and 517 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:03:01,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 03:03:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:01,699 INFO L93 Difference]: Finished difference Result 411 states and 550 transitions. [2024-11-16 03:03:01,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:03:01,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 37 [2024-11-16 03:03:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:01,702 INFO L225 Difference]: With dead ends: 411 [2024-11-16 03:03:01,704 INFO L226 Difference]: Without dead ends: 401 [2024-11-16 03:03:01,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:03:01,706 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 660 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:01,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 468 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-16 03:03:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-16 03:03:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 388. [2024-11-16 03:03:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 354 states have (on average 1.3502824858757063) internal successors, (478), 354 states have internal predecessors, (478), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-11-16 03:03:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 525 transitions. [2024-11-16 03:03:01,725 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 525 transitions. Word has length 37 [2024-11-16 03:03:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:01,725 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 525 transitions. [2024-11-16 03:03:01,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:03:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 525 transitions. [2024-11-16 03:03:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 03:03:01,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:01,727 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] [2024-11-16 03:03:01,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:03:01,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:01,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash -576353720, now seen corresponding path program 1 times [2024-11-16 03:03:01,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:01,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372759792] [2024-11-16 03:03:01,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:01,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:02,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372759792] [2024-11-16 03:03:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372759792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:02,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:02,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:03:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806585625] [2024-11-16 03:03:02,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:02,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:03:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:03:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:03:02,026 INFO L87 Difference]: Start difference. First operand 388 states and 525 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:03:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:02,597 INFO L93 Difference]: Finished difference Result 411 states and 549 transitions. [2024-11-16 03:03:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:03:02,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 38 [2024-11-16 03:03:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:02,600 INFO L225 Difference]: With dead ends: 411 [2024-11-16 03:03:02,601 INFO L226 Difference]: Without dead ends: 401 [2024-11-16 03:03:02,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:03:02,603 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 657 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:02,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 471 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:03:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-16 03:03:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2024-11-16 03:03:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 355 states have (on average 1.3492957746478873) internal successors, (479), 355 states have internal predecessors, (479), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-11-16 03:03:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 526 transitions. [2024-11-16 03:03:02,626 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 526 transitions. Word has length 38 [2024-11-16 03:03:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:02,626 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 526 transitions. [2024-11-16 03:03:02,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:03:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 526 transitions. [2024-11-16 03:03:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 03:03:02,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:02,628 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] [2024-11-16 03:03:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:03:02,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:02,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash 601807499, now seen corresponding path program 1 times [2024-11-16 03:03:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:02,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884946360] [2024-11-16 03:03:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:02,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:02,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884946360] [2024-11-16 03:03:02,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884946360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:02,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:02,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:03:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616071237] [2024-11-16 03:03:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:02,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:03:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:02,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:03:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:03:02,905 INFO L87 Difference]: Start difference. First operand 389 states and 526 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:03:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:03,086 INFO L93 Difference]: Finished difference Result 404 states and 540 transitions. [2024-11-16 03:03:03,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:03:03,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 39 [2024-11-16 03:03:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:03,088 INFO L225 Difference]: With dead ends: 404 [2024-11-16 03:03:03,090 INFO L226 Difference]: Without dead ends: 357 [2024-11-16 03:03:03,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:03:03,092 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 644 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:03,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 470 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:03:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-16 03:03:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2024-11-16 03:03:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 322 states have (on average 1.3633540372670807) internal successors, (439), 327 states have internal predecessors, (439), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-16 03:03:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 478 transitions. [2024-11-16 03:03:03,109 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 478 transitions. Word has length 39 [2024-11-16 03:03:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:03,109 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 478 transitions. [2024-11-16 03:03:03,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:03:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 478 transitions. [2024-11-16 03:03:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 03:03:03,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:03,111 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] [2024-11-16 03:03:03,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:03:03,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash 622054220, now seen corresponding path program 1 times [2024-11-16 03:03:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:03,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447519831] [2024-11-16 03:03:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:03,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:03:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:03,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447519831] [2024-11-16 03:03:03,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447519831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:03,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:03,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:03,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868095984] [2024-11-16 03:03:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:03,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:03,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:03,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:03,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:03,508 INFO L87 Difference]: Start difference. First operand 353 states and 478 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:05,607 INFO L93 Difference]: Finished difference Result 387 states and 517 transitions. [2024-11-16 03:03:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:03:05,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 50 [2024-11-16 03:03:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:05,609 INFO L225 Difference]: With dead ends: 387 [2024-11-16 03:03:05,610 INFO L226 Difference]: Without dead ends: 377 [2024-11-16 03:03:05,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:05,610 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 435 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:05,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1176 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-16 03:03:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-16 03:03:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2024-11-16 03:03:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 336 states have (on average 1.3571428571428572) internal successors, (456), 340 states have internal predecessors, (456), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-16 03:03:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 495 transitions. [2024-11-16 03:03:05,627 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 495 transitions. Word has length 50 [2024-11-16 03:03:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:05,627 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 495 transitions. [2024-11-16 03:03:05,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 495 transitions. [2024-11-16 03:03:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 03:03:05,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:05,630 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-11-16 03:03:05,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:03:05,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:05,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1760259018, now seen corresponding path program 1 times [2024-11-16 03:03:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:05,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730531526] [2024-11-16 03:03:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:03:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:06,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:06,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730531526] [2024-11-16 03:03:06,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730531526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:06,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800842046] [2024-11-16 03:03:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:06,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:06,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:06,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:06,093 INFO L87 Difference]: Start difference. First operand 367 states and 495 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:07,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 03:03:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:08,867 INFO L93 Difference]: Finished difference Result 387 states and 516 transitions. [2024-11-16 03:03:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:03:08,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 51 [2024-11-16 03:03:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:08,870 INFO L225 Difference]: With dead ends: 387 [2024-11-16 03:03:08,870 INFO L226 Difference]: Without dead ends: 377 [2024-11-16 03:03:08,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:08,870 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 432 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:08,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1177 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 03:03:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-16 03:03:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2024-11-16 03:03:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 337 states have (on average 1.3560830860534125) internal successors, (457), 341 states have internal predecessors, (457), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-16 03:03:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 496 transitions. [2024-11-16 03:03:08,888 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 496 transitions. Word has length 51 [2024-11-16 03:03:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:08,889 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 496 transitions. [2024-11-16 03:03:08,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 496 transitions. [2024-11-16 03:03:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 03:03:08,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:08,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:08,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:03:08,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:08,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 22358345, now seen corresponding path program 1 times [2024-11-16 03:03:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:08,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013154694] [2024-11-16 03:03:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:08,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:09,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:03:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:09,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013154694] [2024-11-16 03:03:09,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013154694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:09,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:09,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:03:09,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622361042] [2024-11-16 03:03:09,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:09,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:03:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:09,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:03:09,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:03:09,110 INFO L87 Difference]: Start difference. First operand 368 states and 496 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:10,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 03:03:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:10,592 INFO L93 Difference]: Finished difference Result 391 states and 523 transitions. [2024-11-16 03:03:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:03:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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 52 [2024-11-16 03:03:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:10,594 INFO L225 Difference]: With dead ends: 391 [2024-11-16 03:03:10,594 INFO L226 Difference]: Without dead ends: 362 [2024-11-16 03:03:10,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:03:10,595 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 398 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:10,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 601 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 03:03:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-16 03:03:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-16 03:03:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 332 states have (on average 1.3463855421686748) internal successors, (447), 335 states have internal predecessors, (447), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-16 03:03:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 485 transitions. [2024-11-16 03:03:10,608 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 485 transitions. Word has length 52 [2024-11-16 03:03:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:10,609 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 485 transitions. [2024-11-16 03:03:10,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 485 transitions. [2024-11-16 03:03:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 03:03:10,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:10,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:10,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:03:10,610 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:10,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:10,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1590681489, now seen corresponding path program 1 times [2024-11-16 03:03:10,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:10,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034108656] [2024-11-16 03:03:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:10,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 03:03:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:10,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:10,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034108656] [2024-11-16 03:03:10,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034108656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:10,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:10,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 03:03:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335509779] [2024-11-16 03:03:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:10,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:03:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:10,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:03:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:03:10,863 INFO L87 Difference]: Start difference. First operand 362 states and 485 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:12,078 INFO L93 Difference]: Finished difference Result 411 states and 532 transitions. [2024-11-16 03:03:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:03:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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 53 [2024-11-16 03:03:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:12,080 INFO L225 Difference]: With dead ends: 411 [2024-11-16 03:03:12,081 INFO L226 Difference]: Without dead ends: 349 [2024-11-16 03:03:12,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:03:12,082 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 422 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:12,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 997 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 03:03:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-16 03:03:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 330. [2024-11-16 03:03:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 302 states have (on average 1.3311258278145695) internal successors, (402), 305 states have internal predecessors, (402), 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-11-16 03:03:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 435 transitions. [2024-11-16 03:03:12,098 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 435 transitions. Word has length 53 [2024-11-16 03:03:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:12,098 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 435 transitions. [2024-11-16 03:03:12,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 435 transitions. [2024-11-16 03:03:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 03:03:12,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:12,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:12,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:03:12,100 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:12,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 714627479, now seen corresponding path program 1 times [2024-11-16 03:03:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:12,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532113667] [2024-11-16 03:03:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:12,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:03:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532113667] [2024-11-16 03:03:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532113667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:12,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 03:03:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072683069] [2024-11-16 03:03:12,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:12,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:03:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:12,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:03:12,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:03:12,324 INFO L87 Difference]: Start difference. First operand 330 states and 435 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:13,487 INFO L93 Difference]: Finished difference Result 630 states and 832 transitions. [2024-11-16 03:03:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:03:13,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2024-11-16 03:03:13,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:13,489 INFO L225 Difference]: With dead ends: 630 [2024-11-16 03:03:13,491 INFO L226 Difference]: Without dead ends: 330 [2024-11-16 03:03:13,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:03:13,492 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 42 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:13,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1276 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 03:03:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-16 03:03:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2024-11-16 03:03:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 300 states have (on average 1.33) internal successors, (399), 303 states have internal predecessors, (399), 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-11-16 03:03:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 432 transitions. [2024-11-16 03:03:13,507 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 432 transitions. Word has length 53 [2024-11-16 03:03:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:13,508 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 432 transitions. [2024-11-16 03:03:13,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 432 transitions. [2024-11-16 03:03:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 03:03:13,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:13,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:13,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 03:03:13,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:13,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1562674631, now seen corresponding path program 1 times [2024-11-16 03:03:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:13,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060004833] [2024-11-16 03:03:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 03:03:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060004833] [2024-11-16 03:03:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060004833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466868407] [2024-11-16 03:03:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:13,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:13,916 INFO L87 Difference]: Start difference. First operand 328 states and 432 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:15,086 INFO L93 Difference]: Finished difference Result 392 states and 505 transitions. [2024-11-16 03:03:15,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:03:15,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 62 [2024-11-16 03:03:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:15,088 INFO L225 Difference]: With dead ends: 392 [2024-11-16 03:03:15,088 INFO L226 Difference]: Without dead ends: 327 [2024-11-16 03:03:15,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:15,089 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 43 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:15,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1591 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 03:03:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-16 03:03:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2024-11-16 03:03:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 299 states have (on average 1.3177257525083612) internal successors, (394), 302 states have internal predecessors, (394), 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-11-16 03:03:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 427 transitions. [2024-11-16 03:03:15,106 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 427 transitions. Word has length 62 [2024-11-16 03:03:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 427 transitions. [2024-11-16 03:03:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 427 transitions. [2024-11-16 03:03:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 03:03:15,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:15,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:15,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 03:03:15,108 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1635518080, now seen corresponding path program 1 times [2024-11-16 03:03:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:15,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248642597] [2024-11-16 03:03:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 03:03:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:15,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:15,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248642597] [2024-11-16 03:03:15,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248642597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:15,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:15,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:03:15,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599167508] [2024-11-16 03:03:15,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:15,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:03:15,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:15,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:03:15,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:03:15,341 INFO L87 Difference]: Start difference. First operand 327 states and 427 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:16,177 INFO L93 Difference]: Finished difference Result 346 states and 446 transitions. [2024-11-16 03:03:16,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:03:16,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2024-11-16 03:03:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:16,178 INFO L225 Difference]: With dead ends: 346 [2024-11-16 03:03:16,178 INFO L226 Difference]: Without dead ends: 320 [2024-11-16 03:03:16,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:03:16,179 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 72 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:16,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 881 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:03:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-16 03:03:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-16 03:03:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 294 states have (on average 1.3197278911564625) internal successors, (388), 297 states have internal predecessors, (388), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-16 03:03:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 419 transitions. [2024-11-16 03:03:16,192 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 419 transitions. Word has length 63 [2024-11-16 03:03:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:16,193 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 419 transitions. [2024-11-16 03:03:16,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 419 transitions. [2024-11-16 03:03:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 03:03:16,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:16,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:16,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 03:03:16,195 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:16,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2127616634, now seen corresponding path program 1 times [2024-11-16 03:03:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228321831] [2024-11-16 03:03:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 03:03:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:16,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228321831] [2024-11-16 03:03:16,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228321831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:16,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:16,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 03:03:16,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811329206] [2024-11-16 03:03:16,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:16,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:03:16,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:16,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:03:16,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:03:16,677 INFO L87 Difference]: Start difference. First operand 320 states and 419 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:18,460 INFO L93 Difference]: Finished difference Result 363 states and 468 transitions. [2024-11-16 03:03:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 03:03:18,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 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 64 [2024-11-16 03:03:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:18,462 INFO L225 Difference]: With dead ends: 363 [2024-11-16 03:03:18,462 INFO L226 Difference]: Without dead ends: 323 [2024-11-16 03:03:18,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:03:18,463 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 434 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:18,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1389 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 03:03:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-16 03:03:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2024-11-16 03:03:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 294 states have (on average 1.3129251700680271) internal successors, (386), 297 states have internal predecessors, (386), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-16 03:03:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 417 transitions. [2024-11-16 03:03:18,484 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 417 transitions. Word has length 64 [2024-11-16 03:03:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:18,484 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 417 transitions. [2024-11-16 03:03:18,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 417 transitions. [2024-11-16 03:03:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 03:03:18,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:18,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:18,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 03:03:18,486 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:18,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:18,487 INFO L85 PathProgramCache]: Analyzing trace with hash -630651192, now seen corresponding path program 1 times [2024-11-16 03:03:18,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:18,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363128526] [2024-11-16 03:03:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:18,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 03:03:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:18,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-16 03:03:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:18,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363128526] [2024-11-16 03:03:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363128526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:18,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:18,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 03:03:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753490177] [2024-11-16 03:03:18,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:18,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:03:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:03:18,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:03:18,705 INFO L87 Difference]: Start difference. First operand 320 states and 417 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-16 03:03:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:20,574 INFO L93 Difference]: Finished difference Result 375 states and 485 transitions. [2024-11-16 03:03:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:03:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 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) Word has length 66 [2024-11-16 03:03:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:20,577 INFO L225 Difference]: With dead ends: 375 [2024-11-16 03:03:20,577 INFO L226 Difference]: Without dead ends: 318 [2024-11-16 03:03:20,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:03:20,578 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 106 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:20,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1151 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 03:03:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-16 03:03:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-16 03:03:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 293 states have (on average 1.3071672354948805) internal successors, (383), 295 states have internal predecessors, (383), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-16 03:03:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 413 transitions. [2024-11-16 03:03:20,592 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 413 transitions. Word has length 66 [2024-11-16 03:03:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:20,593 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 413 transitions. [2024-11-16 03:03:20,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-16 03:03:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 413 transitions. [2024-11-16 03:03:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 03:03:20,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:20,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:20,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 03:03:20,595 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:20,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:20,595 INFO L85 PathProgramCache]: Analyzing trace with hash -38345335, now seen corresponding path program 1 times [2024-11-16 03:03:20,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:20,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552802855] [2024-11-16 03:03:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:20,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:20,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 03:03:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:21,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:21,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552802855] [2024-11-16 03:03:21,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552802855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:21,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:21,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960142287] [2024-11-16 03:03:21,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:21,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:21,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:21,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:21,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:21,027 INFO L87 Difference]: Start difference. First operand 318 states and 413 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:22,105 INFO L93 Difference]: Finished difference Result 417 states and 536 transitions. [2024-11-16 03:03:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:03:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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 66 [2024-11-16 03:03:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:22,107 INFO L225 Difference]: With dead ends: 417 [2024-11-16 03:03:22,107 INFO L226 Difference]: Without dead ends: 329 [2024-11-16 03:03:22,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:03:22,108 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 399 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:22,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1134 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 03:03:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-16 03:03:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 320. [2024-11-16 03:03:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 295 states have (on average 1.3016949152542372) internal successors, (384), 297 states have internal predecessors, (384), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-16 03:03:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 414 transitions. [2024-11-16 03:03:22,129 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 414 transitions. Word has length 66 [2024-11-16 03:03:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:22,130 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 414 transitions. [2024-11-16 03:03:22,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 414 transitions. [2024-11-16 03:03:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 03:03:22,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:22,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:22,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 03:03:22,131 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:22,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1910790422, now seen corresponding path program 1 times [2024-11-16 03:03:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:22,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870065277] [2024-11-16 03:03:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:22,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 03:03:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:22,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:22,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870065277] [2024-11-16 03:03:22,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870065277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:22,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:22,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:22,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103328131] [2024-11-16 03:03:22,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:22,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:22,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:22,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:22,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:22,534 INFO L87 Difference]: Start difference. First operand 320 states and 414 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:24,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 03:03:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:25,073 INFO L93 Difference]: Finished difference Result 332 states and 425 transitions. [2024-11-16 03:03:25,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:03:25,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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 66 [2024-11-16 03:03:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:25,074 INFO L225 Difference]: With dead ends: 332 [2024-11-16 03:03:25,074 INFO L226 Difference]: Without dead ends: 152 [2024-11-16 03:03:25,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:25,075 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 415 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:25,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1090 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 03:03:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-16 03:03:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-16 03:03:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.2681159420289856) internal successors, (175), 140 states have internal predecessors, (175), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 03:03:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 189 transitions. [2024-11-16 03:03:25,084 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 189 transitions. Word has length 66 [2024-11-16 03:03:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:25,085 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 189 transitions. [2024-11-16 03:03:25,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 03:03:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 189 transitions. [2024-11-16 03:03:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-16 03:03:25,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:25,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 03:03:25,086 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:25,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1572599085, now seen corresponding path program 1 times [2024-11-16 03:03:25,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:25,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674471189] [2024-11-16 03:03:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:25,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:25,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:25,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674471189] [2024-11-16 03:03:25,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674471189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:25,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:25,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:03:25,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853074434] [2024-11-16 03:03:25,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:25,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:03:25,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:25,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:03:25,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:03:25,413 INFO L87 Difference]: Start difference. First operand 152 states and 189 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 03:03:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:26,794 INFO L93 Difference]: Finished difference Result 232 states and 294 transitions. [2024-11-16 03:03:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:03:26,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-11-16 03:03:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:26,796 INFO L225 Difference]: With dead ends: 232 [2024-11-16 03:03:26,796 INFO L226 Difference]: Without dead ends: 177 [2024-11-16 03:03:26,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:03:26,797 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 18 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:26,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 807 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 03:03:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-16 03:03:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2024-11-16 03:03:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 154 states have (on average 1.2467532467532467) internal successors, (192), 156 states have internal predecessors, (192), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-16 03:03:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 208 transitions. [2024-11-16 03:03:26,808 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 208 transitions. Word has length 69 [2024-11-16 03:03:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:26,808 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 208 transitions. [2024-11-16 03:03:26,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 03:03:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2024-11-16 03:03:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 03:03:26,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:26,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:26,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 03:03:26,809 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:26,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash -832120611, now seen corresponding path program 1 times [2024-11-16 03:03:26,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:26,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893072724] [2024-11-16 03:03:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:26,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:27,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:27,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893072724] [2024-11-16 03:03:27,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893072724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:27,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:27,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 03:03:27,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844054962] [2024-11-16 03:03:27,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:27,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:03:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:27,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:03:27,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:03:27,202 INFO L87 Difference]: Start difference. First operand 170 states and 208 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 03:03:28,345 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-11-16 03:03:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:28,427 INFO L93 Difference]: Finished difference Result 231 states and 282 transitions. [2024-11-16 03:03:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:03:28,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-16 03:03:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:28,429 INFO L225 Difference]: With dead ends: 231 [2024-11-16 03:03:28,429 INFO L226 Difference]: Without dead ends: 161 [2024-11-16 03:03:28,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:03:28,430 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 16 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:28,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 618 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 03:03:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-16 03:03:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-16 03:03:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.2413793103448276) internal successors, (180), 147 states have internal predecessors, (180), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-16 03:03:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 196 transitions. [2024-11-16 03:03:28,441 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 196 transitions. Word has length 71 [2024-11-16 03:03:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:28,441 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 196 transitions. [2024-11-16 03:03:28,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 03:03:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 196 transitions. [2024-11-16 03:03:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-16 03:03:28,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:28,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:28,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 03:03:28,442 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:28,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2098498394, now seen corresponding path program 1 times [2024-11-16 03:03:28,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:28,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245067629] [2024-11-16 03:03:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:28,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:28,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:28,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245067629] [2024-11-16 03:03:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245067629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:28,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:03:28,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706761340] [2024-11-16 03:03:28,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:28,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:03:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:28,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:03:28,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:28,947 INFO L87 Difference]: Start difference. First operand 161 states and 196 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:03:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:32,541 INFO L93 Difference]: Finished difference Result 216 states and 264 transitions. [2024-11-16 03:03:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:03:32,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 75 [2024-11-16 03:03:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:32,543 INFO L225 Difference]: With dead ends: 216 [2024-11-16 03:03:32,543 INFO L226 Difference]: Without dead ends: 155 [2024-11-16 03:03:32,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-16 03:03:32,544 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 120 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:32,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 703 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-16 03:03:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-16 03:03:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-16 03:03:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 142 states have internal predecessors, (172), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-16 03:03:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 187 transitions. [2024-11-16 03:03:32,562 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 187 transitions. Word has length 75 [2024-11-16 03:03:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:32,562 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 187 transitions. [2024-11-16 03:03:32,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:03:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 187 transitions. [2024-11-16 03:03:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-16 03:03:32,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:32,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:32,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 03:03:32,567 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:32,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1187610154, now seen corresponding path program 1 times [2024-11-16 03:03:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:32,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748101477] [2024-11-16 03:03:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:32,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:32,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:32,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:32,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748101477] [2024-11-16 03:03:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748101477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:32,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:32,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805767245] [2024-11-16 03:03:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:32,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:32,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:32,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:32,811 INFO L87 Difference]: Start difference. First operand 155 states and 187 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:03:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:34,875 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2024-11-16 03:03:34,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:03:34,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2024-11-16 03:03:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:34,876 INFO L225 Difference]: With dead ends: 185 [2024-11-16 03:03:34,876 INFO L226 Difference]: Without dead ends: 181 [2024-11-16 03:03:34,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:03:34,877 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 35 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:34,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 568 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-16 03:03:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-16 03:03:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2024-11-16 03:03:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 146 states have (on average 1.2328767123287672) internal successors, (180), 148 states have internal predecessors, (180), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-16 03:03:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2024-11-16 03:03:34,889 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 76 [2024-11-16 03:03:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:34,889 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2024-11-16 03:03:34,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:03:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2024-11-16 03:03:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-16 03:03:34,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:34,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:34,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 03:03:34,891 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:34,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:34,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1043500905, now seen corresponding path program 1 times [2024-11-16 03:03:34,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:34,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544348255] [2024-11-16 03:03:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:34,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:35,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:35,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:35,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544348255] [2024-11-16 03:03:35,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544348255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:35,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:35,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:03:35,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068232215] [2024-11-16 03:03:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:35,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:03:35,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:35,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:03:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:35,254 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:03:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:36,639 INFO L93 Difference]: Finished difference Result 203 states and 243 transitions. [2024-11-16 03:03:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:03:36,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 77 [2024-11-16 03:03:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:36,641 INFO L225 Difference]: With dead ends: 203 [2024-11-16 03:03:36,641 INFO L226 Difference]: Without dead ends: 171 [2024-11-16 03:03:36,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:36,642 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 46 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:36,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 841 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 03:03:36,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-16 03:03:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2024-11-16 03:03:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 150 states have (on average 1.2266666666666666) internal successors, (184), 152 states have internal predecessors, (184), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-16 03:03:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2024-11-16 03:03:36,657 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 77 [2024-11-16 03:03:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:36,658 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2024-11-16 03:03:36,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:03:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2024-11-16 03:03:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-16 03:03:36,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:36,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:36,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 03:03:36,659 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:36,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -909549443, now seen corresponding path program 1 times [2024-11-16 03:03:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791322609] [2024-11-16 03:03:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:36,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:37,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791322609] [2024-11-16 03:03:37,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791322609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:37,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:37,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:03:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849029303] [2024-11-16 03:03:37,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:37,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:03:37,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:37,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:03:37,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:03:37,143 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:03:38,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 03:03:39,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 03:03:40,737 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-11-16 03:03:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:40,879 INFO L93 Difference]: Finished difference Result 200 states and 236 transitions. [2024-11-16 03:03:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:03:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2024-11-16 03:03:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:40,880 INFO L225 Difference]: With dead ends: 200 [2024-11-16 03:03:40,880 INFO L226 Difference]: Without dead ends: 162 [2024-11-16 03:03:40,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-16 03:03:40,881 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 299 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:40,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 353 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-16 03:03:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-16 03:03:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-16 03:03:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 146 states have (on average 1.2054794520547945) internal successors, (176), 148 states have internal predecessors, (176), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-16 03:03:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2024-11-16 03:03:40,891 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 77 [2024-11-16 03:03:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:40,891 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2024-11-16 03:03:40,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:03:40,891 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2024-11-16 03:03:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-16 03:03:40,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:40,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:40,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 03:03:40,893 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:40,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash 745682017, now seen corresponding path program 1 times [2024-11-16 03:03:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:40,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427952516] [2024-11-16 03:03:40,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:41,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:41,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:41,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:41,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427952516] [2024-11-16 03:03:41,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427952516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:41,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:41,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39321946] [2024-11-16 03:03:41,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:41,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:41,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:41,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:41,140 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:03:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:43,197 INFO L93 Difference]: Finished difference Result 239 states and 277 transitions. [2024-11-16 03:03:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:03:43,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2024-11-16 03:03:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:43,199 INFO L225 Difference]: With dead ends: 239 [2024-11-16 03:03:43,199 INFO L226 Difference]: Without dead ends: 191 [2024-11-16 03:03:43,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:43,200 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 69 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:43,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 527 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-16 03:03:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-16 03:03:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2024-11-16 03:03:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 155 states have internal predecessors, (182), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-16 03:03:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 199 transitions. [2024-11-16 03:03:43,212 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 199 transitions. Word has length 77 [2024-11-16 03:03:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:43,212 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 199 transitions. [2024-11-16 03:03:43,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:03:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 199 transitions. [2024-11-16 03:03:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-16 03:03:43,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:43,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 03:03:43,214 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:43,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash -452377668, now seen corresponding path program 1 times [2024-11-16 03:03:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196916391] [2024-11-16 03:03:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:43,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:43,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:43,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196916391] [2024-11-16 03:03:43,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196916391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:43,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:43,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:03:43,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208470110] [2024-11-16 03:03:43,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:43,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:03:43,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:03:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:43,649 INFO L87 Difference]: Start difference. First operand 170 states and 199 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:03:44,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 03:03:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:45,431 INFO L93 Difference]: Finished difference Result 219 states and 256 transitions. [2024-11-16 03:03:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:03:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2024-11-16 03:03:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:45,433 INFO L225 Difference]: With dead ends: 219 [2024-11-16 03:03:45,433 INFO L226 Difference]: Without dead ends: 170 [2024-11-16 03:03:45,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:45,433 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 37 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:45,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 826 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 03:03:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-16 03:03:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2024-11-16 03:03:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 149 states have (on average 1.174496644295302) internal successors, (175), 151 states have internal predecessors, (175), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-16 03:03:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2024-11-16 03:03:45,445 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 78 [2024-11-16 03:03:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:45,446 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2024-11-16 03:03:45,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:03:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2024-11-16 03:03:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 03:03:45,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:45,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:45,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 03:03:45,448 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:45,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:45,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2023546015, now seen corresponding path program 1 times [2024-11-16 03:03:45,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199431016] [2024-11-16 03:03:45,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:45,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:45,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199431016] [2024-11-16 03:03:45,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199431016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:45,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864117043] [2024-11-16 03:03:45,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:45,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:45,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:45,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:45,690 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:03:47,641 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-11-16 03:03:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:48,612 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2024-11-16 03:03:48,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:03:48,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 85 [2024-11-16 03:03:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:48,613 INFO L225 Difference]: With dead ends: 198 [2024-11-16 03:03:48,613 INFO L226 Difference]: Without dead ends: 151 [2024-11-16 03:03:48,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:48,614 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 20 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:48,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 443 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-16 03:03:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-16 03:03:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 139. [2024-11-16 03:03:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 127 states have internal predecessors, (146), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-16 03:03:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2024-11-16 03:03:48,623 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 85 [2024-11-16 03:03:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:48,624 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2024-11-16 03:03:48,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:03:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2024-11-16 03:03:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 03:03:48,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:48,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:48,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 03:03:48,627 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:48,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:48,627 INFO L85 PathProgramCache]: Analyzing trace with hash -625138386, now seen corresponding path program 1 times [2024-11-16 03:03:48,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:48,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214107829] [2024-11-16 03:03:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:48,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:49,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 03:03:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214107829] [2024-11-16 03:03:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214107829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:49,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 03:03:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958688008] [2024-11-16 03:03:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:49,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 03:03:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 03:03:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:03:49,107 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:50,549 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-11-16 03:03:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:51,605 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2024-11-16 03:03:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 03:03:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2024-11-16 03:03:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:51,606 INFO L225 Difference]: With dead ends: 164 [2024-11-16 03:03:51,606 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 03:03:51,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:03:51,607 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:51,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 965 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 03:03:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 03:03:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-16 03:03:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 118 states have (on average 1.152542372881356) internal successors, (136), 118 states have internal predecessors, (136), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 03:03:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2024-11-16 03:03:51,618 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 96 [2024-11-16 03:03:51,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:51,619 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2024-11-16 03:03:51,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2024-11-16 03:03:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 03:03:51,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:51,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:51,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 03:03:51,621 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1507874983, now seen corresponding path program 1 times [2024-11-16 03:03:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153745010] [2024-11-16 03:03:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:51,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:51,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:51,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:51,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 03:03:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:51,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:51,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153745010] [2024-11-16 03:03:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153745010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:51,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:03:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103814928] [2024-11-16 03:03:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:51,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:03:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:51,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:03:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:03:51,998 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:53,518 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2024-11-16 03:03:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:03:53,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2024-11-16 03:03:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:53,520 INFO L225 Difference]: With dead ends: 152 [2024-11-16 03:03:53,520 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 03:03:53,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:03:53,521 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 25 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:53,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 724 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 03:03:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 03:03:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-16 03:03:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 117 states have internal predecessors, (134), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 03:03:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2024-11-16 03:03:53,532 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 96 [2024-11-16 03:03:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:53,532 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2024-11-16 03:03:53,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2024-11-16 03:03:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 03:03:53,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:53,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 03:03:53,534 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:53,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash -26417876, now seen corresponding path program 1 times [2024-11-16 03:03:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:53,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964083931] [2024-11-16 03:03:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:53,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:53,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:53,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 03:03:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:53,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:53,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964083931] [2024-11-16 03:03:53,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964083931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:53,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:53,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:03:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837370091] [2024-11-16 03:03:53,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:53,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:03:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:03:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:53,886 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:54,984 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2024-11-16 03:03:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:03:54,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2024-11-16 03:03:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:54,985 INFO L225 Difference]: With dead ends: 162 [2024-11-16 03:03:54,985 INFO L226 Difference]: Without dead ends: 114 [2024-11-16 03:03:54,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:03:54,986 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 19 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:54,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 725 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 03:03:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-16 03:03:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-16 03:03:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 104 states have (on average 1.1346153846153846) internal successors, (118), 104 states have internal predecessors, (118), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 03:03:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2024-11-16 03:03:54,995 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 97 [2024-11-16 03:03:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:54,995 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2024-11-16 03:03:54,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2024-11-16 03:03:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 03:03:54,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:54,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:54,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 03:03:54,997 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:54,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash -482475631, now seen corresponding path program 1 times [2024-11-16 03:03:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:54,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779199345] [2024-11-16 03:03:54,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:55,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:03:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:55,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 03:03:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:55,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779199345] [2024-11-16 03:03:55,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779199345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:55,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064597053] [2024-11-16 03:03:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:55,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:55,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:55,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:55,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:55,568 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:57,554 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2024-11-16 03:03:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:03:57,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 102 [2024-11-16 03:03:57,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:57,556 INFO L225 Difference]: With dead ends: 180 [2024-11-16 03:03:57,556 INFO L226 Difference]: Without dead ends: 114 [2024-11-16 03:03:57,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:57,557 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 16 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:57,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 479 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-16 03:03:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-16 03:03:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-16 03:03:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 104 states have (on average 1.125) internal successors, (117), 104 states have internal predecessors, (117), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 03:03:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2024-11-16 03:03:57,567 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 102 [2024-11-16 03:03:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:57,567 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2024-11-16 03:03:57,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2024-11-16 03:03:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 03:03:57,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:57,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:57,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 03:03:57,569 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:57,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:57,570 INFO L85 PathProgramCache]: Analyzing trace with hash 960905548, now seen corresponding path program 1 times [2024-11-16 03:03:57,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:57,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550441617] [2024-11-16 03:03:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:03:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:58,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 03:03:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:03:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:03:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 03:03:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:03:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:03:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:03:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550441617] [2024-11-16 03:03:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550441617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:03:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:03:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:03:58,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620588587] [2024-11-16 03:03:58,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:03:58,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:03:58,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:03:58,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:03:58,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:58,064 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:59,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 03:03:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:03:59,918 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2024-11-16 03:03:59,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:03:59,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 104 [2024-11-16 03:03:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:03:59,919 INFO L225 Difference]: With dead ends: 214 [2024-11-16 03:03:59,919 INFO L226 Difference]: Without dead ends: 115 [2024-11-16 03:03:59,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:03:59,921 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 24 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:03:59,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 395 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 03:03:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-16 03:03:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-16 03:03:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 105 states have internal predecessors, (118), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 03:03:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2024-11-16 03:03:59,930 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 104 [2024-11-16 03:03:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:03:59,931 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2024-11-16 03:03:59,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:03:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2024-11-16 03:03:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 03:03:59,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:03:59,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:03:59,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 03:03:59,932 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:03:59,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:03:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash -793871527, now seen corresponding path program 1 times [2024-11-16 03:03:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:03:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924627919] [2024-11-16 03:03:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:03:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 03:04:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:04:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:00,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:04:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:00,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 03:04:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:04:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924627919] [2024-11-16 03:04:00,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924627919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:04:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731239015] [2024-11-16 03:04:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:04:00,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:04:00,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:04:00,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 03:04:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:01,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 03:04:01,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:04:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 03:04:01,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:04:01,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731239015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:04:01,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:04:01,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-16 03:04:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918248726] [2024-11-16 03:04:01,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:04:01,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:04:01,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:04:01,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:04:01,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-16 03:04:01,566 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:04:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:04:01,661 INFO L93 Difference]: Finished difference Result 206 states and 225 transitions. [2024-11-16 03:04:01,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:04:01,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2024-11-16 03:04:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:04:01,662 INFO L225 Difference]: With dead ends: 206 [2024-11-16 03:04:01,663 INFO L226 Difference]: Without dead ends: 119 [2024-11-16 03:04:01,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-16 03:04:01,664 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 5 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:04:01,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 453 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:04:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-16 03:04:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-16 03:04:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 108 states have (on average 1.1203703703703705) internal successors, (121), 108 states have internal predecessors, (121), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 03:04:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2024-11-16 03:04:01,675 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 105 [2024-11-16 03:04:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:04:01,675 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2024-11-16 03:04:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:04:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2024-11-16 03:04:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 03:04:01,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:04:01,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:04:01,701 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-11-16 03:04:01,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-16 03:04:01,882 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:04:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:04:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash 763323513, now seen corresponding path program 1 times [2024-11-16 03:04:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:04:01,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242041289] [2024-11-16 03:04:01,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:01,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 03:04:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:02,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:04:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:02,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:04:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 03:04:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:04:02,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:02,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242041289] [2024-11-16 03:04:02,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242041289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:04:02,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106414853] [2024-11-16 03:04:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:02,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:04:02,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:04:02,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:04:02,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 03:04:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:03,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 03:04:03,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:04:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:04:03,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:04:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 03:04:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106414853] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 03:04:03,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:04:03,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 11 [2024-11-16 03:04:03,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076137315] [2024-11-16 03:04:03,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:04:03,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:04:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:04:03,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:04:03,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:04:03,816 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:04:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:04:03,851 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2024-11-16 03:04:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:04:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 107 [2024-11-16 03:04:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:04:03,856 INFO L225 Difference]: With dead ends: 194 [2024-11-16 03:04:03,856 INFO L226 Difference]: Without dead ends: 119 [2024-11-16 03:04:03,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:04:03,857 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:04:03,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:04:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-16 03:04:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-16 03:04:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.1192660550458715) internal successors, (122), 109 states have internal predecessors, (122), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 03:04:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2024-11-16 03:04:03,868 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 107 [2024-11-16 03:04:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:04:03,869 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2024-11-16 03:04:03,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:04:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2024-11-16 03:04:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 03:04:03,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:04:03,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:04:03,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 03:04:04,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-16 03:04:04,071 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:04:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:04:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1007144861, now seen corresponding path program 1 times [2024-11-16 03:04:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:04:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914408665] [2024-11-16 03:04:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 03:04:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:04:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:04,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:04:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:04,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 03:04:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 03:04:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914408665] [2024-11-16 03:04:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914408665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:04:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747633675] [2024-11-16 03:04:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:04,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:04:04,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:04:04,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:04:04,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process