./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product26.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_spec8_product26.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 5be9e48e11f5f92f9ccb04262780ea6fa0bae40b757b81b8e52fca7547f54831 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:48:31,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:48:31,140 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:48:31,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:48:31,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:48:31,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:48:31,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:48:31,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:48:31,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:48:31,177 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:48:31,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:48:31,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:48:31,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:48:31,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:48:31,180 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:48:31,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:48:31,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:48:31,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:48:31,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:48:31,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:48:31,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:48:31,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:48:31,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:48:31,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:48:31,182 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:48:31,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:48:31,182 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:48:31,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:48:31,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:48:31,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:48:31,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:48:31,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:48:31,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:31,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:48:31,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:48:31,183 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:48:31,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:48:31,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:48:31,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:48:31,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:48:31,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:48:31,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:48:31,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:48:31,184 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 -> 5be9e48e11f5f92f9ccb04262780ea6fa0bae40b757b81b8e52fca7547f54831 [2025-02-05 15:48:31,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:48:31,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:48:31,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:48:31,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:48:31,458 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:48:31,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product26.cil.c [2025-02-05 15:48:32,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/363e971d9/8d3b380eba634744a503864eb19de337/FLAG1cba54479 [2025-02-05 15:48:33,186 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:48:33,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product26.cil.c [2025-02-05 15:48:33,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/363e971d9/8d3b380eba634744a503864eb19de337/FLAG1cba54479 [2025-02-05 15:48:33,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/363e971d9/8d3b380eba634744a503864eb19de337 [2025-02-05 15:48:33,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:48:33,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:48:33,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:33,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:48:33,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:48:33,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:33" (1/1) ... [2025-02-05 15:48:33,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398f030a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:33, skipping insertion in model container [2025-02-05 15:48:33,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:33" (1/1) ... [2025-02-05 15:48:33,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:48:33,659 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_spec8_product26.cil.c[14808,14821] [2025-02-05 15:48:33,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:33,875 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:48:33,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-02-05 15:48:33,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [392] [2025-02-05 15:48:33,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [436] [2025-02-05 15:48:33,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [794] [2025-02-05 15:48:33,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [803] [2025-02-05 15:48:33,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1169] [2025-02-05 15:48:33,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1391] [2025-02-05 15:48:33,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1426] [2025-02-05 15:48:33,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1443] [2025-02-05 15:48:33,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1847] [2025-02-05 15:48:33,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1950] [2025-02-05 15:48:33,920 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_spec8_product26.cil.c[14808,14821] [2025-02-05 15:48:34,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:34,038 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:48:34,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34 WrapperNode [2025-02-05 15:48:34,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:34,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:34,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:48:34,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:48:34,046 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:48:34" (1/1) ... [2025-02-05 15:48:34,069 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:48:34" (1/1) ... [2025-02-05 15:48:34,121 INFO L138 Inliner]: procedures = 132, calls = 208, calls flagged for inlining = 61, calls inlined = 58, statements flattened = 1109 [2025-02-05 15:48:34,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:34,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:48:34,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:48:34,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:48:34,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,179 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:48:34,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:48:34,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:48:34,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:48:34,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:48:34,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (1/1) ... [2025-02-05 15:48:34,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:34,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:34,264 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:48:34,272 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:48:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:48:34,295 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:48:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:48:34,295 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:48:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:48:34,295 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:48:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:48:34,295 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:48:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:48:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:48:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:48:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:48:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:48:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:48:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:48:34,297 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:48:34,297 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:48:34,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:48:34,297 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:48:34,298 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:48:34,298 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:48:34,298 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:48:34,298 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:48:34,299 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:48:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:48:34,299 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:48:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:48:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:48:34,299 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:48:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:48:34,299 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:48:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:48:34,299 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:48:34,300 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:48:34,300 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:48:34,301 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:48:34,302 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:48:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:48:34,302 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:48:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:48:34,302 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:48:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:48:34,302 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:48:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:48:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:48:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:48:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:48:34,303 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:48:34,303 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:48:34,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:48:34,303 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:48:34,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:48:34,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:48:34,534 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:48:34,537 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:48:34,660 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644: #res#1 := ~retValue_acc~38#1; [2025-02-05 15:48:34,660 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2599-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-02-05 15:48:34,680 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-1: createEmail_#res#1 := createEmail_~retValue_acc~26#1; [2025-02-05 15:48:34,693 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2096: #res := ~retValue_acc~30; [2025-02-05 15:48:34,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1680: #res := ~retValue_acc~18; [2025-02-05 15:48:34,763 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717: #res := ~retValue_acc~19; [2025-02-05 15:48:34,830 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: #res := ~retValue_acc~15; [2025-02-05 15:48:34,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2422: #res := ~retValue_acc~34; [2025-02-05 15:48:35,156 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2868-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~41#1; [2025-02-05 15:48:35,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2505-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~35#1; [2025-02-05 15:48:35,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~23#1; [2025-02-05 15:48:35,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~5#1; [2025-02-05 15:48:35,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1491-1: getEmailId_#res#1 := getEmailId_~retValue_acc~13#1; [2025-02-05 15:48:35,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-02-05 15:48:35,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-1: isReadable_#res#1 := isReadable_~retValue_acc~24#1; [2025-02-05 15:48:35,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2940-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~42#1; [2025-02-05 15:48:35,158 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2552-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~36#1; [2025-02-05 15:48:35,492 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1423-1: valid_product_#res#1 := valid_product_~retValue_acc~10#1; [2025-02-05 15:48:35,493 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~3#1; [2025-02-05 15:48:35,493 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-02-05 15:48:35,493 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L704-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~2#1; [2025-02-05 15:48:35,493 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~4#1; [2025-02-05 15:48:35,493 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2707-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-02-05 15:48:35,501 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528: #res := ~retValue_acc~14; [2025-02-05 15:48:35,716 INFO L? ?]: Removed 546 outVars from TransFormulas that were not future-live. [2025-02-05 15:48:35,716 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:48:35,742 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:48:35,742 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:48:35,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:35 BoogieIcfgContainer [2025-02-05 15:48:35,742 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:48:35,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:48:35,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:48:35,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:48:35,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:48:33" (1/3) ... [2025-02-05 15:48:35,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f4d5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:35, skipping insertion in model container [2025-02-05 15:48:35,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:34" (2/3) ... [2025-02-05 15:48:35,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f4d5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:35, skipping insertion in model container [2025-02-05 15:48:35,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:35" (3/3) ... [2025-02-05 15:48:35,756 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product26.cil.c [2025-02-05 15:48:35,770 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:48:35,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product26.cil.c that has 24 procedures, 399 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:48:35,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:48:35,861 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;@9ed5b17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:48:35,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:48:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 312 states have (on average 1.560897435897436) internal successors, (487), 317 states have internal predecessors, (487), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 15:48:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:48:35,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:35,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:48:35,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:35,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1636112714, now seen corresponding path program 1 times [2025-02-05 15:48:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:35,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039983641] [2025-02-05 15:48:35,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:35,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:36,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:48:36,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:48:36,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:36,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039983641] [2025-02-05 15:48:36,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039983641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:36,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190735009] [2025-02-05 15:48:36,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:36,608 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:48:36,610 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:48:36,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:48:36,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:48:36,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:36,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:36,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:48:36,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:36,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:36,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190735009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:36,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:36,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:48:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825334777] [2025-02-05 15:48:36,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:37,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:48:37,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:37,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:48:37,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:37,020 INFO L87 Difference]: Start difference. First operand has 399 states, 312 states have (on average 1.560897435897436) internal successors, (487), 317 states have internal predecessors, (487), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:37,092 INFO L93 Difference]: Finished difference Result 601 states and 906 transitions. [2025-02-05 15:48:37,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:48:37,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-02-05 15:48:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:37,108 INFO L225 Difference]: With dead ends: 601 [2025-02-05 15:48:37,108 INFO L226 Difference]: Without dead ends: 392 [2025-02-05 15:48:37,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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:48:37,119 INFO L435 NwaCegarLoop]: 608 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, 608 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:48:37,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-05 15:48:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-05 15:48:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 306 states have (on average 1.5588235294117647) internal successors, (477), 310 states have internal predecessors, (477), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-05 15:48:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 600 transitions. [2025-02-05 15:48:37,197 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 600 transitions. Word has length 98 [2025-02-05 15:48:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:37,199 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 600 transitions. [2025-02-05 15:48:37,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 600 transitions. [2025-02-05 15:48:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:48:37,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:37,205 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:48:37,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:37,406 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:48:37,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:37,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash -526219406, now seen corresponding path program 1 times [2025-02-05 15:48:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:37,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029370259] [2025-02-05 15:48:37,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:37,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:48:37,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:48:37,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:37,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029370259] [2025-02-05 15:48:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029370259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642773555] [2025-02-05 15:48:37,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:37,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:37,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:37,728 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:48:37,730 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:48:37,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:48:38,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:48:38,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:38,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:38,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:48:38,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:38,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:38,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642773555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:38,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:38,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:38,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429509047] [2025-02-05 15:48:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:38,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:38,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:38,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:38,098 INFO L87 Difference]: Start difference. First operand 392 states and 600 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:38,153 INFO L93 Difference]: Finished difference Result 590 states and 884 transitions. [2025-02-05 15:48:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-02-05 15:48:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:38,160 INFO L225 Difference]: With dead ends: 590 [2025-02-05 15:48:38,160 INFO L226 Difference]: Without dead ends: 394 [2025-02-05 15:48:38,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 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:48:38,162 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1196 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:48:38,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1196 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-05 15:48:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-02-05 15:48:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 308 states have (on average 1.5551948051948052) internal successors, (479), 312 states have internal predecessors, (479), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-05 15:48:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 602 transitions. [2025-02-05 15:48:38,211 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 602 transitions. Word has length 99 [2025-02-05 15:48:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:38,211 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 602 transitions. [2025-02-05 15:48:38,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 602 transitions. [2025-02-05 15:48:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:48:38,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:38,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:48:38,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:48:38,417 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:48:38,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:38,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:38,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1801925750, now seen corresponding path program 1 times [2025-02-05 15:48:38,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:38,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240719155] [2025-02-05 15:48:38,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:38,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:38,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:48:38,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:48:38,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:38,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:38,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:38,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240719155] [2025-02-05 15:48:38,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240719155] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:38,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164726680] [2025-02-05 15:48:38,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:38,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:38,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:38,673 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:48:38,675 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:48:38,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:48:38,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:48:38,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:38,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:38,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:39,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:39,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164726680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:39,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:39,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442407446] [2025-02-05 15:48:39,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:39,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:39,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:39,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:39,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:39,043 INFO L87 Difference]: Start difference. First operand 394 states and 602 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:39,092 INFO L93 Difference]: Finished difference Result 840 states and 1303 transitions. [2025-02-05 15:48:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-02-05 15:48:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:39,101 INFO L225 Difference]: With dead ends: 840 [2025-02-05 15:48:39,102 INFO L226 Difference]: Without dead ends: 473 [2025-02-05 15:48:39,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 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:48:39,104 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 142 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1169 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:48:39,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-05 15:48:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 465. [2025-02-05 15:48:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.5753424657534247) internal successors, (575), 369 states have internal predecessors, (575), 76 states have call successors, (76), 23 states have call predecessors, (76), 23 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 15:48:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 726 transitions. [2025-02-05 15:48:39,134 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 726 transitions. Word has length 107 [2025-02-05 15:48:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:39,136 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 726 transitions. [2025-02-05 15:48:39,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 726 transitions. [2025-02-05 15:48:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:48:39,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:39,141 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:48:39,150 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:48:39,341 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:48:39,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:39,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1897049528, now seen corresponding path program 1 times [2025-02-05 15:48:39,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:39,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098242660] [2025-02-05 15:48:39,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:39,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:48:39,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:48:39,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:39,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098242660] [2025-02-05 15:48:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098242660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713730122] [2025-02-05 15:48:39,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:39,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:39,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:39,536 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:48:39,538 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:48:39,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:48:39,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:48:39,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:39,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:39,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:48:39,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:39,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:39,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713730122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:39,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:39,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:48:39,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837160333] [2025-02-05 15:48:39,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:39,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:39,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:39,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:39,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:39,874 INFO L87 Difference]: Start difference. First operand 465 states and 726 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:39,953 INFO L93 Difference]: Finished difference Result 921 states and 1442 transitions. [2025-02-05 15:48:39,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:39,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:48:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:39,959 INFO L225 Difference]: With dead ends: 921 [2025-02-05 15:48:39,959 INFO L226 Difference]: Without dead ends: 467 [2025-02-05 15:48:39,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 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:48:39,963 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 2 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2357 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:48:39,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2357 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-02-05 15:48:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-02-05 15:48:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 366 states have (on average 1.5737704918032787) internal successors, (576), 371 states have internal predecessors, (576), 76 states have call successors, (76), 23 states have call predecessors, (76), 24 states have return successors, (77), 74 states have call predecessors, (77), 75 states have call successors, (77) [2025-02-05 15:48:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 729 transitions. [2025-02-05 15:48:39,993 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 729 transitions. Word has length 108 [2025-02-05 15:48:39,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:39,993 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 729 transitions. [2025-02-05 15:48:39,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 729 transitions. [2025-02-05 15:48:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:48:39,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:39,998 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:40,009 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:48:40,202 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:48:40,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash 518214795, now seen corresponding path program 1 times [2025-02-05 15:48:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954606057] [2025-02-05 15:48:40,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:40,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:48:40,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:48:40,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:40,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:48:40,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:40,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954606057] [2025-02-05 15:48:40,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954606057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:40,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931065107] [2025-02-05 15:48:40,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:40,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:40,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:40,401 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:48:40,403 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:48:40,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:48:40,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:48:40,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:40,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:40,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:48:40,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:40,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:40,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931065107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:40,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:40,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:48:40,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577789239] [2025-02-05 15:48:40,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:40,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:40,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:40,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:40,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:40,751 INFO L87 Difference]: Start difference. First operand 467 states and 729 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:40,838 INFO L93 Difference]: Finished difference Result 923 states and 1447 transitions. [2025-02-05 15:48:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-02-05 15:48:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:40,844 INFO L225 Difference]: With dead ends: 923 [2025-02-05 15:48:40,845 INFO L226 Difference]: Without dead ends: 469 [2025-02-05 15:48:40,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:40,850 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 2 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2343 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:48:40,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2343 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-05 15:48:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-02-05 15:48:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 367 states have (on average 1.5722070844686649) internal successors, (577), 373 states have internal predecessors, (577), 76 states have call successors, (76), 23 states have call predecessors, (76), 25 states have return successors, (82), 74 states have call predecessors, (82), 75 states have call successors, (82) [2025-02-05 15:48:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 735 transitions. [2025-02-05 15:48:40,884 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 735 transitions. Word has length 109 [2025-02-05 15:48:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:40,885 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 735 transitions. [2025-02-05 15:48:40,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 735 transitions. [2025-02-05 15:48:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:48:40,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:40,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:40,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:48:41,089 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:48:41,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:41,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1351969099, now seen corresponding path program 1 times [2025-02-05 15:48:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344865769] [2025-02-05 15:48:41,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:41,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:48:41,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:48:41,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:41,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344865769] [2025-02-05 15:48:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344865769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:41,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:41,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286833713] [2025-02-05 15:48:41,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:41,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:41,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:41,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:41,235 INFO L87 Difference]: Start difference. First operand 469 states and 735 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:41,287 INFO L93 Difference]: Finished difference Result 915 states and 1438 transitions. [2025-02-05 15:48:41,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:41,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-02-05 15:48:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:41,291 INFO L225 Difference]: With dead ends: 915 [2025-02-05 15:48:41,291 INFO L226 Difference]: Without dead ends: 469 [2025-02-05 15:48:41,293 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:48:41,293 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 2 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2361 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:48:41,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2361 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-05 15:48:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-02-05 15:48:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 367 states have (on average 1.5722070844686649) internal successors, (577), 373 states have internal predecessors, (577), 76 states have call successors, (76), 23 states have call predecessors, (76), 25 states have return successors, (81), 74 states have call predecessors, (81), 75 states have call successors, (81) [2025-02-05 15:48:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 734 transitions. [2025-02-05 15:48:41,336 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 734 transitions. Word has length 110 [2025-02-05 15:48:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:41,338 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 734 transitions. [2025-02-05 15:48:41,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 734 transitions. [2025-02-05 15:48:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:48:41,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:41,341 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:41,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:48:41,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:41,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash -666258666, now seen corresponding path program 2 times [2025-02-05 15:48:41,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:41,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077604796] [2025-02-05 15:48:41,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:48:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:41,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-05 15:48:41,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:48:41,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:48:41,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:41,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077604796] [2025-02-05 15:48:41,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077604796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:41,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:41,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:41,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798324008] [2025-02-05 15:48:41,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:41,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:41,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:41,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:41,478 INFO L87 Difference]: Start difference. First operand 469 states and 734 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:41,542 INFO L93 Difference]: Finished difference Result 913 states and 1433 transitions. [2025-02-05 15:48:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:41,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-02-05 15:48:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:41,548 INFO L225 Difference]: With dead ends: 913 [2025-02-05 15:48:41,549 INFO L226 Difference]: Without dead ends: 469 [2025-02-05 15:48:41,550 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:48:41,551 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 2 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:41,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2347 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-05 15:48:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-02-05 15:48:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 367 states have (on average 1.5722070844686649) internal successors, (577), 373 states have internal predecessors, (577), 76 states have call successors, (76), 23 states have call predecessors, (76), 25 states have return successors, (80), 74 states have call predecessors, (80), 75 states have call successors, (80) [2025-02-05 15:48:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 733 transitions. [2025-02-05 15:48:41,574 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 733 transitions. Word has length 111 [2025-02-05 15:48:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:41,575 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 733 transitions. [2025-02-05 15:48:41,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 733 transitions. [2025-02-05 15:48:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:48:41,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:41,577 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] [2025-02-05 15:48:41,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:48:41,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1437273758, now seen corresponding path program 3 times [2025-02-05 15:48:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029786097] [2025-02-05 15:48:41,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:48:41,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:41,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 3 equivalence classes. [2025-02-05 15:48:41,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 100 of 112 statements. [2025-02-05 15:48:41,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:48:41,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029786097] [2025-02-05 15:48:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029786097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:41,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:41,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066865148] [2025-02-05 15:48:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:41,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:41,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:41,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:41,697 INFO L87 Difference]: Start difference. First operand 469 states and 733 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:41,759 INFO L93 Difference]: Finished difference Result 915 states and 1439 transitions. [2025-02-05 15:48:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-02-05 15:48:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:41,764 INFO L225 Difference]: With dead ends: 915 [2025-02-05 15:48:41,764 INFO L226 Difference]: Without dead ends: 471 [2025-02-05 15:48:41,766 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:48:41,767 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2358 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:48:41,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2358 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-05 15:48:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-02-05 15:48:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 368 states have (on average 1.5706521739130435) internal successors, (578), 375 states have internal predecessors, (578), 76 states have call successors, (76), 23 states have call predecessors, (76), 26 states have return successors, (85), 74 states have call predecessors, (85), 75 states have call successors, (85) [2025-02-05 15:48:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 739 transitions. [2025-02-05 15:48:41,790 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 739 transitions. Word has length 112 [2025-02-05 15:48:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:41,790 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 739 transitions. [2025-02-05 15:48:41,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 739 transitions. [2025-02-05 15:48:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:48:41,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:41,792 INFO L218 NwaCegarLoop]: trace histogram [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:48:41,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:48:41,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:41,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:41,793 INFO L85 PathProgramCache]: Analyzing trace with hash -151118285, now seen corresponding path program 1 times [2025-02-05 15:48:41,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:41,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175522459] [2025-02-05 15:48:41,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:41,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:41,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:48:41,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:48:41,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:41,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:41,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:41,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175522459] [2025-02-05 15:48:41,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175522459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:41,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:41,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:41,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184644726] [2025-02-05 15:48:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:41,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:41,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:41,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:41,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:41,941 INFO L87 Difference]: Start difference. First operand 471 states and 739 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:41,989 INFO L93 Difference]: Finished difference Result 921 states and 1449 transitions. [2025-02-05 15:48:41,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:41,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2025-02-05 15:48:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:41,993 INFO L225 Difference]: With dead ends: 921 [2025-02-05 15:48:41,993 INFO L226 Difference]: Without dead ends: 473 [2025-02-05 15:48:41,995 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:48:41,996 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2364 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:48:41,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2364 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-05 15:48:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-02-05 15:48:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 369 states have (on average 1.5691056910569106) internal successors, (579), 377 states have internal predecessors, (579), 76 states have call successors, (76), 23 states have call predecessors, (76), 27 states have return successors, (87), 74 states have call predecessors, (87), 75 states have call successors, (87) [2025-02-05 15:48:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 742 transitions. [2025-02-05 15:48:42,015 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 742 transitions. Word has length 113 [2025-02-05 15:48:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:42,015 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 742 transitions. [2025-02-05 15:48:42,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 742 transitions. [2025-02-05 15:48:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:48:42,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:42,018 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:42,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:48:42,018 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1163208527, now seen corresponding path program 1 times [2025-02-05 15:48:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:42,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116806930] [2025-02-05 15:48:42,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:42,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:48:42,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:48:42,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:42,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:48:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:42,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116806930] [2025-02-05 15:48:42,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116806930] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:42,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718486321] [2025-02-05 15:48:42,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:42,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:42,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:42,183 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:48:42,186 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:48:42,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:48:42,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:48:42,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:42,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:42,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:42,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:42,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:48:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:42,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718486321] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:48:42,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:48:42,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:48:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94505038] [2025-02-05 15:48:42,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:48:42,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:48:42,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:42,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:48:42,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:42,628 INFO L87 Difference]: Start difference. First operand 473 states and 742 transitions. Second operand has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-05 15:48:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:43,395 INFO L93 Difference]: Finished difference Result 1381 states and 2254 transitions. [2025-02-05 15:48:43,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:48:43,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 114 [2025-02-05 15:48:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:43,403 INFO L225 Difference]: With dead ends: 1381 [2025-02-05 15:48:43,403 INFO L226 Difference]: Without dead ends: 937 [2025-02-05 15:48:43,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 225 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:48:43,406 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 1311 mSDsluCounter, 4159 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 4749 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:43,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 4749 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 15:48:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-05 15:48:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 913. [2025-02-05 15:48:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 730 states have (on average 1.6191780821917807) internal successors, (1182), 737 states have internal predecessors, (1182), 155 states have call successors, (155), 24 states have call predecessors, (155), 27 states have return successors, (176), 153 states have call predecessors, (176), 154 states have call successors, (176) [2025-02-05 15:48:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1513 transitions. [2025-02-05 15:48:43,454 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1513 transitions. Word has length 114 [2025-02-05 15:48:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:43,454 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1513 transitions. [2025-02-05 15:48:43,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-05 15:48:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1513 transitions. [2025-02-05 15:48:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:48:43,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:43,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:48:43,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:48:43,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:48:43,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:43,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:43,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2138109946, now seen corresponding path program 1 times [2025-02-05 15:48:43,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:43,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993258599] [2025-02-05 15:48:43,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:43,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:43,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:48:43,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:48:43,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:43,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:43,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:43,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993258599] [2025-02-05 15:48:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993258599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:43,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251848018] [2025-02-05 15:48:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:43,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:43,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:43,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:43,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:43,728 INFO L87 Difference]: Start difference. First operand 913 states and 1513 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:43,782 INFO L93 Difference]: Finished difference Result 2166 states and 3644 transitions. [2025-02-05 15:48:43,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:43,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-02-05 15:48:43,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:43,792 INFO L225 Difference]: With dead ends: 2166 [2025-02-05 15:48:43,793 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 15:48:43,797 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:48:43,797 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 139 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1212 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:48:43,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1212 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 15:48:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1323. [2025-02-05 15:48:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1061 states have (on average 1.6371347785108388) internal successors, (1737), 1068 states have internal predecessors, (1737), 234 states have call successors, (234), 24 states have call predecessors, (234), 27 states have return successors, (265), 232 states have call predecessors, (265), 233 states have call successors, (265) [2025-02-05 15:48:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2236 transitions. [2025-02-05 15:48:43,891 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2236 transitions. Word has length 117 [2025-02-05 15:48:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:43,892 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 2236 transitions. [2025-02-05 15:48:43,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2236 transitions. [2025-02-05 15:48:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:48:43,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:43,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:43,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:48:43,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:43,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2018668729, now seen corresponding path program 1 times [2025-02-05 15:48:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:43,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873810781] [2025-02-05 15:48:43,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:43,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:48:43,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:48:43,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:43,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:43,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:43,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873810781] [2025-02-05 15:48:43,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873810781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:43,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:43,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701267290] [2025-02-05 15:48:43,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:43,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:43,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:43,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:43,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:43,971 INFO L87 Difference]: Start difference. First operand 1323 states and 2236 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:44,070 INFO L93 Difference]: Finished difference Result 3194 states and 5430 transitions. [2025-02-05 15:48:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:44,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:48:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:44,086 INFO L225 Difference]: With dead ends: 3194 [2025-02-05 15:48:44,086 INFO L226 Difference]: Without dead ends: 2000 [2025-02-05 15:48:44,092 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:48:44,093 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 137 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1192 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:48:44,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1192 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2025-02-05 15:48:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1992. [2025-02-05 15:48:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1611 states have (on average 1.6455617628801986) internal successors, (2651), 1618 states have internal predecessors, (2651), 353 states have call successors, (353), 24 states have call predecessors, (353), 27 states have return successors, (384), 351 states have call predecessors, (384), 352 states have call successors, (384) [2025-02-05 15:48:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 3388 transitions. [2025-02-05 15:48:44,203 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 3388 transitions. Word has length 118 [2025-02-05 15:48:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:44,204 INFO L471 AbstractCegarLoop]: Abstraction has 1992 states and 3388 transitions. [2025-02-05 15:48:44,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 3388 transitions. [2025-02-05 15:48:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:48:44,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:44,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:44,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:48:44,214 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:44,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash 699349093, now seen corresponding path program 1 times [2025-02-05 15:48:44,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:44,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405999291] [2025-02-05 15:48:44,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:44,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:48:44,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:48:44,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:44,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:44,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:44,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405999291] [2025-02-05 15:48:44,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405999291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:44,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:44,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012407051] [2025-02-05 15:48:44,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:44,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:44,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:44,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:44,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:44,278 INFO L87 Difference]: Start difference. First operand 1992 states and 3388 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:44,386 INFO L93 Difference]: Finished difference Result 4761 states and 8157 transitions. [2025-02-05 15:48:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:44,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-02-05 15:48:44,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:44,408 INFO L225 Difference]: With dead ends: 4761 [2025-02-05 15:48:44,408 INFO L226 Difference]: Without dead ends: 3030 [2025-02-05 15:48:44,416 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:48:44,417 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 135 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1187 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:48:44,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1187 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2025-02-05 15:48:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3022. [2025-02-05 15:48:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2479 states have (on average 1.6522791448164582) internal successors, (4096), 2486 states have internal predecessors, (4096), 515 states have call successors, (515), 24 states have call predecessors, (515), 27 states have return successors, (562), 513 states have call predecessors, (562), 514 states have call successors, (562) [2025-02-05 15:48:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 5173 transitions. [2025-02-05 15:48:44,599 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 5173 transitions. Word has length 119 [2025-02-05 15:48:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:44,599 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 5173 transitions. [2025-02-05 15:48:44,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 5173 transitions. [2025-02-05 15:48:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:48:44,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:44,613 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:48:44,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:48:44,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:44,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash -70311800, now seen corresponding path program 1 times [2025-02-05 15:48:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200032926] [2025-02-05 15:48:44,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:44,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:48:44,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:48:44,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:44,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:44,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:44,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200032926] [2025-02-05 15:48:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200032926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:44,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143325281] [2025-02-05 15:48:44,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:44,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:44,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:44,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:44,688 INFO L87 Difference]: Start difference. First operand 3022 states and 5173 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:44,844 INFO L93 Difference]: Finished difference Result 7244 states and 12484 transitions. [2025-02-05 15:48:44,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:44,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-02-05 15:48:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:44,881 INFO L225 Difference]: With dead ends: 7244 [2025-02-05 15:48:44,882 INFO L226 Difference]: Without dead ends: 4698 [2025-02-05 15:48:44,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:44,895 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 133 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1187 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:48:44,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1187 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2025-02-05 15:48:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 4690. [2025-02-05 15:48:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4690 states, 3902 states have (on average 1.6570989236289082) internal successors, (6466), 3909 states have internal predecessors, (6466), 760 states have call successors, (760), 24 states have call predecessors, (760), 27 states have return successors, (833), 758 states have call predecessors, (833), 759 states have call successors, (833) [2025-02-05 15:48:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 8059 transitions. [2025-02-05 15:48:45,211 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 8059 transitions. Word has length 120 [2025-02-05 15:48:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:45,212 INFO L471 AbstractCegarLoop]: Abstraction has 4690 states and 8059 transitions. [2025-02-05 15:48:45,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 8059 transitions. [2025-02-05 15:48:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:48:45,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:45,228 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:48:45,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:48:45,228 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:45,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1166987748, now seen corresponding path program 1 times [2025-02-05 15:48:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158997565] [2025-02-05 15:48:45,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:45,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:48:45,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:48:45,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:45,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:45,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:45,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158997565] [2025-02-05 15:48:45,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158997565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:45,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:45,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:45,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804782839] [2025-02-05 15:48:45,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:45,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:45,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:45,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:45,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:45,304 INFO L87 Difference]: Start difference. First operand 4690 states and 8059 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:45,569 INFO L93 Difference]: Finished difference Result 11389 states and 19705 transitions. [2025-02-05 15:48:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:45,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-02-05 15:48:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:45,629 INFO L225 Difference]: With dead ends: 11389 [2025-02-05 15:48:45,629 INFO L226 Difference]: Without dead ends: 7502 [2025-02-05 15:48:45,649 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:48:45,651 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 131 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1204 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:48:45,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2025-02-05 15:48:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7494. [2025-02-05 15:48:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7494 states, 6213 states have (on average 1.6555609206502495) internal successors, (10286), 6220 states have internal predecessors, (10286), 1253 states have call successors, (1253), 24 states have call predecessors, (1253), 27 states have return successors, (1370), 1251 states have call predecessors, (1370), 1252 states have call successors, (1370) [2025-02-05 15:48:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7494 states to 7494 states and 12909 transitions. [2025-02-05 15:48:46,223 INFO L78 Accepts]: Start accepts. Automaton has 7494 states and 12909 transitions. Word has length 121 [2025-02-05 15:48:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:46,224 INFO L471 AbstractCegarLoop]: Abstraction has 7494 states and 12909 transitions. [2025-02-05 15:48:46,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7494 states and 12909 transitions. [2025-02-05 15:48:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:48:46,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:46,251 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:48:46,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:48:46,251 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:46,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash 538752969, now seen corresponding path program 1 times [2025-02-05 15:48:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:46,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517181460] [2025-02-05 15:48:46,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:46,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:48:46,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:48:46,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:46,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:46,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517181460] [2025-02-05 15:48:46,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517181460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:46,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:46,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:46,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680435246] [2025-02-05 15:48:46,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:46,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:46,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:46,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:46,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:46,330 INFO L87 Difference]: Start difference. First operand 7494 states and 12909 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:46,778 INFO L93 Difference]: Finished difference Result 18899 states and 32765 transitions. [2025-02-05 15:48:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:46,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-05 15:48:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:46,846 INFO L225 Difference]: With dead ends: 18899 [2025-02-05 15:48:46,847 INFO L226 Difference]: Without dead ends: 12604 [2025-02-05 15:48:46,880 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:48:46,881 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 129 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1190 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:48:46,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12604 states. [2025-02-05 15:48:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12604 to 12596. [2025-02-05 15:48:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12596 states, 10493 states have (on average 1.6560564185647575) internal successors, (17377), 10500 states have internal predecessors, (17377), 2075 states have call successors, (2075), 24 states have call predecessors, (2075), 27 states have return successors, (2270), 2073 states have call predecessors, (2270), 2074 states have call successors, (2270) [2025-02-05 15:48:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12596 states to 12596 states and 21722 transitions. [2025-02-05 15:48:47,685 INFO L78 Accepts]: Start accepts. Automaton has 12596 states and 21722 transitions. Word has length 122 [2025-02-05 15:48:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:47,685 INFO L471 AbstractCegarLoop]: Abstraction has 12596 states and 21722 transitions. [2025-02-05 15:48:47,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 12596 states and 21722 transitions. [2025-02-05 15:48:47,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:48:47,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:47,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:48:47,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:48:47,717 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:47,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash -48851581, now seen corresponding path program 1 times [2025-02-05 15:48:47,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:47,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503250887] [2025-02-05 15:48:47,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:47,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:47,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:48:47,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:48:47,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:47,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503250887] [2025-02-05 15:48:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503250887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:47,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452234400] [2025-02-05 15:48:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:47,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:47,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:47,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:47,787 INFO L87 Difference]: Start difference. First operand 12596 states and 21722 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:48,378 INFO L93 Difference]: Finished difference Result 30180 states and 51982 transitions. [2025-02-05 15:48:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-02-05 15:48:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:48,479 INFO L225 Difference]: With dead ends: 30180 [2025-02-05 15:48:48,479 INFO L226 Difference]: Without dead ends: 19780 [2025-02-05 15:48:48,523 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:48:48,524 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 127 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1162 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:48:48,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1162 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19780 states. [2025-02-05 15:48:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19780 to 19772. [2025-02-05 15:48:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19772 states, 16466 states have (on average 1.632819142475404) internal successors, (26886), 16473 states have internal predecessors, (26886), 3278 states have call successors, (3278), 24 states have call predecessors, (3278), 27 states have return successors, (3617), 3276 states have call predecessors, (3617), 3277 states have call successors, (3617) [2025-02-05 15:48:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19772 states to 19772 states and 33781 transitions. [2025-02-05 15:48:49,640 INFO L78 Accepts]: Start accepts. Automaton has 19772 states and 33781 transitions. Word has length 123 [2025-02-05 15:48:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:49,641 INFO L471 AbstractCegarLoop]: Abstraction has 19772 states and 33781 transitions. [2025-02-05 15:48:49,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19772 states and 33781 transitions. [2025-02-05 15:48:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:48:49,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:49,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:48:49,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:48:49,678 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash -715179382, now seen corresponding path program 1 times [2025-02-05 15:48:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498567944] [2025-02-05 15:48:49,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:49,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:49,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:48:49,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:48:49,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:49,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:49,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498567944] [2025-02-05 15:48:49,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498567944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:49,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:49,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:49,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407071696] [2025-02-05 15:48:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:49,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:49,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:49,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:49,757 INFO L87 Difference]: Start difference. First operand 19772 states and 33781 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, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:50,809 INFO L93 Difference]: Finished difference Result 52227 states and 89581 transitions. [2025-02-05 15:48:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:50,810 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, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-02-05 15:48:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:51,026 INFO L225 Difference]: With dead ends: 52227 [2025-02-05 15:48:51,026 INFO L226 Difference]: Without dead ends: 35320 [2025-02-05 15:48:51,099 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:48:51,100 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 125 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1190 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:48:51,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35320 states. [2025-02-05 15:48:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35320 to 35312. [2025-02-05 15:48:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35312 states, 29556 states have (on average 1.630193530924347) internal successors, (48182), 29563 states have internal predecessors, (48182), 5728 states have call successors, (5728), 24 states have call predecessors, (5728), 27 states have return successors, (6341), 5726 states have call predecessors, (6341), 5727 states have call successors, (6341) [2025-02-05 15:48:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35312 states to 35312 states and 60251 transitions. [2025-02-05 15:48:52,938 INFO L78 Accepts]: Start accepts. Automaton has 35312 states and 60251 transitions. Word has length 124 [2025-02-05 15:48:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:52,939 INFO L471 AbstractCegarLoop]: Abstraction has 35312 states and 60251 transitions. [2025-02-05 15:48:52,939 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, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 35312 states and 60251 transitions. [2025-02-05 15:48:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:48:52,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:52,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:48:52,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:48:52,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:52,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash -850827198, now seen corresponding path program 1 times [2025-02-05 15:48:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735713165] [2025-02-05 15:48:52,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:52,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:48:53,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:48:53,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:53,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735713165] [2025-02-05 15:48:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735713165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:53,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:53,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77131773] [2025-02-05 15:48:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:53,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:53,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:53,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:53,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:53,060 INFO L87 Difference]: Start difference. First operand 35312 states and 60251 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, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:55,056 INFO L93 Difference]: Finished difference Result 96294 states and 164828 transitions. [2025-02-05 15:48:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:55,057 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, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-02-05 15:48:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:55,454 INFO L225 Difference]: With dead ends: 96294 [2025-02-05 15:48:55,454 INFO L226 Difference]: Without dead ends: 64794 [2025-02-05 15:48:55,575 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:48:55,576 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 123 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1191 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:48:55,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1191 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64794 states. [2025-02-05 15:48:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64794 to 64786. [2025-02-05 15:48:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64786 states, 54517 states have (on average 1.6265018251187704) internal successors, (88672), 54524 states have internal predecessors, (88672), 10241 states have call successors, (10241), 24 states have call predecessors, (10241), 27 states have return successors, (11386), 10239 states have call predecessors, (11386), 10240 states have call successors, (11386) [2025-02-05 15:48:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64786 states to 64786 states and 110299 transitions. [2025-02-05 15:48:58,935 INFO L78 Accepts]: Start accepts. Automaton has 64786 states and 110299 transitions. Word has length 125 [2025-02-05 15:48:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:58,936 INFO L471 AbstractCegarLoop]: Abstraction has 64786 states and 110299 transitions. [2025-02-05 15:48:58,936 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, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 64786 states and 110299 transitions. [2025-02-05 15:48:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:48:58,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:58,979 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:48:58,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:48:58,979 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:58,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:58,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1323599339, now seen corresponding path program 1 times [2025-02-05 15:48:58,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:58,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830726300] [2025-02-05 15:48:58,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:58,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:59,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:48:59,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:48:59,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:59,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:59,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:59,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830726300] [2025-02-05 15:48:59,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830726300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:59,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:59,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544083536] [2025-02-05 15:48:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:59,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:59,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:59,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:59,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:59,052 INFO L87 Difference]: Start difference. First operand 64786 states and 110299 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, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:49:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:02,608 INFO L93 Difference]: Finished difference Result 121445 states and 207182 transitions. [2025-02-05 15:49:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:02,609 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, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-02-05 15:49:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:03,369 INFO L225 Difference]: With dead ends: 121445 [2025-02-05 15:49:03,369 INFO L226 Difference]: Without dead ends: 121249 [2025-02-05 15:49:03,449 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:49:03,452 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 118 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1204 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:49:03,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121249 states. [2025-02-05 15:49:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121249 to 121241. [2025-02-05 15:49:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121241 states, 102604 states have (on average 1.6216814159292035) internal successors, (166391), 102611 states have internal predecessors, (166391), 18609 states have call successors, (18609), 24 states have call predecessors, (18609), 27 states have return successors, (20800), 18607 states have call predecessors, (20800), 18608 states have call successors, (20800) [2025-02-05 15:49:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121241 states to 121241 states and 205800 transitions. [2025-02-05 15:49:08,321 INFO L78 Accepts]: Start accepts. Automaton has 121241 states and 205800 transitions. Word has length 126 [2025-02-05 15:49:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:08,321 INFO L471 AbstractCegarLoop]: Abstraction has 121241 states and 205800 transitions. [2025-02-05 15:49:08,321 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, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:49:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 121241 states and 205800 transitions. [2025-02-05 15:49:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:49:08,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:08,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:49:08,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:49:08,365 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:08,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash -547310911, now seen corresponding path program 1 times [2025-02-05 15:49:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454731185] [2025-02-05 15:49:08,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:08,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:49:08,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:49:08,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:08,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:49:08,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:08,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454731185] [2025-02-05 15:49:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454731185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:08,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:08,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 15:49:08,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127697607] [2025-02-05 15:49:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:08,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:49:08,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:08,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:49:08,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:49:08,879 INFO L87 Difference]: Start difference. First operand 121241 states and 205800 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-05 15:49:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:15,360 INFO L93 Difference]: Finished difference Result 241558 states and 415520 transitions. [2025-02-05 15:49:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 15:49:15,360 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2025-02-05 15:49:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:16,658 INFO L225 Difference]: With dead ends: 241558 [2025-02-05 15:49:16,658 INFO L226 Difference]: Without dead ends: 241368 [2025-02-05 15:49:16,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:49:16,759 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 1508 mSDsluCounter, 6070 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 6795 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:16,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 6795 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:49:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241368 states.