./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_product22.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e61661fc2d58041f16237a6d2ff2f3d5f72c7660b85c9fdf3f096a51b709ec23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:46:22,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:46:23,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:46:23,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:46:23,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:46:23,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:46:23,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:46:23,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:46:23,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:46:23,041 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:46:23,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:46:23,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:46:23,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:46:23,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:46:23,043 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:46:23,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:46:23,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:46:23,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:46:23,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:46:23,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:46:23,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:46:23,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:46:23,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:46:23,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:46:23,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:46:23,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:46:23,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:46:23,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:46:23,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:46:23,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:46:23,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:46:23,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:46:23,046 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e61661fc2d58041f16237a6d2ff2f3d5f72c7660b85c9fdf3f096a51b709ec23 [2025-02-05 15:46:23,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:46:23,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:46:23,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:46:23,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:46:23,290 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:46:23,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product22.cil.c [2025-02-05 15:46:24,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2783af14a/a7537007c96f41529011fd65248f7b49/FLAG915d65a71 [2025-02-05 15:46:24,817 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:46:24,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product22.cil.c [2025-02-05 15:46:24,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2783af14a/a7537007c96f41529011fd65248f7b49/FLAG915d65a71 [2025-02-05 15:46:25,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2783af14a/a7537007c96f41529011fd65248f7b49 [2025-02-05 15:46:25,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:46:25,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:46:25,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:46:25,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:46:25,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:46:25,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f45945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25, skipping insertion in model container [2025-02-05 15:46:25,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:46:25,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product22.cil.c[21483,21496] [2025-02-05 15:46:25,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:46:25,548 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:46:25,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-02-05 15:46:25,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-02-05 15:46:25,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [509] [2025-02-05 15:46:25,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [875] [2025-02-05 15:46:25,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [893] [2025-02-05 15:46:25,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [943] [2025-02-05 15:46:25,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [952] [2025-02-05 15:46:25,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2031] [2025-02-05 15:46:25,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2260] [2025-02-05 15:46:25,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2551] [2025-02-05 15:46:25,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2850] [2025-02-05 15:46:25,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product22.cil.c[21483,21496] [2025-02-05 15:46:25,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:46:25,689 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:46:25,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25 WrapperNode [2025-02-05 15:46:25,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:46:25,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:46:25,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:46:25,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:46:25,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,764 INFO L138 Inliner]: procedures = 129, calls = 195, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1009 [2025-02-05 15:46:25,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:46:25,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:46:25,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:46:25,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:46:25,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,803 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:46:25,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:46:25,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:46:25,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:46:25,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:46:25,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (1/1) ... [2025-02-05 15:46:25,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:46:25,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:25,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:46:25,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:46:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:46:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:46:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:46:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:46:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:46:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:46:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:46:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:46:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:46:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:46:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:46:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:46:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:46:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:46:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:46:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:46:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:46:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:46:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:46:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:46:26,046 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:46:26,048 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:46:26,319 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926-1: isReadable_#res#1 := isReadable_~retValue_acc~41#1; [2025-02-05 15:46:26,319 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1961-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~32#1; [2025-02-05 15:46:26,321 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-02-05 15:46:26,321 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1889-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~31#1; [2025-02-05 15:46:26,321 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~25#1; [2025-02-05 15:46:26,321 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2906-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~40#1; [2025-02-05 15:46:26,322 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2008-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2025-02-05 15:46:26,332 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2810: #res := ~retValue_acc~39; [2025-02-05 15:46:26,366 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: #res#1 := ~retValue_acc~28#1; [2025-02-05 15:46:26,367 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1620-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~27#1; [2025-02-05 15:46:26,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1573: #res := ~retValue_acc~26; [2025-02-05 15:46:26,394 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2025-02-05 15:46:26,407 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-02-05 15:46:26,421 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-02-05 15:46:26,442 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-02-05 15:46:26,698 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2785-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~38#1; [2025-02-05 15:46:26,698 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1728-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~29#1; [2025-02-05 15:46:26,698 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-02-05 15:46:26,698 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2767-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~36#1; [2025-02-05 15:46:26,698 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~37#1; [2025-02-05 15:46:26,698 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1835-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~30#1; [2025-02-05 15:46:26,705 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-02-05 15:46:26,816 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-02-05 15:46:26,816 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:46:26,830 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:46:26,831 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:46:26,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:46:26 BoogieIcfgContainer [2025-02-05 15:46:26,832 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:46:26,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:46:26,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:46:26,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:46:26,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:46:25" (1/3) ... [2025-02-05 15:46:26,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f8a99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:46:26, skipping insertion in model container [2025-02-05 15:46:26,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:25" (2/3) ... [2025-02-05 15:46:26,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f8a99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:46:26, skipping insertion in model container [2025-02-05 15:46:26,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:46:26" (3/3) ... [2025-02-05 15:46:26,842 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product22.cil.c [2025-02-05 15:46:26,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:46:26,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product22.cil.c that has 21 procedures, 333 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:46:26,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:46:26,945 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;@6cf130a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:46:26,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:46:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 257 states have (on average 1.5136186770428015) internal successors, (389), 261 states have internal predecessors, (389), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 15:46:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:46:26,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:26,964 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:26,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:26,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1628364117, now seen corresponding path program 1 times [2025-02-05 15:46:26,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:26,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961025716] [2025-02-05 15:46:26,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:27,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:46:27,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:46:27,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:27,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:46:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961025716] [2025-02-05 15:46:27,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961025716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758301384] [2025-02-05 15:46:27,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:27,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:27,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:27,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:27,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:46:27,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:46:27,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:46:27,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:27,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:27,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:46:27,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:27,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:27,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758301384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:27,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:27,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:46:27,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112813710] [2025-02-05 15:46:27,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:27,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:46:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:27,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:46:27,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:27,918 INFO L87 Difference]: Start difference. First operand has 333 states, 257 states have (on average 1.5136186770428015) internal successors, (389), 261 states have internal predecessors, (389), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:27,971 INFO L93 Difference]: Finished difference Result 508 states and 742 transitions. [2025-02-05 15:46:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:46:27,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2025-02-05 15:46:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:27,988 INFO L225 Difference]: With dead ends: 508 [2025-02-05 15:46:27,988 INFO L226 Difference]: Without dead ends: 326 [2025-02-05 15:46:27,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:27,995 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:27,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:28,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-05 15:46:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-02-05 15:46:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 251 states have (on average 1.5099601593625498) internal successors, (379), 254 states have internal predecessors, (379), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 15:46:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2025-02-05 15:46:28,052 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 114 [2025-02-05 15:46:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:28,053 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2025-02-05 15:46:28,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2025-02-05 15:46:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:46:28,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:28,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:28,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:28,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:46:28,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:28,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2064450067, now seen corresponding path program 1 times [2025-02-05 15:46:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785518999] [2025-02-05 15:46:28,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:28,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:46:28,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:46:28,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:28,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:46:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:28,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785518999] [2025-02-05 15:46:28,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785518999] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:28,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746741140] [2025-02-05 15:46:28,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:28,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:28,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:28,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:28,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:46:28,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:46:28,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:46:28,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:28,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:28,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:46:28,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:28,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:28,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746741140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:28,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:28,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:28,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805295709] [2025-02-05 15:46:28,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:28,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:28,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:28,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:28,762 INFO L87 Difference]: Start difference. First operand 326 states and 486 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:28,787 INFO L93 Difference]: Finished difference Result 497 states and 723 transitions. [2025-02-05 15:46:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2025-02-05 15:46:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:28,791 INFO L225 Difference]: With dead ends: 497 [2025-02-05 15:46:28,791 INFO L226 Difference]: Without dead ends: 328 [2025-02-05 15:46:28,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:28,792 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:28,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-05 15:46:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-02-05 15:46:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 253 states have (on average 1.5059288537549407) internal successors, (381), 256 states have internal predecessors, (381), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 15:46:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 488 transitions. [2025-02-05 15:46:28,808 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 488 transitions. Word has length 115 [2025-02-05 15:46:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:28,809 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 488 transitions. [2025-02-05 15:46:28,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 488 transitions. [2025-02-05 15:46:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:46:28,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:28,811 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:28,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:29,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:29,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:29,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash 952459063, now seen corresponding path program 1 times [2025-02-05 15:46:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:29,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74500037] [2025-02-05 15:46:29,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:29,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:46:29,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:46:29,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:29,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:46:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74500037] [2025-02-05 15:46:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74500037] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013964320] [2025-02-05 15:46:29,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:29,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:29,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:29,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:46:29,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:46:29,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:46:29,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:29,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:29,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:29,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:29,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013964320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268243230] [2025-02-05 15:46:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:29,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:29,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:29,519 INFO L87 Difference]: Start difference. First operand 328 states and 488 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:29,565 INFO L93 Difference]: Finished difference Result 690 states and 1042 transitions. [2025-02-05 15:46:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-02-05 15:46:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:29,574 INFO L225 Difference]: With dead ends: 690 [2025-02-05 15:46:29,574 INFO L226 Difference]: Without dead ends: 389 [2025-02-05 15:46:29,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:29,576 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 115 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:29,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 933 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:29,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-05 15:46:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 381. [2025-02-05 15:46:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 295 states have (on average 1.5254237288135593) internal successors, (450), 298 states have internal predecessors, (450), 65 states have call successors, (65), 20 states have call predecessors, (65), 20 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-05 15:46:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 579 transitions. [2025-02-05 15:46:29,610 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 579 transitions. Word has length 123 [2025-02-05 15:46:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:29,611 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 579 transitions. [2025-02-05 15:46:29,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 579 transitions. [2025-02-05 15:46:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:46:29,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:29,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:29,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:46:29,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:29,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:29,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1367718857, now seen corresponding path program 1 times [2025-02-05 15:46:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060718770] [2025-02-05 15:46:29,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:29,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:46:29,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:46:29,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:29,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:46:29,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:29,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060718770] [2025-02-05 15:46:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060718770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439100037] [2025-02-05 15:46:29,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:29,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:29,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:29,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:46:30,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:46:30,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:46:30,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:30,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:30,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:46:30,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:46:30,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:30,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439100037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:30,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:46:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715672792] [2025-02-05 15:46:30,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:30,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:30,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:30,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:30,350 INFO L87 Difference]: Start difference. First operand 381 states and 579 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:30,395 INFO L93 Difference]: Finished difference Result 753 states and 1148 transitions. [2025-02-05 15:46:30,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-02-05 15:46:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:30,403 INFO L225 Difference]: With dead ends: 753 [2025-02-05 15:46:30,403 INFO L226 Difference]: Without dead ends: 383 [2025-02-05 15:46:30,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:30,408 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 2 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:30,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1901 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-05 15:46:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2025-02-05 15:46:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 296 states have (on average 1.5236486486486487) internal successors, (451), 300 states have internal predecessors, (451), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (66), 64 states have call predecessors, (66), 64 states have call successors, (66) [2025-02-05 15:46:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 582 transitions. [2025-02-05 15:46:30,436 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 582 transitions. Word has length 124 [2025-02-05 15:46:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:30,436 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 582 transitions. [2025-02-05 15:46:30,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 582 transitions. [2025-02-05 15:46:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:46:30,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:30,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:30,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:46:30,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:30,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:30,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2011127644, now seen corresponding path program 1 times [2025-02-05 15:46:30,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:30,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039376768] [2025-02-05 15:46:30,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:30,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:46:30,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:46:30,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:30,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:46:30,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039376768] [2025-02-05 15:46:30,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039376768] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769639747] [2025-02-05 15:46:30,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:30,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:30,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:30,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:30,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:46:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:46:31,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:46:31,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:31,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:31,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:46:31,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:46:31,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769639747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:31,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:31,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:46:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947523273] [2025-02-05 15:46:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:31,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:31,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:31,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:31,127 INFO L87 Difference]: Start difference. First operand 383 states and 582 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:31,190 INFO L93 Difference]: Finished difference Result 755 states and 1153 transitions. [2025-02-05 15:46:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:31,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-02-05 15:46:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:31,193 INFO L225 Difference]: With dead ends: 755 [2025-02-05 15:46:31,193 INFO L226 Difference]: Without dead ends: 385 [2025-02-05 15:46:31,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:31,195 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:31,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1887 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-05 15:46:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-02-05 15:46:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 297 states have (on average 1.5218855218855218) internal successors, (452), 302 states have internal predecessors, (452), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (71), 64 states have call predecessors, (71), 64 states have call successors, (71) [2025-02-05 15:46:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 588 transitions. [2025-02-05 15:46:31,208 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 588 transitions. Word has length 125 [2025-02-05 15:46:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:31,208 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 588 transitions. [2025-02-05 15:46:31,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 588 transitions. [2025-02-05 15:46:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:46:31,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:31,210 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:31,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:31,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:31,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:31,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash 277575530, now seen corresponding path program 1 times [2025-02-05 15:46:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:31,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296433777] [2025-02-05 15:46:31,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:31,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:46:31,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:46:31,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:31,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:46:31,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296433777] [2025-02-05 15:46:31,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296433777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:31,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:31,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:31,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910028854] [2025-02-05 15:46:31,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:31,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:31,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:31,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:31,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:31,563 INFO L87 Difference]: Start difference. First operand 385 states and 588 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:31,610 INFO L93 Difference]: Finished difference Result 747 states and 1144 transitions. [2025-02-05 15:46:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:31,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-02-05 15:46:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:31,614 INFO L225 Difference]: With dead ends: 747 [2025-02-05 15:46:31,614 INFO L226 Difference]: Without dead ends: 385 [2025-02-05 15:46:31,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:31,617 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 2 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:31,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1905 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-05 15:46:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-02-05 15:46:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 297 states have (on average 1.5218855218855218) internal successors, (452), 302 states have internal predecessors, (452), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (70), 64 states have call predecessors, (70), 64 states have call successors, (70) [2025-02-05 15:46:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 587 transitions. [2025-02-05 15:46:31,634 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 587 transitions. Word has length 126 [2025-02-05 15:46:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:31,634 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 587 transitions. [2025-02-05 15:46:31,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 587 transitions. [2025-02-05 15:46:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:46:31,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:31,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:31,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:46:31,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:31,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1120962331, now seen corresponding path program 2 times [2025-02-05 15:46:31,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:31,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813281124] [2025-02-05 15:46:31,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:46:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:31,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 127 statements into 2 equivalence classes. [2025-02-05 15:46:31,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:46:31,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:46:31,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:46:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813281124] [2025-02-05 15:46:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813281124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:31,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:31,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104954883] [2025-02-05 15:46:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:31,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:31,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:31,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:31,767 INFO L87 Difference]: Start difference. First operand 385 states and 587 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:31,808 INFO L93 Difference]: Finished difference Result 745 states and 1139 transitions. [2025-02-05 15:46:31,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:31,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-02-05 15:46:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:31,814 INFO L225 Difference]: With dead ends: 745 [2025-02-05 15:46:31,814 INFO L226 Difference]: Without dead ends: 385 [2025-02-05 15:46:31,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:31,816 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:31,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1891 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-05 15:46:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-02-05 15:46:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 297 states have (on average 1.5218855218855218) internal successors, (452), 302 states have internal predecessors, (452), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (69), 64 states have call predecessors, (69), 64 states have call successors, (69) [2025-02-05 15:46:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 586 transitions. [2025-02-05 15:46:31,835 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 586 transitions. Word has length 127 [2025-02-05 15:46:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:31,835 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 586 transitions. [2025-02-05 15:46:31,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 586 transitions. [2025-02-05 15:46:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:46:31,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:31,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:31,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:46:31,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:31,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1733698425, now seen corresponding path program 3 times [2025-02-05 15:46:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:31,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063820262] [2025-02-05 15:46:31,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:46:31,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:31,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 3 equivalence classes. [2025-02-05 15:46:31,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 116 of 128 statements. [2025-02-05 15:46:31,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:46:31,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:46:31,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:31,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063820262] [2025-02-05 15:46:31,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063820262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178004240] [2025-02-05 15:46:31,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:31,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:31,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:31,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:31,967 INFO L87 Difference]: Start difference. First operand 385 states and 586 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:32,015 INFO L93 Difference]: Finished difference Result 747 states and 1145 transitions. [2025-02-05 15:46:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:32,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2025-02-05 15:46:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:32,019 INFO L225 Difference]: With dead ends: 747 [2025-02-05 15:46:32,019 INFO L226 Difference]: Without dead ends: 387 [2025-02-05 15:46:32,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:32,021 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:32,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1902 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-05 15:46:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-02-05 15:46:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 304 states have internal predecessors, (453), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (74), 64 states have call predecessors, (74), 64 states have call successors, (74) [2025-02-05 15:46:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 592 transitions. [2025-02-05 15:46:32,036 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 592 transitions. Word has length 128 [2025-02-05 15:46:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:32,037 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 592 transitions. [2025-02-05 15:46:32,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 592 transitions. [2025-02-05 15:46:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:46:32,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:32,039 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:32,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:46:32,039 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:32,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1720603832, now seen corresponding path program 1 times [2025-02-05 15:46:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:32,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135150857] [2025-02-05 15:46:32,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:32,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:46:32,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:46:32,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:32,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:46:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135150857] [2025-02-05 15:46:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135150857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693527369] [2025-02-05 15:46:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:32,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:32,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:32,172 INFO L87 Difference]: Start difference. First operand 387 states and 592 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:32,243 INFO L93 Difference]: Finished difference Result 753 states and 1155 transitions. [2025-02-05 15:46:32,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:32,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 129 [2025-02-05 15:46:32,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:32,250 INFO L225 Difference]: With dead ends: 753 [2025-02-05 15:46:32,250 INFO L226 Difference]: Without dead ends: 389 [2025-02-05 15:46:32,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:32,252 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:32,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1908 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-05 15:46:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-02-05 15:46:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 299 states have (on average 1.5183946488294315) internal successors, (454), 306 states have internal predecessors, (454), 65 states have call successors, (65), 20 states have call predecessors, (65), 24 states have return successors, (76), 64 states have call predecessors, (76), 64 states have call successors, (76) [2025-02-05 15:46:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 595 transitions. [2025-02-05 15:46:32,278 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 595 transitions. Word has length 129 [2025-02-05 15:46:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:32,278 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 595 transitions. [2025-02-05 15:46:32,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 595 transitions. [2025-02-05 15:46:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:46:32,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:32,282 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:32,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:46:32,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:32,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash -662761852, now seen corresponding path program 1 times [2025-02-05 15:46:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:32,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774127162] [2025-02-05 15:46:32,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:32,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:32,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:46:32,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:46:32,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:32,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:46:32,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:32,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774127162] [2025-02-05 15:46:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774127162] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:32,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102026871] [2025-02-05 15:46:32,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:32,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:32,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:32,488 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:32,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:46:32,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:46:32,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:46:32,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:32,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:32,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:32,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:32,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:46:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102026871] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:46:32,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:46:32,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:46:32,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140344029] [2025-02-05 15:46:32,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:46:32,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:46:32,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:32,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:46:32,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:32,909 INFO L87 Difference]: Start difference. First operand 389 states and 595 transitions. Second operand has 11 states, 10 states have (on average 13.6) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:46:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:33,442 INFO L93 Difference]: Finished difference Result 1123 states and 1795 transitions. [2025-02-05 15:46:33,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:46:33,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.6) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 130 [2025-02-05 15:46:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:33,447 INFO L225 Difference]: With dead ends: 1123 [2025-02-05 15:46:33,447 INFO L226 Difference]: Without dead ends: 763 [2025-02-05 15:46:33,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:46:33,449 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1382 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:33,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 3018 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:46:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-02-05 15:46:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 739. [2025-02-05 15:46:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 585 states have (on average 1.576068376068376) internal successors, (922), 591 states have internal predecessors, (922), 129 states have call successors, (129), 21 states have call predecessors, (129), 24 states have return successors, (150), 128 states have call predecessors, (150), 128 states have call successors, (150) [2025-02-05 15:46:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1201 transitions. [2025-02-05 15:46:33,481 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1201 transitions. Word has length 130 [2025-02-05 15:46:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:33,481 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1201 transitions. [2025-02-05 15:46:33,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.6) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:46:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1201 transitions. [2025-02-05 15:46:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:46:33,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:33,486 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:33,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:33,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:46:33,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:33,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1900574323, now seen corresponding path program 1 times [2025-02-05 15:46:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:33,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804299092] [2025-02-05 15:46:33,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:33,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:46:33,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:46:33,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:33,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804299092] [2025-02-05 15:46:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804299092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:33,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849486693] [2025-02-05 15:46:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:33,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:33,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:33,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:33,749 INFO L87 Difference]: Start difference. First operand 739 states and 1201 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:33,805 INFO L93 Difference]: Finished difference Result 1728 states and 2855 transitions. [2025-02-05 15:46:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:33,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-02-05 15:46:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:33,814 INFO L225 Difference]: With dead ends: 1728 [2025-02-05 15:46:33,815 INFO L226 Difference]: Without dead ends: 1067 [2025-02-05 15:46:33,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:33,819 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 112 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:33,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 966 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-02-05 15:46:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1059. [2025-02-05 15:46:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 841 states have (on average 1.595719381688466) internal successors, (1342), 847 states have internal predecessors, (1342), 193 states have call successors, (193), 21 states have call predecessors, (193), 24 states have return successors, (224), 192 states have call predecessors, (224), 192 states have call successors, (224) [2025-02-05 15:46:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1759 transitions. [2025-02-05 15:46:33,881 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1759 transitions. Word has length 133 [2025-02-05 15:46:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:33,881 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1759 transitions. [2025-02-05 15:46:33,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1759 transitions. [2025-02-05 15:46:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:46:33,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:33,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:33,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:46:33,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:33,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash 87588956, now seen corresponding path program 1 times [2025-02-05 15:46:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:33,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279711177] [2025-02-05 15:46:33,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:33,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:46:33,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:46:33,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:33,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279711177] [2025-02-05 15:46:33,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279711177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:33,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:33,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:33,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146582279] [2025-02-05 15:46:33,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:33,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:33,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:33,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:33,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:33,951 INFO L87 Difference]: Start difference. First operand 1059 states and 1759 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:34,013 INFO L93 Difference]: Finished difference Result 2522 states and 4212 transitions. [2025-02-05 15:46:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:34,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-05 15:46:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:34,023 INFO L225 Difference]: With dead ends: 2522 [2025-02-05 15:46:34,024 INFO L226 Difference]: Without dead ends: 1592 [2025-02-05 15:46:34,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:34,029 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 110 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:34,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 962 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-02-05 15:46:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1584. [2025-02-05 15:46:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1271 states have (on average 1.6050354051927616) internal successors, (2040), 1277 states have internal predecessors, (2040), 288 states have call successors, (288), 21 states have call predecessors, (288), 24 states have return successors, (319), 287 states have call predecessors, (319), 287 states have call successors, (319) [2025-02-05 15:46:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2647 transitions. [2025-02-05 15:46:34,116 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2647 transitions. Word has length 134 [2025-02-05 15:46:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:34,117 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2647 transitions. [2025-02-05 15:46:34,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2647 transitions. [2025-02-05 15:46:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:46:34,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:34,125 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:34,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:46:34,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:34,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:34,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1396169262, now seen corresponding path program 1 times [2025-02-05 15:46:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:34,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314343852] [2025-02-05 15:46:34,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:34,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:34,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:46:34,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:46:34,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:34,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314343852] [2025-02-05 15:46:34,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314343852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:34,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:34,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346364991] [2025-02-05 15:46:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:34,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:34,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:34,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:34,178 INFO L87 Difference]: Start difference. First operand 1584 states and 2647 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:34,261 INFO L93 Difference]: Finished difference Result 3711 states and 6246 transitions. [2025-02-05 15:46:34,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:34,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-02-05 15:46:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:34,274 INFO L225 Difference]: With dead ends: 3711 [2025-02-05 15:46:34,275 INFO L226 Difference]: Without dead ends: 2388 [2025-02-05 15:46:34,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:34,280 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 108 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:34,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 959 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2025-02-05 15:46:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2380. [2025-02-05 15:46:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 1944 states have (on average 1.6121399176954732) internal successors, (3134), 1950 states have internal predecessors, (3134), 411 states have call successors, (411), 21 states have call predecessors, (411), 24 states have return successors, (458), 410 states have call predecessors, (458), 410 states have call successors, (458) [2025-02-05 15:46:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 4003 transitions. [2025-02-05 15:46:34,377 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 4003 transitions. Word has length 135 [2025-02-05 15:46:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:34,377 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 4003 transitions. [2025-02-05 15:46:34,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 4003 transitions. [2025-02-05 15:46:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:46:34,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:34,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:34,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:46:34,389 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:34,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash 771093149, now seen corresponding path program 1 times [2025-02-05 15:46:34,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:34,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715440626] [2025-02-05 15:46:34,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:34,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:34,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:46:34,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:46:34,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:34,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:34,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715440626] [2025-02-05 15:46:34,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715440626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:34,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:34,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:34,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847689793] [2025-02-05 15:46:34,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:34,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:34,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:34,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:34,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:34,445 INFO L87 Difference]: Start difference. First operand 2380 states and 4003 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:34,534 INFO L93 Difference]: Finished difference Result 5564 states and 9418 transitions. [2025-02-05 15:46:34,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:34,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-02-05 15:46:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:34,554 INFO L225 Difference]: With dead ends: 5564 [2025-02-05 15:46:34,554 INFO L226 Difference]: Without dead ends: 3660 [2025-02-05 15:46:34,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:34,563 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 106 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:34,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 959 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2025-02-05 15:46:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3652. [2025-02-05 15:46:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 3037 states have (on average 1.6167270332565031) internal successors, (4910), 3043 states have internal predecessors, (4910), 590 states have call successors, (590), 21 states have call predecessors, (590), 24 states have return successors, (663), 589 states have call predecessors, (663), 589 states have call successors, (663) [2025-02-05 15:46:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 6163 transitions. [2025-02-05 15:46:34,757 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 6163 transitions. Word has length 136 [2025-02-05 15:46:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:34,758 INFO L471 AbstractCegarLoop]: Abstraction has 3652 states and 6163 transitions. [2025-02-05 15:46:34,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 6163 transitions. [2025-02-05 15:46:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:46:34,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:34,772 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:34,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:46:34,772 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:34,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2111815249, now seen corresponding path program 1 times [2025-02-05 15:46:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:34,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126957124] [2025-02-05 15:46:34,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:34,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:46:34,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:46:34,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:34,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:34,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:34,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126957124] [2025-02-05 15:46:34,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126957124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:34,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:34,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:34,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634374540] [2025-02-05 15:46:34,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:34,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:34,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:34,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:34,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:34,820 INFO L87 Difference]: Start difference. First operand 3652 states and 6163 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:34,973 INFO L93 Difference]: Finished difference Result 8611 states and 14626 transitions. [2025-02-05 15:46:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:34,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-02-05 15:46:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:35,009 INFO L225 Difference]: With dead ends: 8611 [2025-02-05 15:46:35,009 INFO L226 Difference]: Without dead ends: 5762 [2025-02-05 15:46:35,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:35,021 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 104 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:35,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 961 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2025-02-05 15:46:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5754. [2025-02-05 15:46:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5754 states, 4763 states have (on average 1.6117992861641823) internal successors, (7677), 4769 states have internal predecessors, (7677), 966 states have call successors, (966), 21 states have call predecessors, (966), 24 states have return successors, (1083), 965 states have call predecessors, (1083), 965 states have call successors, (1083) [2025-02-05 15:46:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5754 states to 5754 states and 9726 transitions. [2025-02-05 15:46:35,331 INFO L78 Accepts]: Start accepts. Automaton has 5754 states and 9726 transitions. Word has length 137 [2025-02-05 15:46:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:35,332 INFO L471 AbstractCegarLoop]: Abstraction has 5754 states and 9726 transitions. [2025-02-05 15:46:35,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5754 states and 9726 transitions. [2025-02-05 15:46:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:46:35,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:35,356 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:35,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:46:35,357 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2082253534, now seen corresponding path program 1 times [2025-02-05 15:46:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722892604] [2025-02-05 15:46:35,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:35,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:46:35,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:46:35,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:35,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:35,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:35,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722892604] [2025-02-05 15:46:35,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722892604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:35,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:35,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:35,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751310275] [2025-02-05 15:46:35,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:35,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:35,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:35,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:35,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:35,423 INFO L87 Difference]: Start difference. First operand 5754 states and 9726 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:35,703 INFO L93 Difference]: Finished difference Result 14123 states and 24023 transitions. [2025-02-05 15:46:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:35,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-02-05 15:46:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:35,765 INFO L225 Difference]: With dead ends: 14123 [2025-02-05 15:46:35,765 INFO L226 Difference]: Without dead ends: 9568 [2025-02-05 15:46:35,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:35,786 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 102 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:35,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 964 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9568 states. [2025-02-05 15:46:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9568 to 9560. [2025-02-05 15:46:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9560 states, 7963 states have (on average 1.6104483234961697) internal successors, (12824), 7969 states have internal predecessors, (12824), 1572 states have call successors, (1572), 21 states have call predecessors, (1572), 24 states have return successors, (1767), 1571 states have call predecessors, (1767), 1571 states have call successors, (1767) [2025-02-05 15:46:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9560 states to 9560 states and 16163 transitions. [2025-02-05 15:46:36,213 INFO L78 Accepts]: Start accepts. Automaton has 9560 states and 16163 transitions. Word has length 138 [2025-02-05 15:46:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:36,213 INFO L471 AbstractCegarLoop]: Abstraction has 9560 states and 16163 transitions. [2025-02-05 15:46:36,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 9560 states and 16163 transitions. [2025-02-05 15:46:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:46:36,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:36,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:36,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:46:36,303 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:36,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1705378032, now seen corresponding path program 1 times [2025-02-05 15:46:36,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:36,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21765850] [2025-02-05 15:46:36,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:36,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:46:36,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:46:36,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:36,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:36,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21765850] [2025-02-05 15:46:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21765850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:36,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:36,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:36,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377770816] [2025-02-05 15:46:36,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:36,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:36,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:36,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:36,350 INFO L87 Difference]: Start difference. First operand 9560 states and 16163 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:36,797 INFO L93 Difference]: Finished difference Result 24630 states and 41821 transitions. [2025-02-05 15:46:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-02-05 15:46:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:36,889 INFO L225 Difference]: With dead ends: 24630 [2025-02-05 15:46:36,889 INFO L226 Difference]: Without dead ends: 16744 [2025-02-05 15:46:36,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:36,924 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 100 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:36,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 989 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2025-02-05 15:46:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 16736. [2025-02-05 15:46:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16736 states, 13936 states have (on average 1.6025401836969002) internal successors, (22333), 13942 states have internal predecessors, (22333), 2775 states have call successors, (2775), 21 states have call predecessors, (2775), 24 states have return successors, (3114), 2774 states have call predecessors, (3114), 2774 states have call successors, (3114) [2025-02-05 15:46:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16736 states to 16736 states and 28222 transitions. [2025-02-05 15:46:37,894 INFO L78 Accepts]: Start accepts. Automaton has 16736 states and 28222 transitions. Word has length 139 [2025-02-05 15:46:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:37,894 INFO L471 AbstractCegarLoop]: Abstraction has 16736 states and 28222 transitions. [2025-02-05 15:46:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 16736 states and 28222 transitions. [2025-02-05 15:46:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:46:37,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:37,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:37,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:46:37,954 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:37,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1757015393, now seen corresponding path program 1 times [2025-02-05 15:46:37,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:37,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202986532] [2025-02-05 15:46:37,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:37,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:46:37,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:46:37,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:37,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:38,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:38,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202986532] [2025-02-05 15:46:38,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202986532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:38,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:38,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:38,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823579102] [2025-02-05 15:46:38,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:38,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:38,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:38,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:38,033 INFO L87 Difference]: Start difference. First operand 16736 states and 28222 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:38,702 INFO L93 Difference]: Finished difference Result 44211 states and 74899 transitions. [2025-02-05 15:46:38,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:38,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-02-05 15:46:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:38,835 INFO L225 Difference]: With dead ends: 44211 [2025-02-05 15:46:38,835 INFO L226 Difference]: Without dead ends: 29818 [2025-02-05 15:46:38,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:38,894 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 98 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:38,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 962 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29818 states. [2025-02-05 15:46:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29818 to 29810. [2025-02-05 15:46:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29810 states, 24971 states have (on average 1.5990549036882784) internal successors, (39930), 24977 states have internal predecessors, (39930), 4814 states have call successors, (4814), 21 states have call predecessors, (4814), 24 states have return successors, (5427), 4813 states have call predecessors, (5427), 4813 states have call successors, (5427) [2025-02-05 15:46:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29810 states to 29810 states and 50171 transitions. [2025-02-05 15:46:39,984 INFO L78 Accepts]: Start accepts. Automaton has 29810 states and 50171 transitions. Word has length 140 [2025-02-05 15:46:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:39,984 INFO L471 AbstractCegarLoop]: Abstraction has 29810 states and 50171 transitions. [2025-02-05 15:46:39,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 29810 states and 50171 transitions. [2025-02-05 15:46:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:46:40,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:40,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:40,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:46:40,033 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:40,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:40,034 INFO L85 PathProgramCache]: Analyzing trace with hash 742181551, now seen corresponding path program 1 times [2025-02-05 15:46:40,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:40,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296574346] [2025-02-05 15:46:40,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:40,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:40,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 15:46:40,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 15:46:40,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296574346] [2025-02-05 15:46:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296574346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425408161] [2025-02-05 15:46:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:40,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:40,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:40,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:40,088 INFO L87 Difference]: Start difference. First operand 29810 states and 50171 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:41,432 INFO L93 Difference]: Finished difference Result 81168 states and 137111 transitions. [2025-02-05 15:46:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:41,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-02-05 15:46:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:41,646 INFO L225 Difference]: With dead ends: 81168 [2025-02-05 15:46:41,646 INFO L226 Difference]: Without dead ends: 54504 [2025-02-05 15:46:41,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:41,707 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 96 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:41,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 973 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54504 states. [2025-02-05 15:46:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54504 to 54496. [2025-02-05 15:46:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54496 states, 45942 states have (on average 1.594140437943494) internal successors, (73238), 45948 states have internal predecessors, (73238), 8529 states have call successors, (8529), 21 states have call predecessors, (8529), 24 states have return successors, (9674), 8528 states have call predecessors, (9674), 8528 states have call successors, (9674) [2025-02-05 15:46:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54496 states to 54496 states and 91441 transitions. [2025-02-05 15:46:43,610 INFO L78 Accepts]: Start accepts. Automaton has 54496 states and 91441 transitions. Word has length 141 [2025-02-05 15:46:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:43,611 INFO L471 AbstractCegarLoop]: Abstraction has 54496 states and 91441 transitions. [2025-02-05 15:46:43,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 54496 states and 91441 transitions. [2025-02-05 15:46:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:46:43,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:43,664 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:43,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:46:43,665 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:43,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash 420595456, now seen corresponding path program 1 times [2025-02-05 15:46:43,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:43,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355206290] [2025-02-05 15:46:43,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:43,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:46:43,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:46:43,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:43,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:43,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:43,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355206290] [2025-02-05 15:46:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355206290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:43,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:43,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279450837] [2025-02-05 15:46:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:43,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:43,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:43,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:43,717 INFO L87 Difference]: Start difference. First operand 54496 states and 91441 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:45,869 INFO L93 Difference]: Finished difference Result 101714 states and 171018 transitions. [2025-02-05 15:46:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:45,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-02-05 15:46:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:46,532 INFO L225 Difference]: With dead ends: 101714 [2025-02-05 15:46:46,533 INFO L226 Difference]: Without dead ends: 101545 [2025-02-05 15:46:46,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:46,633 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 91 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:46,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 976 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101545 states. [2025-02-05 15:46:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101545 to 101537. [2025-02-05 15:46:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101537 states, 86184 states have (on average 1.587719298245614) internal successors, (136836), 86190 states have internal predecessors, (136836), 15328 states have call successors, (15328), 21 states have call predecessors, (15328), 24 states have return successors, (17519), 15327 states have call predecessors, (17519), 15327 states have call successors, (17519) [2025-02-05 15:46:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101537 states to 101537 states and 169683 transitions. [2025-02-05 15:46:49,880 INFO L78 Accepts]: Start accepts. Automaton has 101537 states and 169683 transitions. Word has length 142 [2025-02-05 15:46:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:49,881 INFO L471 AbstractCegarLoop]: Abstraction has 101537 states and 169683 transitions. [2025-02-05 15:46:49,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 101537 states and 169683 transitions. [2025-02-05 15:46:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:46:49,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:49,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:49,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:46:49,959 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:49,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1395700690, now seen corresponding path program 1 times [2025-02-05 15:46:49,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:49,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573211124] [2025-02-05 15:46:49,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:49,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:46:49,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:46:49,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:49,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573211124] [2025-02-05 15:46:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573211124] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117897312] [2025-02-05 15:46:50,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:50,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:50,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:50,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:50,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:46:50,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:46:50,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:46:50,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:50,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:50,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 15:46:50,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:46:50,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:50,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117897312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:50,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:50,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-02-05 15:46:50,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232839823] [2025-02-05 15:46:50,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:50,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:46:50,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:50,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:46:50,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:46:50,883 INFO L87 Difference]: Start difference. First operand 101537 states and 169683 transitions. Second operand has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 9 states have internal predecessors, (105), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:46:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:55,960 INFO L93 Difference]: Finished difference Result 202377 states and 343685 transitions. [2025-02-05 15:46:55,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:46:55,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 9 states have internal predecessors, (105), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 143 [2025-02-05 15:46:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:57,114 INFO L225 Difference]: With dead ends: 202377 [2025-02-05 15:46:57,114 INFO L226 Difference]: Without dead ends: 202214 [2025-02-05 15:46:57,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:46:57,208 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 799 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 5222 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:57,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 5222 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:46:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202214 states. [2025-02-05 15:47:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202214 to 202184. [2025-02-05 15:47:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202184 states, 171671 states have (on average 1.5885385417455482) internal successors, (272706), 171573 states have internal predecessors, (272706), 30453 states have call successors, (30453), 53 states have call predecessors, (30453), 59 states have return successors, (38109), 30563 states have call predecessors, (38109), 30450 states have call successors, (38109) [2025-02-05 15:47:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202184 states to 202184 states and 341268 transitions. [2025-02-05 15:47:05,176 INFO L78 Accepts]: Start accepts. Automaton has 202184 states and 341268 transitions. Word has length 143 [2025-02-05 15:47:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:05,177 INFO L471 AbstractCegarLoop]: Abstraction has 202184 states and 341268 transitions. [2025-02-05 15:47:05,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 9 states have internal predecessors, (105), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:47:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 202184 states and 341268 transitions. [2025-02-05 15:47:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 15:47:05,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:05,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:47:05,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:47:05,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:05,545 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:05,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1014223964, now seen corresponding path program 1 times [2025-02-05 15:47:05,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:05,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156961578] [2025-02-05 15:47:05,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:05,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:47:05,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:47:05,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:05,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:47:05,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156961578] [2025-02-05 15:47:05,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156961578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:05,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:05,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:47:05,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706843292] [2025-02-05 15:47:05,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:05,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:47:05,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:05,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:47:05,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:47:05,656 INFO L87 Difference]: Start difference. First operand 202184 states and 341268 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)