./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product15.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_spec11_product15.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 34de882518b863b3a10882f7e6c83b5092b3f8512e5800a72c11385e11ff9a6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:40:38,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:40:38,234 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:40:38,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:40:38,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:40:38,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:40:38,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:40:38,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:40:38,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:40:38,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:40:38,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:40:38,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:40:38,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:40:38,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:40:38,257 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:40:38,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:40:38,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:38,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:40:38,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:40:38,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:40:38,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:40:38,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:40:38,259 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 -> 34de882518b863b3a10882f7e6c83b5092b3f8512e5800a72c11385e11ff9a6e [2025-02-05 15:40:38,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:40:38,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:40:38,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:40:38,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:40:38,500 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:40:38,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product15.cil.c [2025-02-05 15:40:39,724 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c39cdc71/93dcdf69011f4256a939da3859aad248/FLAG50efcb598 [2025-02-05 15:40:40,063 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:40:40,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product15.cil.c [2025-02-05 15:40:40,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c39cdc71/93dcdf69011f4256a939da3859aad248/FLAG50efcb598 [2025-02-05 15:40:40,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c39cdc71/93dcdf69011f4256a939da3859aad248 [2025-02-05 15:40:40,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:40:40,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:40:40,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:40,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:40:40,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:40:40,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c06ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40, skipping insertion in model container [2025-02-05 15:40:40,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:40:40,454 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_spec11_product15.cil.c[45629,45642] [2025-02-05 15:40:40,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:40,600 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:40:40,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-02-05 15:40:40,614 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [460] [2025-02-05 15:40:40,617 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [493] [2025-02-05 15:40:40,617 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [768] [2025-02-05 15:40:40,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1842] [2025-02-05 15:40:40,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1859] [2025-02-05 15:40:40,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2084] [2025-02-05 15:40:40,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2093] [2025-02-05 15:40:40,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2131] [2025-02-05 15:40:40,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2406] [2025-02-05 15:40:40,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2772] [2025-02-05 15:40:40,678 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_spec11_product15.cil.c[45629,45642] [2025-02-05 15:40:40,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:40,724 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:40:40,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40 WrapperNode [2025-02-05 15:40:40,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:40,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:40,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:40:40,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:40:40,730 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:40:40" (1/1) ... [2025-02-05 15:40:40,745 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:40:40" (1/1) ... [2025-02-05 15:40:40,775 INFO L138 Inliner]: procedures = 125, calls = 181, calls flagged for inlining = 53, calls inlined = 46, statements flattened = 895 [2025-02-05 15:40:40,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:40,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:40:40,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:40:40,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:40:40,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,811 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:40:40,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:40:40,828 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:40:40,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:40:40,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:40:40,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (1/1) ... [2025-02-05 15:40:40,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:40,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:40,862 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:40:40,865 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:40:40,882 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:40:40,882 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:40:40,882 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:40:40,882 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:40:40,882 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:40:40,882 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:40:40,882 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:40:40,882 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:40:40,883 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:40:40,883 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:40:40,883 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:40:40,883 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:40:40,883 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:40:40,883 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:40:40,883 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:40:40,883 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:40:40,883 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:40:40,883 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:40:40,883 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:40:40,883 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:40:40,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:40:40,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:40:40,884 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:40:40,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:40:40,884 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:40:40,884 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:40:40,884 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:40:40,884 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:40:40,884 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:40:40,884 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:40:40,884 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:40:40,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:40:40,884 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:40:40,884 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:40:40,885 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:40:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:40:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:40:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:40:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:40:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:40:40,885 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:40:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:40:40,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:40:41,007 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:40:41,009 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:40:41,219 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-1: getClientId_#res#1 := getClientId_~retValue_acc~32#1; [2025-02-05 15:40:41,220 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1384-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~25#1; [2025-02-05 15:40:41,220 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~30#1; [2025-02-05 15:40:41,220 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1337-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~24#1; [2025-02-05 15:40:41,220 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~15#1; [2025-02-05 15:40:41,247 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-02-05 15:40:41,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1431-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~26#1; [2025-02-05 15:40:41,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1476: #res#1 := ~retValue_acc~27#1; [2025-02-05 15:40:41,291 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2872-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2025-02-05 15:40:41,300 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-02-05 15:40:41,505 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~29#1; [2025-02-05 15:40:41,506 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1539-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~28#1; [2025-02-05 15:40:41,506 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128-1: valid_product_#res#1 := valid_product_~retValue_acc~35#1; [2025-02-05 15:40:41,506 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~12#1; [2025-02-05 15:40:41,506 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~13#1; [2025-02-05 15:40:41,506 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~14#1; [2025-02-05 15:40:41,511 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-02-05 15:40:41,518 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2848: #res#1 := ~retValue_acc~41#1; [2025-02-05 15:40:41,518 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2828-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~40#1; [2025-02-05 15:40:41,537 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-02-05 15:40:41,636 INFO L? ?]: Removed 382 outVars from TransFormulas that were not future-live. [2025-02-05 15:40:41,636 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:40:41,651 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:40:41,651 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:40:41,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:41 BoogieIcfgContainer [2025-02-05 15:40:41,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:40:41,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:40:41,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:40:41,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:40:41,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:40:40" (1/3) ... [2025-02-05 15:40:41,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40239ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:41, skipping insertion in model container [2025-02-05 15:40:41,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:40" (2/3) ... [2025-02-05 15:40:41,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40239ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:41, skipping insertion in model container [2025-02-05 15:40:41,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:41" (3/3) ... [2025-02-05 15:40:41,662 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product15.cil.c [2025-02-05 15:40:41,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:40:41,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product15.cil.c that has 19 procedures, 289 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:40:41,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:40:41,726 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;@7b060125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:40:41,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:40:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 289 states, 227 states have (on average 1.5374449339207048) internal successors, (349), 231 states have internal predecessors, (349), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 15:40:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:40:41,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:41,738 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] [2025-02-05 15:40:41,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:41,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1626652821, now seen corresponding path program 1 times [2025-02-05 15:40:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286654220] [2025-02-05 15:40:41,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:41,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:40:41,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:40:41,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:41,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:42,231 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:40:42,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:42,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286654220] [2025-02-05 15:40:42,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286654220] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:42,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434615812] [2025-02-05 15:40:42,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:42,235 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:40:42,237 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:40:42,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:40:42,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:40:42,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:42,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:42,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:40:42,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:42,481 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:40:42,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:42,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434615812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:42,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:42,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:40:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662529407] [2025-02-05 15:40:42,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:40:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:42,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:40:42,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:42,509 INFO L87 Difference]: Start difference. First operand has 289 states, 227 states have (on average 1.5374449339207048) internal successors, (349), 231 states have internal predecessors, (349), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:42,536 INFO L93 Difference]: Finished difference Result 425 states and 622 transitions. [2025-02-05 15:40:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:40:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-02-05 15:40:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:42,544 INFO L225 Difference]: With dead ends: 425 [2025-02-05 15:40:42,544 INFO L226 Difference]: Without dead ends: 282 [2025-02-05 15:40:42,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 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:40:42,548 INFO L435 NwaCegarLoop]: 430 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, 430 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:40:42,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-05 15:40:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-02-05 15:40:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 221 states have (on average 1.5339366515837105) internal successors, (339), 224 states have internal predecessors, (339), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 15:40:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 422 transitions. [2025-02-05 15:40:42,610 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 422 transitions. Word has length 109 [2025-02-05 15:40:42,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:42,611 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 422 transitions. [2025-02-05 15:40:42,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 422 transitions. [2025-02-05 15:40:42,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:40:42,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:42,616 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] [2025-02-05 15:40:42,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:40:42,817 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:40:42,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:42,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:42,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1890483908, now seen corresponding path program 1 times [2025-02-05 15:40:42,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:42,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890475070] [2025-02-05 15:40:42,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:42,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:42,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:40:42,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:40:42,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:42,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:43,055 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:40:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:43,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890475070] [2025-02-05 15:40:43,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890475070] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:43,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484884329] [2025-02-05 15:40:43,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:43,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:43,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:43,063 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:40:43,068 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:40:43,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:40:43,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:40:43,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:43,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:43,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:40:43,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:43,354 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:40:43,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484884329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:43,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:43,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591961355] [2025-02-05 15:40:43,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:43,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:43,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:43,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:43,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:43,359 INFO L87 Difference]: Start difference. First operand 282 states and 422 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:43,403 INFO L93 Difference]: Finished difference Result 414 states and 603 transitions. [2025-02-05 15:40:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:43,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2025-02-05 15:40:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:43,406 INFO L225 Difference]: With dead ends: 414 [2025-02-05 15:40:43,408 INFO L226 Difference]: Without dead ends: 284 [2025-02-05 15:40:43,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 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:40:43,409 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 840 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:40:43,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 840 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-05 15:40:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-02-05 15:40:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 223 states have (on average 1.5291479820627802) internal successors, (341), 226 states have internal predecessors, (341), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 15:40:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 424 transitions. [2025-02-05 15:40:43,442 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 424 transitions. Word has length 110 [2025-02-05 15:40:43,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:43,442 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 424 transitions. [2025-02-05 15:40:43,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 424 transitions. [2025-02-05 15:40:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:40:43,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:43,444 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] [2025-02-05 15:40:43,457 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:40:43,645 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:40:43,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:43,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1493697614, now seen corresponding path program 1 times [2025-02-05 15:40:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:43,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849693171] [2025-02-05 15:40:43,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:43,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:43,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:40:43,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:40:43,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:43,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:43,814 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:40:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849693171] [2025-02-05 15:40:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849693171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72777425] [2025-02-05 15:40:43,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:43,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:43,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:43,817 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:40:43,824 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:40:43,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:40:44,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:40:44,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:44,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:44,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:44,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:44,105 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:40:44,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72777425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267203886] [2025-02-05 15:40:44,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:44,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:44,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:44,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:44,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:44,111 INFO L87 Difference]: Start difference. First operand 284 states and 424 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:44,146 INFO L93 Difference]: Finished difference Result 597 states and 906 transitions. [2025-02-05 15:40:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:44,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2025-02-05 15:40:44,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:44,151 INFO L225 Difference]: With dead ends: 597 [2025-02-05 15:40:44,151 INFO L226 Difference]: Without dead ends: 340 [2025-02-05 15:40:44,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 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:40:44,153 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 107 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 803 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:40:44,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 803 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-02-05 15:40:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 332. [2025-02-05 15:40:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 260 states have (on average 1.5461538461538462) internal successors, (402), 263 states have internal predecessors, (402), 53 states have call successors, (53), 18 states have call predecessors, (53), 18 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 15:40:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2025-02-05 15:40:44,172 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 118 [2025-02-05 15:40:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:44,172 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2025-02-05 15:40:44,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2025-02-05 15:40:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:40:44,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:44,175 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] [2025-02-05 15:40:44,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:44,375 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:40:44,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:44,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:44,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2107078029, now seen corresponding path program 1 times [2025-02-05 15:40:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:44,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079294501] [2025-02-05 15:40:44,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:44,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:44,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:40:44,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:40:44,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:44,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:44,542 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:40:44,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079294501] [2025-02-05 15:40:44,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079294501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244542088] [2025-02-05 15:40:44,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:44,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:44,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:44,545 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:40:44,547 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:40:44,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:40:44,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:40:44,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:44,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:44,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:40:44,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:44,846 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:40:44,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:44,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244542088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:44,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:44,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:40:44,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986136480] [2025-02-05 15:40:44,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:44,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:44,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:44,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:44,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:44,850 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:44,897 INFO L93 Difference]: Finished difference Result 655 states and 1004 transitions. [2025-02-05 15:40:44,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:44,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2025-02-05 15:40:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:44,901 INFO L225 Difference]: With dead ends: 655 [2025-02-05 15:40:44,902 INFO L226 Difference]: Without dead ends: 334 [2025-02-05 15:40:44,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 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:40:44,903 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 2 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1645 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:40:44,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1645 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-05 15:40:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-02-05 15:40:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 261 states have (on average 1.5440613026819923) internal successors, (403), 265 states have internal predecessors, (403), 53 states have call successors, (53), 18 states have call predecessors, (53), 19 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2025-02-05 15:40:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 510 transitions. [2025-02-05 15:40:44,920 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 510 transitions. Word has length 119 [2025-02-05 15:40:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:44,920 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 510 transitions. [2025-02-05 15:40:44,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 510 transitions. [2025-02-05 15:40:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:40:44,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:44,924 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] [2025-02-05 15:40:44,934 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:40:45,124 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:40:45,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:45,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash 808440779, now seen corresponding path program 1 times [2025-02-05 15:40:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:45,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386295432] [2025-02-05 15:40:45,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:45,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:40:45,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:40:45,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:45,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,269 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:40:45,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:45,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386295432] [2025-02-05 15:40:45,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386295432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:45,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807592618] [2025-02-05 15:40:45,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:45,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:45,273 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:40:45,277 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:40:45,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:40:45,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:40:45,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:45,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:40:45,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:45,563 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:40:45,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:45,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807592618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:45,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:45,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:40:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669251332] [2025-02-05 15:40:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:45,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:45,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:45,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:45,565 INFO L87 Difference]: Start difference. First operand 334 states and 510 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:45,680 INFO L93 Difference]: Finished difference Result 657 states and 1009 transitions. [2025-02-05 15:40:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:45,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2025-02-05 15:40:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:45,683 INFO L225 Difference]: With dead ends: 657 [2025-02-05 15:40:45,683 INFO L226 Difference]: Without dead ends: 336 [2025-02-05 15:40:45,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:45,684 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 2 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1631 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:45,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1631 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:45,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-05 15:40:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-02-05 15:40:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 262 states have (on average 1.5419847328244274) internal successors, (404), 267 states have internal predecessors, (404), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2025-02-05 15:40:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 516 transitions. [2025-02-05 15:40:45,709 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 516 transitions. Word has length 120 [2025-02-05 15:40:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:45,709 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 516 transitions. [2025-02-05 15:40:45,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 516 transitions. [2025-02-05 15:40:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:40:45,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:45,714 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] [2025-02-05 15:40:45,723 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:40:45,915 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:40:45,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1928633323, now seen corresponding path program 1 times [2025-02-05 15:40:45,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:45,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215670566] [2025-02-05 15:40:45,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:45,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:40:45,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:40:45,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:45,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,126 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:40:46,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:46,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215670566] [2025-02-05 15:40:46,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215670566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:46,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:46,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023593802] [2025-02-05 15:40:46,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:46,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:46,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:46,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:46,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:46,128 INFO L87 Difference]: Start difference. First operand 336 states and 516 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:46,158 INFO L93 Difference]: Finished difference Result 649 states and 1000 transitions. [2025-02-05 15:40:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:46,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 121 [2025-02-05 15:40:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:46,161 INFO L225 Difference]: With dead ends: 649 [2025-02-05 15:40:46,161 INFO L226 Difference]: Without dead ends: 336 [2025-02-05 15:40:46,162 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:40:46,162 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 2 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1649 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:40:46,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1649 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-05 15:40:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-02-05 15:40:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 262 states have (on average 1.5419847328244274) internal successors, (404), 267 states have internal predecessors, (404), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2025-02-05 15:40:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 515 transitions. [2025-02-05 15:40:46,172 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 515 transitions. Word has length 121 [2025-02-05 15:40:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:46,172 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 515 transitions. [2025-02-05 15:40:46,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 515 transitions. [2025-02-05 15:40:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:40:46,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:46,174 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] [2025-02-05 15:40:46,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:40:46,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:46,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash 184746251, now seen corresponding path program 2 times [2025-02-05 15:40:46,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:46,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536531345] [2025-02-05 15:40:46,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:40:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:46,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-02-05 15:40:46,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 60 of 122 statements. [2025-02-05 15:40:46,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:40:46,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,275 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:40:46,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:46,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536531345] [2025-02-05 15:40:46,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536531345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:46,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:46,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:40:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667808968] [2025-02-05 15:40:46,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:46,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:46,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:46,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:46,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:46,277 INFO L87 Difference]: Start difference. First operand 336 states and 515 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:46,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:46,499 INFO L93 Difference]: Finished difference Result 808 states and 1226 transitions. [2025-02-05 15:40:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:40:46,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 122 [2025-02-05 15:40:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:46,503 INFO L225 Difference]: With dead ends: 808 [2025-02-05 15:40:46,504 INFO L226 Difference]: Without dead ends: 686 [2025-02-05 15:40:46,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:40:46,505 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 406 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:46,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 2521 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:40:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-05 15:40:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 651. [2025-02-05 15:40:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 512 states have (on average 1.5546875) internal successors, (796), 519 states have internal predecessors, (796), 100 states have call successors, (100), 36 states have call predecessors, (100), 38 states have return successors, (111), 99 states have call predecessors, (111), 98 states have call successors, (111) [2025-02-05 15:40:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1007 transitions. [2025-02-05 15:40:46,528 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1007 transitions. Word has length 122 [2025-02-05 15:40:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:46,528 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1007 transitions. [2025-02-05 15:40:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1007 transitions. [2025-02-05 15:40:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:40:46,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:46,531 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] [2025-02-05 15:40:46,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:40:46,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:46,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1874155981, now seen corresponding path program 3 times [2025-02-05 15:40:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:46,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590555465] [2025-02-05 15:40:46,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:40:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:46,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 123 statements into 3 equivalence classes. [2025-02-05 15:40:46,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 111 of 123 statements. [2025-02-05 15:40:46,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:40:46,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,627 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:40:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:46,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590555465] [2025-02-05 15:40:46,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590555465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:46,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:46,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:46,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209412999] [2025-02-05 15:40:46,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:46,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:46,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:46,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:46,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:46,629 INFO L87 Difference]: Start difference. First operand 651 states and 1007 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:46,673 INFO L93 Difference]: Finished difference Result 968 states and 1499 transitions. [2025-02-05 15:40:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:46,674 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-02-05 15:40:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:46,678 INFO L225 Difference]: With dead ends: 968 [2025-02-05 15:40:46,678 INFO L226 Difference]: Without dead ends: 657 [2025-02-05 15:40:46,680 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:40:46,680 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 1 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1638 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:40:46,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1638 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-02-05 15:40:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2025-02-05 15:40:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 513 states have (on average 1.553606237816764) internal successors, (797), 521 states have internal predecessors, (797), 100 states have call successors, (100), 36 states have call predecessors, (100), 39 states have return successors, (116), 99 states have call predecessors, (116), 98 states have call successors, (116) [2025-02-05 15:40:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1013 transitions. [2025-02-05 15:40:46,709 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1013 transitions. Word has length 123 [2025-02-05 15:40:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:46,710 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1013 transitions. [2025-02-05 15:40:46,710 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1013 transitions. [2025-02-05 15:40:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:40:46,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:46,713 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] [2025-02-05 15:40:46,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:40:46,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:46,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1281054861, now seen corresponding path program 1 times [2025-02-05 15:40:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126780317] [2025-02-05 15:40:46,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:46,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:40:46,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:40:46,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:46,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:40:46,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:46,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126780317] [2025-02-05 15:40:46,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126780317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:46,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:46,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566092375] [2025-02-05 15:40:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:46,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:46,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:46,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:46,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:46,831 INFO L87 Difference]: Start difference. First operand 653 states and 1013 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:46,867 INFO L93 Difference]: Finished difference Result 1285 states and 1997 transitions. [2025-02-05 15:40:46,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:46,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-02-05 15:40:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:46,870 INFO L225 Difference]: With dead ends: 1285 [2025-02-05 15:40:46,870 INFO L226 Difference]: Without dead ends: 655 [2025-02-05 15:40:46,871 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:40:46,871 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 1 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1652 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:40:46,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1652 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-05 15:40:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2025-02-05 15:40:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 514 states have (on average 1.5525291828793775) internal successors, (798), 523 states have internal predecessors, (798), 100 states have call successors, (100), 36 states have call predecessors, (100), 40 states have return successors, (118), 99 states have call predecessors, (118), 98 states have call successors, (118) [2025-02-05 15:40:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1016 transitions. [2025-02-05 15:40:46,890 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1016 transitions. Word has length 123 [2025-02-05 15:40:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:46,890 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1016 transitions. [2025-02-05 15:40:46,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:40:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1016 transitions. [2025-02-05 15:40:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:40:46,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:46,893 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] [2025-02-05 15:40:46,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:40:46,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:46,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash 301584752, now seen corresponding path program 1 times [2025-02-05 15:40:46,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:46,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966810497] [2025-02-05 15:40:46,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:46,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:46,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:40:46,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:40:46,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:46,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:40:46,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:46,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966810497] [2025-02-05 15:40:46,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966810497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:46,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:46,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:40:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538170337] [2025-02-05 15:40:46,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:46,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:46,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:46,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:46,992 INFO L87 Difference]: Start difference. First operand 655 states and 1016 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 15:40:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:47,087 INFO L93 Difference]: Finished difference Result 968 states and 1500 transitions. [2025-02-05 15:40:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:40:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 124 [2025-02-05 15:40:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:47,090 INFO L225 Difference]: With dead ends: 968 [2025-02-05 15:40:47,090 INFO L226 Difference]: Without dead ends: 342 [2025-02-05 15:40:47,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:40:47,092 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 7 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2813 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:47,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2813 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-05 15:40:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-02-05 15:40:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 266 states have (on average 1.5338345864661653) internal successors, (408), 272 states have internal predecessors, (408), 53 states have call successors, (53), 19 states have call predecessors, (53), 22 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2025-02-05 15:40:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 525 transitions. [2025-02-05 15:40:47,102 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 525 transitions. Word has length 124 [2025-02-05 15:40:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:47,102 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 525 transitions. [2025-02-05 15:40:47,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 15:40:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 525 transitions. [2025-02-05 15:40:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:40:47,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:47,104 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] [2025-02-05 15:40:47,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:40:47,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:47,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:47,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1867206479, now seen corresponding path program 1 times [2025-02-05 15:40:47,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:47,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355454577] [2025-02-05 15:40:47,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:40:47,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:40:47,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:47,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:47,224 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:40:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:47,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355454577] [2025-02-05 15:40:47,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355454577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:47,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028517249] [2025-02-05 15:40:47,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:47,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:47,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:47,230 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:40:47,233 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:40:47,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:40:47,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:40:47,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:47,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:47,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:47,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:47,479 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:40:47,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:40:47,554 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:40:47,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028517249] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:40:47,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:40:47,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:40:47,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102020419] [2025-02-05 15:40:47,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:40:47,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:40:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:47,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:40:47,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:47,557 INFO L87 Difference]: Start difference. First operand 342 states and 525 transitions. Second operand has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:40:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:47,982 INFO L93 Difference]: Finished difference Result 1002 states and 1613 transitions. [2025-02-05 15:40:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:40:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 125 [2025-02-05 15:40:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:47,986 INFO L225 Difference]: With dead ends: 1002 [2025-02-05 15:40:47,986 INFO L226 Difference]: Without dead ends: 691 [2025-02-05 15:40:47,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 247 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:40:47,988 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 1321 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:47,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 2671 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:40:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-02-05 15:40:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 665. [2025-02-05 15:40:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 525 states have (on average 1.5885714285714285) internal successors, (834), 531 states have internal predecessors, (834), 117 states have call successors, (117), 19 states have call predecessors, (117), 22 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2025-02-05 15:40:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1089 transitions. [2025-02-05 15:40:48,015 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1089 transitions. Word has length 125 [2025-02-05 15:40:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:48,015 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1089 transitions. [2025-02-05 15:40:48,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:40:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1089 transitions. [2025-02-05 15:40:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:40:48,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:48,019 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] [2025-02-05 15:40:48,026 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:40:48,219 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,SelfDestructingSolverStorable10 [2025-02-05 15:40:48,220 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:48,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:48,221 INFO L85 PathProgramCache]: Analyzing trace with hash 774252861, now seen corresponding path program 1 times [2025-02-05 15:40:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:48,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223280737] [2025-02-05 15:40:48,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:48,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:40:48,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:40:48,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:48,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:48,269 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:40:48,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:48,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223280737] [2025-02-05 15:40:48,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223280737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:48,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:48,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903777485] [2025-02-05 15:40:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:48,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:48,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:48,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:48,271 INFO L87 Difference]: Start difference. First operand 665 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:48,320 INFO L93 Difference]: Finished difference Result 1555 states and 2591 transitions. [2025-02-05 15:40:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:48,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-02-05 15:40:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:48,325 INFO L225 Difference]: With dead ends: 1555 [2025-02-05 15:40:48,325 INFO L226 Difference]: Without dead ends: 968 [2025-02-05 15:40:48,327 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:40:48,327 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 104 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 854 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:40:48,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 854 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-02-05 15:40:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 960. [2025-02-05 15:40:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 756 states have (on average 1.6058201058201058) internal successors, (1214), 762 states have internal predecessors, (1214), 181 states have call successors, (181), 19 states have call predecessors, (181), 22 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2025-02-05 15:40:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1607 transitions. [2025-02-05 15:40:48,363 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1607 transitions. Word has length 128 [2025-02-05 15:40:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:48,364 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1607 transitions. [2025-02-05 15:40:48,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1607 transitions. [2025-02-05 15:40:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:40:48,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:48,368 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] [2025-02-05 15:40:48,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:40:48,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:48,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:48,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1061756707, now seen corresponding path program 1 times [2025-02-05 15:40:48,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:48,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422614569] [2025-02-05 15:40:48,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:48,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:40:48,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:40:48,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:48,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:48,414 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:40:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:48,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422614569] [2025-02-05 15:40:48,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422614569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:48,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177257946] [2025-02-05 15:40:48,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:48,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:48,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:48,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:48,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:48,416 INFO L87 Difference]: Start difference. First operand 960 states and 1607 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:48,454 INFO L93 Difference]: Finished difference Result 2284 states and 3844 transitions. [2025-02-05 15:40:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:48,454 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-02-05 15:40:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:48,460 INFO L225 Difference]: With dead ends: 2284 [2025-02-05 15:40:48,461 INFO L226 Difference]: Without dead ends: 1453 [2025-02-05 15:40:48,463 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:40:48,463 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 102 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 834 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:40:48,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 834 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-02-05 15:40:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1445. [2025-02-05 15:40:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1146 states have (on average 1.612565445026178) internal successors, (1848), 1152 states have internal predecessors, (1848), 276 states have call successors, (276), 19 states have call predecessors, (276), 22 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2025-02-05 15:40:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2431 transitions. [2025-02-05 15:40:48,520 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2431 transitions. Word has length 129 [2025-02-05 15:40:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:48,520 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2431 transitions. [2025-02-05 15:40:48,520 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2431 transitions. [2025-02-05 15:40:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:40:48,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:48,527 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] [2025-02-05 15:40:48,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:40:48,527 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:48,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash -808731170, now seen corresponding path program 1 times [2025-02-05 15:40:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:48,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142722078] [2025-02-05 15:40:48,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:48,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:48,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:40:48,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:40:48,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:48,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:48,570 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:40:48,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:48,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142722078] [2025-02-05 15:40:48,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142722078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:48,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:48,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:48,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165186152] [2025-02-05 15:40:48,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:48,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:48,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:48,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:48,571 INFO L87 Difference]: Start difference. First operand 1445 states and 2431 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:48,628 INFO L93 Difference]: Finished difference Result 3368 states and 5710 transitions. [2025-02-05 15:40:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:48,628 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-02-05 15:40:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:48,665 INFO L225 Difference]: With dead ends: 3368 [2025-02-05 15:40:48,666 INFO L226 Difference]: Without dead ends: 2184 [2025-02-05 15:40:48,669 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:40:48,669 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 100 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 831 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:40:48,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 831 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:48,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2025-02-05 15:40:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2176. [2025-02-05 15:40:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1754 states have (on average 1.6180159635119726) internal successors, (2838), 1760 states have internal predecessors, (2838), 399 states have call successors, (399), 19 states have call predecessors, (399), 22 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2025-02-05 15:40:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3683 transitions. [2025-02-05 15:40:48,775 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3683 transitions. Word has length 130 [2025-02-05 15:40:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:48,775 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 3683 transitions. [2025-02-05 15:40:48,775 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3683 transitions. [2025-02-05 15:40:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:40:48,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:48,785 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] [2025-02-05 15:40:48,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:40:48,785 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1635754210, now seen corresponding path program 1 times [2025-02-05 15:40:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736079005] [2025-02-05 15:40:48,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:48,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:40:48,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:40:48,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:48,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:48,838 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:40:48,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:48,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736079005] [2025-02-05 15:40:48,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736079005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:48,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:48,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:48,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004483351] [2025-02-05 15:40:48,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:48,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:48,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:48,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:48,839 INFO L87 Difference]: Start difference. First operand 2176 states and 3683 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:48,916 INFO L93 Difference]: Finished difference Result 5046 states and 8602 transitions. [2025-02-05 15:40:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:48,917 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2025-02-05 15:40:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:48,932 INFO L225 Difference]: With dead ends: 5046 [2025-02-05 15:40:48,932 INFO L226 Difference]: Without dead ends: 3346 [2025-02-05 15:40:48,939 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:40:48,939 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 98 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 831 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:40:48,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 831 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2025-02-05 15:40:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3338. [2025-02-05 15:40:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 2737 states have (on average 1.6214833759590792) internal successors, (4438), 2743 states have internal predecessors, (4438), 578 states have call successors, (578), 19 states have call predecessors, (578), 22 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2025-02-05 15:40:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 5667 transitions. [2025-02-05 15:40:49,100 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 5667 transitions. Word has length 131 [2025-02-05 15:40:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:49,100 INFO L471 AbstractCegarLoop]: Abstraction has 3338 states and 5667 transitions. [2025-02-05 15:40:49,100 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 5667 transitions. [2025-02-05 15:40:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:40:49,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:49,111 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] [2025-02-05 15:40:49,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:40:49,111 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:49,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash 715275615, now seen corresponding path program 1 times [2025-02-05 15:40:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:49,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060710891] [2025-02-05 15:40:49,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:49,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:49,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:40:49,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:40:49,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:49,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:49,152 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:40:49,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:49,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060710891] [2025-02-05 15:40:49,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060710891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:49,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531493358] [2025-02-05 15:40:49,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:49,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:49,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:49,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:49,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:49,154 INFO L87 Difference]: Start difference. First operand 3338 states and 5667 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:49,270 INFO L93 Difference]: Finished difference Result 8063 states and 13762 transitions. [2025-02-05 15:40:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:49,271 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-02-05 15:40:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:49,295 INFO L225 Difference]: With dead ends: 8063 [2025-02-05 15:40:49,295 INFO L226 Difference]: Without dead ends: 5448 [2025-02-05 15:40:49,304 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:40:49,305 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 96 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 844 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:40:49,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 844 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5448 states. [2025-02-05 15:40:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5448 to 5440. [2025-02-05 15:40:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 4463 states have (on average 1.6143849428635446) internal successors, (7205), 4469 states have internal predecessors, (7205), 954 states have call successors, (954), 19 states have call predecessors, (954), 22 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2025-02-05 15:40:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 9230 transitions. [2025-02-05 15:40:49,545 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 9230 transitions. Word has length 132 [2025-02-05 15:40:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:49,545 INFO L471 AbstractCegarLoop]: Abstraction has 5440 states and 9230 transitions. [2025-02-05 15:40:49,546 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 9230 transitions. [2025-02-05 15:40:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:40:49,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:49,564 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:40:49,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:40:49,565 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 12583777, now seen corresponding path program 1 times [2025-02-05 15:40:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:49,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496373053] [2025-02-05 15:40:49,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:49,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:40:49,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:40:49,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:49,605 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:40:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496373053] [2025-02-05 15:40:49,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496373053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:49,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:49,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918832783] [2025-02-05 15:40:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:49,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:49,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:49,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:49,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:49,606 INFO L87 Difference]: Start difference. First operand 5440 states and 9230 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:49,809 INFO L93 Difference]: Finished difference Result 13380 states and 22847 transitions. [2025-02-05 15:40:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:49,809 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2025-02-05 15:40:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:49,848 INFO L225 Difference]: With dead ends: 13380 [2025-02-05 15:40:49,848 INFO L226 Difference]: Without dead ends: 9059 [2025-02-05 15:40:49,862 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:40:49,863 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 94 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 836 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:40:49,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 836 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9059 states. [2025-02-05 15:40:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9059 to 9051. [2025-02-05 15:40:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9051 states, 7468 states have (on average 1.6122121049812534) internal successors, (12040), 7474 states have internal predecessors, (12040), 1560 states have call successors, (1560), 19 states have call predecessors, (1560), 22 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2025-02-05 15:40:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 15355 transitions. [2025-02-05 15:40:50,298 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 15355 transitions. Word has length 133 [2025-02-05 15:40:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:50,298 INFO L471 AbstractCegarLoop]: Abstraction has 9051 states and 15355 transitions. [2025-02-05 15:40:50,298 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 15355 transitions. [2025-02-05 15:40:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:40:50,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:50,323 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:40:50,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:40:50,323 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:50,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash 842623296, now seen corresponding path program 1 times [2025-02-05 15:40:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:50,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078012909] [2025-02-05 15:40:50,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:50,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:40:50,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:40:50,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:50,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:50,377 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:40:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078012909] [2025-02-05 15:40:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078012909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611952121] [2025-02-05 15:40:50,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:50,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:50,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:50,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:50,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:50,378 INFO L87 Difference]: Start difference. First operand 9051 states and 15355 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:50,832 INFO L93 Difference]: Finished difference Result 23362 states and 39805 transitions. [2025-02-05 15:40:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:50,833 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 134 [2025-02-05 15:40:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:50,881 INFO L225 Difference]: With dead ends: 23362 [2025-02-05 15:40:50,882 INFO L226 Difference]: Without dead ends: 15875 [2025-02-05 15:40:50,901 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:40:50,902 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 92 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 844 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:40:50,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 844 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15875 states. [2025-02-05 15:40:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15875 to 15867. [2025-02-05 15:40:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15867 states, 13081 states have (on average 1.6033177891598502) internal successors, (20973), 13087 states have internal predecessors, (20973), 2763 states have call successors, (2763), 19 states have call predecessors, (2763), 22 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2025-02-05 15:40:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15867 states to 15867 states and 26838 transitions. [2025-02-05 15:40:51,459 INFO L78 Accepts]: Start accepts. Automaton has 15867 states and 26838 transitions. Word has length 134 [2025-02-05 15:40:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:51,460 INFO L471 AbstractCegarLoop]: Abstraction has 15867 states and 26838 transitions. [2025-02-05 15:40:51,460 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 15867 states and 26838 transitions. [2025-02-05 15:40:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:40:51,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:51,491 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:40:51,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:40:51,491 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:51,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2001399072, now seen corresponding path program 1 times [2025-02-05 15:40:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:51,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769947465] [2025-02-05 15:40:51,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:51,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:40:51,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:40:51,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:51,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:51,534 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:40:51,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:51,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769947465] [2025-02-05 15:40:51,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769947465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:51,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:51,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203460535] [2025-02-05 15:40:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:51,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:51,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:51,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:51,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:51,535 INFO L87 Difference]: Start difference. First operand 15867 states and 26838 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:51,988 INFO L93 Difference]: Finished difference Result 41933 states and 71267 transitions. [2025-02-05 15:40:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:51,988 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2025-02-05 15:40:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:52,085 INFO L225 Difference]: With dead ends: 41933 [2025-02-05 15:40:52,085 INFO L226 Difference]: Without dead ends: 28264 [2025-02-05 15:40:52,123 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:40:52,123 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 90 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 834 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:40:52,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 834 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28264 states. [2025-02-05 15:40:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28264 to 28256. [2025-02-05 15:40:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28256 states, 23431 states have (on average 1.5993342153557253) internal successors, (37474), 23437 states have internal predecessors, (37474), 4802 states have call successors, (4802), 19 states have call predecessors, (4802), 22 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2025-02-05 15:40:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28256 states to 28256 states and 47691 transitions. [2025-02-05 15:40:53,398 INFO L78 Accepts]: Start accepts. Automaton has 28256 states and 47691 transitions. Word has length 135 [2025-02-05 15:40:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:53,399 INFO L471 AbstractCegarLoop]: Abstraction has 28256 states and 47691 transitions. [2025-02-05 15:40:53,399 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 28256 states and 47691 transitions. [2025-02-05 15:40:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:40:53,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:53,433 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:40:53,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:40:53,433 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:53,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1024318975, now seen corresponding path program 1 times [2025-02-05 15:40:53,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:53,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603901911] [2025-02-05 15:40:53,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:53,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:53,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:40:53,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:40:53,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:53,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:53,707 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:40:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603901911] [2025-02-05 15:40:53,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603901911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:53,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:53,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:53,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584660933] [2025-02-05 15:40:53,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:53,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:53,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:53,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:53,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:53,709 INFO L87 Difference]: Start difference. First operand 28256 states and 47691 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:54,549 INFO L93 Difference]: Finished difference Result 76915 states and 130319 transitions. [2025-02-05 15:40:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:54,550 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 136 [2025-02-05 15:40:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:54,781 INFO L225 Difference]: With dead ends: 76915 [2025-02-05 15:40:54,781 INFO L226 Difference]: Without dead ends: 51620 [2025-02-05 15:40:54,872 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:40:54,874 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 88 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 836 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:40:54,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 836 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51620 states. [2025-02-05 15:40:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51620 to 51612. [2025-02-05 15:40:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51612 states, 43072 states have (on average 1.59393573551263) internal successors, (68654), 43078 states have internal predecessors, (68654), 8517 states have call successors, (8517), 19 states have call predecessors, (8517), 22 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2025-02-05 15:40:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51612 states to 51612 states and 86833 transitions. [2025-02-05 15:40:57,107 INFO L78 Accepts]: Start accepts. Automaton has 51612 states and 86833 transitions. Word has length 136 [2025-02-05 15:40:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:57,107 INFO L471 AbstractCegarLoop]: Abstraction has 51612 states and 86833 transitions. [2025-02-05 15:40:57,107 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 51612 states and 86833 transitions. [2025-02-05 15:40:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:40:57,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:57,145 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:40:57,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:40:57,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:57,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1081941567, now seen corresponding path program 1 times [2025-02-05 15:40:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:57,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418963459] [2025-02-05 15:40:57,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:57,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:40:57,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:40:57,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:57,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:57,186 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:40:57,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418963459] [2025-02-05 15:40:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418963459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:57,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:57,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130153836] [2025-02-05 15:40:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:57,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:57,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:57,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:57,187 INFO L87 Difference]: Start difference. First operand 51612 states and 86833 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:40:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:58,917 INFO L93 Difference]: Finished difference Result 96176 states and 162170 transitions. [2025-02-05 15:40:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:58,917 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 137 [2025-02-05 15:40:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:59,256 INFO L225 Difference]: With dead ends: 96176 [2025-02-05 15:40:59,256 INFO L226 Difference]: Without dead ends: 96046 [2025-02-05 15:40:59,294 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:40:59,295 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 83 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 848 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:40:59,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 848 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96046 states. [2025-02-05 15:41:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96046 to 96038. [2025-02-05 15:41:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96038 states, 80699 states have (on average 1.5869837296620777) internal successors, (128068), 80705 states have internal predecessors, (128068), 15316 states have call successors, (15316), 19 states have call predecessors, (15316), 22 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2025-02-05 15:41:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96038 states to 96038 states and 160891 transitions. [2025-02-05 15:41:02,307 INFO L78 Accepts]: Start accepts. Automaton has 96038 states and 160891 transitions. Word has length 137 [2025-02-05 15:41:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:02,307 INFO L471 AbstractCegarLoop]: Abstraction has 96038 states and 160891 transitions. [2025-02-05 15:41:02,308 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:41:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 96038 states and 160891 transitions. [2025-02-05 15:41:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:41:02,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:02,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:41:02,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:41:02,357 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:02,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1209314558, now seen corresponding path program 1 times [2025-02-05 15:41:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:02,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227312659] [2025-02-05 15:41:02,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:02,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:41:02,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:41:02,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:02,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:02,871 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:41:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227312659] [2025-02-05 15:41:02,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227312659] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130875168] [2025-02-05 15:41:02,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:02,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:02,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:02,874 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:41:02,876 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:41:03,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:41:03,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:41:03,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:03,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:03,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 15:41:03,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:03,554 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:41:03,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130875168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-02-05 15:41:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007889705] [2025-02-05 15:41:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:03,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:41:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:03,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:41:03,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:41:03,558 INFO L87 Difference]: Start difference. First operand 96038 states and 160891 transitions. Second operand has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:41:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:07,100 INFO L93 Difference]: Finished difference Result 191377 states and 326108 transitions. [2025-02-05 15:41:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:41:07,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 138 [2025-02-05 15:41:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:07,686 INFO L225 Difference]: With dead ends: 191377 [2025-02-05 15:41:07,686 INFO L226 Difference]: Without dead ends: 191255 [2025-02-05 15:41:07,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 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:41:07,771 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1102 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:07,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 3754 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:41:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191255 states. [2025-02-05 15:41:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191255 to 191227. [2025-02-05 15:41:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191227 states, 160756 states have (on average 1.5879096270123665) internal successors, (255266), 160658 states have internal predecessors, (255266), 30417 states have call successors, (30417), 47 states have call predecessors, (30417), 53 states have return successors, (38070), 30527 states have call predecessors, (38070), 30414 states have call successors, (38070) [2025-02-05 15:41:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191227 states to 191227 states and 323753 transitions. [2025-02-05 15:41:13,803 INFO L78 Accepts]: Start accepts. Automaton has 191227 states and 323753 transitions. Word has length 138 [2025-02-05 15:41:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:13,804 INFO L471 AbstractCegarLoop]: Abstraction has 191227 states and 323753 transitions. [2025-02-05 15:41:13,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:41:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 191227 states and 323753 transitions. [2025-02-05 15:41:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:41:13,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:13,896 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:41:13,905 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:41:14,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:14,097 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:14,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1053939586, now seen corresponding path program 1 times [2025-02-05 15:41:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:14,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140698089] [2025-02-05 15:41:14,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:14,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:41:14,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:41:14,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:14,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:14,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140698089] [2025-02-05 15:41:14,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140698089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:14,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769913907] [2025-02-05 15:41:14,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:14,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:14,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:14,377 INFO L229 MonitoredProcess]: Starting monitored process 9 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:41:14,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:41:14,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:41:14,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:41:14,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:14,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:14,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 15:41:14,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:41:14,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:14,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769913907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:14,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:14,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 23 [2025-02-05 15:41:14,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369456353] [2025-02-05 15:41:14,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:14,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:41:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:14,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:41:14,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:41:14,882 INFO L87 Difference]: Start difference. First operand 191227 states and 323753 transitions. Second operand has 11 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:41:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:18,993 INFO L93 Difference]: Finished difference Result 191741 states and 324468 transitions. [2025-02-05 15:41:18,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:41:18,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 139 [2025-02-05 15:41:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:19,643 INFO L225 Difference]: With dead ends: 191741 [2025-02-05 15:41:19,643 INFO L226 Difference]: Without dead ends: 191372 [2025-02-05 15:41:19,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 15:41:19,729 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 632 mSDsluCounter, 3053 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:19,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 3481 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:41:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191372 states.