./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product35.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_spec4_product35.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 0684811b66680ff9a661ea21879b3502eab6dd1ae141cb77fa167c05dd5b0ff9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:45:54,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:45:54,182 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:45:54,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:45:54,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:45:54,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:45:54,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:45:54,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:45:54,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:45:54,204 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:45:54,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:45:54,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:45:54,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:45:54,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:45:54,205 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:45:54,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:45:54,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:45:54,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:45:54,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:45:54,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:45:54,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:45:54,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:45:54,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:45:54,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:45:54,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:45:54,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:45:54,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:45:54,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:45:54,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:45:54,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:45:54,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:45:54,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:45:54,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:45:54,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:45:54,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:45:54,207 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:45:54,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:45:54,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:45:54,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:45:54,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:45:54,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:45:54,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:45:54,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:45:54,207 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 -> 0684811b66680ff9a661ea21879b3502eab6dd1ae141cb77fa167c05dd5b0ff9 [2025-02-05 15:45:54,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:45:54,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:45:54,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:45:54,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:45:54,489 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:45:54,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product35.cil.c [2025-02-05 15:45:55,869 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d9000647/9764fac6f0364bc08d60495ccb29b1ad/FLAG45b00d6a1 [2025-02-05 15:45:56,240 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:45:56,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product35.cil.c [2025-02-05 15:45:56,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d9000647/9764fac6f0364bc08d60495ccb29b1ad/FLAG45b00d6a1 [2025-02-05 15:45:56,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d9000647/9764fac6f0364bc08d60495ccb29b1ad [2025-02-05 15:45:56,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:45:56,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:45:56,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:45:56,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:45:56,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:45:56,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:45:56" (1/1) ... [2025-02-05 15:45:56,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fcd15b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:56, skipping insertion in model container [2025-02-05 15:45:56,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:45:56" (1/1) ... [2025-02-05 15:45:56,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:45:56,571 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_spec4_product35.cil.c[1542,1555] [2025-02-05 15:45:56,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:45:56,918 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:45:56,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-02-05 15:45:56,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [57] [2025-02-05 15:45:56,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [75] [2025-02-05 15:45:56,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [487] [2025-02-05 15:45:56,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [536] [2025-02-05 15:45:56,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1616] [2025-02-05 15:45:56,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1754] [2025-02-05 15:45:56,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1987] [2025-02-05 15:45:56,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2353] [2025-02-05 15:45:56,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2658] [2025-02-05 15:45:56,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [3092] [2025-02-05 15:45:56,930 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_spec4_product35.cil.c[1542,1555] [2025-02-05 15:45:57,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:45:57,070 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:45:57,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57 WrapperNode [2025-02-05 15:45:57,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:45:57,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:45:57,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:45:57,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:45:57,078 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:45:57" (1/1) ... [2025-02-05 15:45:57,094 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:45:57" (1/1) ... [2025-02-05 15:45:57,136 INFO L138 Inliner]: procedures = 137, calls = 227, calls flagged for inlining = 66, calls inlined = 63, statements flattened = 1150 [2025-02-05 15:45:57,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:45:57,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:45:57,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:45:57,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:45:57,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,199 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:45:57,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:45:57,229 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:45:57,229 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:45:57,229 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:45:57,231 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (1/1) ... [2025-02-05 15:45:57,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:45:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:57,273 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:45:57,277 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:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:45:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:45:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:45:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:45:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:45:57,300 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:45:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:45:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:45:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:45:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:45:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:45:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:45:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:45:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:45:57,302 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:45:57,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:45:57,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:45:57,524 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:45:57,527 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:45:57,635 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L394: #res := ~retValue_acc~9; [2025-02-05 15:45:57,649 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2976: #res := ~retValue_acc~43; [2025-02-05 15:45:57,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1205-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~24#1; [2025-02-05 15:45:57,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1250: #res#1 := ~retValue_acc~25#1; [2025-02-05 15:45:57,744 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1474: #res := ~retValue_acc~28; [2025-02-05 15:45:57,760 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1158: #res := ~retValue_acc~23; [2025-02-05 15:45:57,772 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1751-1: createEmail_#res#1 := createEmail_~retValue_acc~34#1; [2025-02-05 15:45:57,785 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L702: #res := ~retValue_acc~17; [2025-02-05 15:45:57,799 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: #res := ~retValue_acc~7; [2025-02-05 15:45:57,843 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: #res := ~retValue_acc~8; [2025-02-05 15:45:57,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L431: #res := ~retValue_acc~10; [2025-02-05 15:45:57,880 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: #res := ~retValue_acc~4; [2025-02-05 15:45:57,932 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028: #res := ~retValue_acc~21; [2025-02-05 15:45:58,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~22#1; [2025-02-05 15:45:58,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L468-1: isVerified_#res#1 := isVerified_~retValue_acc~11#1; [2025-02-05 15:45:58,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L131-1: getEmailId_#res#1 := getEmailId_~retValue_acc~2#1; [2025-02-05 15:45:58,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1593-1: getClientId_#res#1 := getClientId_~retValue_acc~30#1; [2025-02-05 15:45:58,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1546-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~29#1; [2025-02-05 15:45:58,352 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2942-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~41#1; [2025-02-05 15:45:58,353 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L533-1: valid_product_#res#1 := valid_product_~retValue_acc~13#1; [2025-02-05 15:45:58,353 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1313-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~26#1; [2025-02-05 15:45:58,353 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~40#1; [2025-02-05 15:45:58,353 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~42#1; [2025-02-05 15:45:58,353 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1420-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~27#1; [2025-02-05 15:45:58,358 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L168: #res := ~retValue_acc~3; [2025-02-05 15:45:58,368 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727: #res#1 := ~retValue_acc~32#1; [2025-02-05 15:45:58,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1707-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~31#1; [2025-02-05 15:45:58,571 INFO L? ?]: Removed 608 outVars from TransFormulas that were not future-live. [2025-02-05 15:45:58,571 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:45:58,593 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:45:58,593 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:45:58,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:45:58 BoogieIcfgContainer [2025-02-05 15:45:58,593 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:45:58,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:45:58,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:45:58,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:45:58,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:45:56" (1/3) ... [2025-02-05 15:45:58,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d97dfad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:45:58, skipping insertion in model container [2025-02-05 15:45:58,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:57" (2/3) ... [2025-02-05 15:45:58,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d97dfad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:45:58, skipping insertion in model container [2025-02-05 15:45:58,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:45:58" (3/3) ... [2025-02-05 15:45:58,601 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product35.cil.c [2025-02-05 15:45:58,614 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:45:58,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product35.cil.c that has 30 procedures, 465 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:45:58,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:45:58,692 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;@3ba1a5b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:45:58,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:45:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 465 states, 359 states have (on average 1.5348189415041782) internal successors, (551), 364 states have internal predecessors, (551), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 15:45:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:45:58,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:58,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:58,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:58,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1669545940, now seen corresponding path program 1 times [2025-02-05 15:45:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:58,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050601087] [2025-02-05 15:45:58,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:58,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:45:58,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:45:58,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:58,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:59,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:59,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050601087] [2025-02-05 15:45:59,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050601087] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:59,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496689464] [2025-02-05 15:45:59,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:59,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:59,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:59,325 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:45:59,327 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:45:59,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:45:59,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:45:59,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:59,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:59,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:45:59,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:45:59,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496689464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:59,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:59,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:45:59,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318519240] [2025-02-05 15:45:59,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:59,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:45:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:59,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:45:59,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:59,715 INFO L87 Difference]: Start difference. First operand has 465 states, 359 states have (on average 1.5348189415041782) internal successors, (551), 364 states have internal predecessors, (551), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:45:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:59,777 INFO L93 Difference]: Finished difference Result 733 states and 1086 transitions. [2025-02-05 15:45:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:45:59,779 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2025-02-05 15:45:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:59,791 INFO L225 Difference]: With dead ends: 733 [2025-02-05 15:45:59,791 INFO L226 Difference]: Without dead ends: 458 [2025-02-05 15:45:59,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 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:45:59,796 INFO L435 NwaCegarLoop]: 698 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, 698 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:45:59,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-02-05 15:45:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2025-02-05 15:45:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 353 states have (on average 1.5325779036827196) internal successors, (541), 357 states have internal predecessors, (541), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 15:45:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 690 transitions. [2025-02-05 15:45:59,847 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 690 transitions. Word has length 135 [2025-02-05 15:45:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:59,849 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 690 transitions. [2025-02-05 15:45:59,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:45:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 690 transitions. [2025-02-05 15:45:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:45:59,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:59,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:59,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:46:00,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:46:00,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1924537389, now seen corresponding path program 1 times [2025-02-05 15:46:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:00,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609978549] [2025-02-05 15:46:00,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:00,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:46:00,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:46:00,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:00,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:00,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609978549] [2025-02-05 15:46:00,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609978549] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:00,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834007162] [2025-02-05 15:46:00,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:00,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:00,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:00,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:00,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:46:00,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:46:00,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:46:00,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:00,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:00,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:46:00,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:46:00,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:00,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834007162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:00,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:00,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:00,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668402900] [2025-02-05 15:46:00,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:00,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:00,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:00,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:00,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:00,716 INFO L87 Difference]: Start difference. First operand 458 states and 690 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:00,744 INFO L93 Difference]: Finished difference Result 722 states and 1064 transitions. [2025-02-05 15:46:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:00,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-02-05 15:46:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:00,749 INFO L225 Difference]: With dead ends: 722 [2025-02-05 15:46:00,749 INFO L226 Difference]: Without dead ends: 460 [2025-02-05 15:46:00,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:00,751 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 0 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:00,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1376 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-02-05 15:46:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2025-02-05 15:46:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 359 states have internal predecessors, (543), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 15:46:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 692 transitions. [2025-02-05 15:46:00,792 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 692 transitions. Word has length 136 [2025-02-05 15:46:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:00,792 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 692 transitions. [2025-02-05 15:46:00,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 692 transitions. [2025-02-05 15:46:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 15:46:00,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:00,800 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:00,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:01,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:01,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:01,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1321423575, now seen corresponding path program 1 times [2025-02-05 15:46:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:01,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759392682] [2025-02-05 15:46:01,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:01,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:46:01,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:46:01,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:01,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:46:01,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:01,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759392682] [2025-02-05 15:46:01,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759392682] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:01,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712026642] [2025-02-05 15:46:01,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:01,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:01,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:01,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:01,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:46:01,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:46:01,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:46:01,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:01,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:01,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:01,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:46:01,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:01,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712026642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:01,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620948857] [2025-02-05 15:46:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:01,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:01,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:01,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:01,758 INFO L87 Difference]: Start difference. First operand 460 states and 692 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:01,796 INFO L93 Difference]: Finished difference Result 972 states and 1483 transitions. [2025-02-05 15:46:01,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:01,796 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-02-05 15:46:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:01,799 INFO L225 Difference]: With dead ends: 972 [2025-02-05 15:46:01,801 INFO L226 Difference]: Without dead ends: 539 [2025-02-05 15:46:01,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:01,803 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 142 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:01,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1336 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-05 15:46:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 531. [2025-02-05 15:46:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 412 states have (on average 1.5509708737864079) internal successors, (639), 416 states have internal predecessors, (639), 89 states have call successors, (89), 29 states have call predecessors, (89), 29 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 15:46:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 816 transitions. [2025-02-05 15:46:01,829 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 816 transitions. Word has length 144 [2025-02-05 15:46:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:01,830 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 816 transitions. [2025-02-05 15:46:01,830 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 816 transitions. [2025-02-05 15:46:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:46:01,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:01,832 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:01,842 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:46:02,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:02,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:02,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:02,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1050507543, now seen corresponding path program 1 times [2025-02-05 15:46:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:02,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588041568] [2025-02-05 15:46:02,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:02,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:02,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:46:02,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:46:02,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:02,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:46:02,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:02,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588041568] [2025-02-05 15:46:02,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588041568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:02,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297939024] [2025-02-05 15:46:02,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:02,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:02,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:02,263 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:02,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:46:02,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:46:02,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:46:02,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:02,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:02,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:46:02,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:46:02,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:02,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297939024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:02,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:02,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:46:02,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160475764] [2025-02-05 15:46:02,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:02,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:02,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:02,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:02,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:02,569 INFO L87 Difference]: Start difference. First operand 531 states and 816 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:02,636 INFO L93 Difference]: Finished difference Result 1053 states and 1622 transitions. [2025-02-05 15:46:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:02,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-02-05 15:46:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:02,641 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 15:46:02,641 INFO L226 Difference]: Without dead ends: 533 [2025-02-05 15:46:02,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:02,645 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 2 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:02,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2717 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-05 15:46:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-02-05 15:46:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 413 states have (on average 1.549636803874092) internal successors, (640), 418 states have internal predecessors, (640), 89 states have call successors, (89), 29 states have call predecessors, (89), 30 states have return successors, (90), 87 states have call predecessors, (90), 88 states have call successors, (90) [2025-02-05 15:46:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 819 transitions. [2025-02-05 15:46:02,673 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 819 transitions. Word has length 126 [2025-02-05 15:46:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:02,673 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 819 transitions. [2025-02-05 15:46:02,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 819 transitions. [2025-02-05 15:46:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:46:02,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:02,676 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:02,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:46:02,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:02,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:02,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash -420335031, now seen corresponding path program 1 times [2025-02-05 15:46:02,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:02,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970809396] [2025-02-05 15:46:02,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:02,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:02,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:46:02,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:46:02,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:02,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:46:03,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:03,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970809396] [2025-02-05 15:46:03,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970809396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:03,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518106898] [2025-02-05 15:46:03,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:03,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:03,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:03,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:03,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:46:03,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:46:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:46:03,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:03,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:03,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:46:03,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:46:03,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:03,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518106898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:03,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:03,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:46:03,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490935015] [2025-02-05 15:46:03,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:03,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:03,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:03,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:03,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:03,431 INFO L87 Difference]: Start difference. First operand 533 states and 819 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:46:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:03,492 INFO L93 Difference]: Finished difference Result 1055 states and 1627 transitions. [2025-02-05 15:46:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:03,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2025-02-05 15:46:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:03,499 INFO L225 Difference]: With dead ends: 1055 [2025-02-05 15:46:03,499 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:46:03,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:03,505 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 2 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:03,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2703 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:46:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-02-05 15:46:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 420 states have internal predecessors, (641), 89 states have call successors, (89), 29 states have call predecessors, (89), 31 states have return successors, (95), 87 states have call predecessors, (95), 88 states have call successors, (95) [2025-02-05 15:46:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 825 transitions. [2025-02-05 15:46:03,540 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 825 transitions. Word has length 146 [2025-02-05 15:46:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:03,541 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 825 transitions. [2025-02-05 15:46:03,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:46:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 825 transitions. [2025-02-05 15:46:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:46:03,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:03,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:03,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:03,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:03,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:03,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash 290045101, now seen corresponding path program 1 times [2025-02-05 15:46:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:03,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278924733] [2025-02-05 15:46:03,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:03,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:46:03,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:46:03,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:03,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:46:03,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:03,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278924733] [2025-02-05 15:46:03,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278924733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:03,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:03,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795560811] [2025-02-05 15:46:03,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:03,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:03,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:03,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:03,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:03,959 INFO L87 Difference]: Start difference. First operand 535 states and 825 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:46:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:03,999 INFO L93 Difference]: Finished difference Result 1047 states and 1618 transitions. [2025-02-05 15:46:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:03,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-02-05 15:46:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:04,002 INFO L225 Difference]: With dead ends: 1047 [2025-02-05 15:46:04,002 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:46:04,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:04,006 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 2 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:04,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2721 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:46:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-02-05 15:46:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 420 states have internal predecessors, (641), 89 states have call successors, (89), 29 states have call predecessors, (89), 31 states have return successors, (94), 87 states have call predecessors, (94), 88 states have call successors, (94) [2025-02-05 15:46:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 824 transitions. [2025-02-05 15:46:04,031 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 824 transitions. Word has length 147 [2025-02-05 15:46:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:04,032 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 824 transitions. [2025-02-05 15:46:04,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:46:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 824 transitions. [2025-02-05 15:46:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:46:04,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:04,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:04,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:46:04,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:04,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1037535670, now seen corresponding path program 2 times [2025-02-05 15:46:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880189491] [2025-02-05 15:46:04,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:46:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:04,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-02-05 15:46:04,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 148 statements. [2025-02-05 15:46:04,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:46:04,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:46:04,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:04,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880189491] [2025-02-05 15:46:04,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880189491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:04,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:04,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:46:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810278276] [2025-02-05 15:46:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:04,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:46:04,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:04,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:46:04,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:04,228 INFO L87 Difference]: Start difference. First operand 535 states and 824 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:04,608 INFO L93 Difference]: Finished difference Result 1080 states and 1673 transitions. [2025-02-05 15:46:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:46:04,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2025-02-05 15:46:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:04,616 INFO L225 Difference]: With dead ends: 1080 [2025-02-05 15:46:04,616 INFO L226 Difference]: Without dead ends: 1076 [2025-02-05 15:46:04,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:46:04,618 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1141 mSDsluCounter, 3328 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:04,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 4032 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:46:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-02-05 15:46:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1065. [2025-02-05 15:46:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 826 states have (on average 1.5520581113801453) internal successors, (1282), 835 states have internal predecessors, (1282), 176 states have call successors, (176), 59 states have call predecessors, (176), 62 states have return successors, (191), 174 states have call predecessors, (191), 174 states have call successors, (191) [2025-02-05 15:46:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1649 transitions. [2025-02-05 15:46:04,675 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1649 transitions. Word has length 148 [2025-02-05 15:46:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:04,676 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1649 transitions. [2025-02-05 15:46:04,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1649 transitions. [2025-02-05 15:46:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:46:04,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:04,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:04,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:46:04,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:04,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1763564575, now seen corresponding path program 1 times [2025-02-05 15:46:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:04,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555003788] [2025-02-05 15:46:04,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:04,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:04,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:46:04,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:46:04,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:04,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:46:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555003788] [2025-02-05 15:46:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555003788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:04,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:04,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588044515] [2025-02-05 15:46:04,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:04,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:04,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:04,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:04,828 INFO L87 Difference]: Start difference. First operand 1065 states and 1649 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:04,887 INFO L93 Difference]: Finished difference Result 2099 states and 3258 transitions. [2025-02-05 15:46:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:04,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 130 [2025-02-05 15:46:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:04,895 INFO L225 Difference]: With dead ends: 2099 [2025-02-05 15:46:04,895 INFO L226 Difference]: Without dead ends: 1069 [2025-02-05 15:46:04,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:04,899 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 1 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:04,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2724 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-02-05 15:46:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2025-02-05 15:46:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 828 states have (on average 1.5507246376811594) internal successors, (1284), 839 states have internal predecessors, (1284), 176 states have call successors, (176), 59 states have call predecessors, (176), 64 states have return successors, (194), 174 states have call predecessors, (194), 174 states have call successors, (194) [2025-02-05 15:46:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1654 transitions. [2025-02-05 15:46:04,940 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1654 transitions. Word has length 130 [2025-02-05 15:46:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:04,940 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1654 transitions. [2025-02-05 15:46:04,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:46:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1654 transitions. [2025-02-05 15:46:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:46:04,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:04,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:04,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:46:04,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:04,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1794452514, now seen corresponding path program 1 times [2025-02-05 15:46:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:04,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592384921] [2025-02-05 15:46:04,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:04,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:46:04,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:46:04,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:04,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:46:05,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:05,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592384921] [2025-02-05 15:46:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592384921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:05,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:05,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:46:05,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38605872] [2025-02-05 15:46:05,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:05,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:46:05,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:05,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:46:05,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:05,112 INFO L87 Difference]: Start difference. First operand 1069 states and 1654 transitions. Second operand has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 15:46:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:05,237 INFO L93 Difference]: Finished difference Result 2097 states and 3250 transitions. [2025-02-05 15:46:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:46:05,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 150 [2025-02-05 15:46:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:05,244 INFO L225 Difference]: With dead ends: 2097 [2025-02-05 15:46:05,244 INFO L226 Difference]: Without dead ends: 1073 [2025-02-05 15:46:05,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:46:05,250 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 7 mSDsluCounter, 4015 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4689 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:05,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4689 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:46:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-02-05 15:46:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1071. [2025-02-05 15:46:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 830 states have (on average 1.5493975903614459) internal successors, (1286), 840 states have internal predecessors, (1286), 176 states have call successors, (176), 60 states have call predecessors, (176), 64 states have return successors, (192), 174 states have call predecessors, (192), 174 states have call successors, (192) [2025-02-05 15:46:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1654 transitions. [2025-02-05 15:46:05,300 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1654 transitions. Word has length 150 [2025-02-05 15:46:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:05,300 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1654 transitions. [2025-02-05 15:46:05,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 15:46:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1654 transitions. [2025-02-05 15:46:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:46:05,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:05,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:05,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:46:05,307 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:05,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:05,307 INFO L85 PathProgramCache]: Analyzing trace with hash -783700895, now seen corresponding path program 1 times [2025-02-05 15:46:05,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:05,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840007156] [2025-02-05 15:46:05,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:05,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:46:05,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:46:05,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:05,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:46:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840007156] [2025-02-05 15:46:05,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840007156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:05,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:05,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:46:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293814941] [2025-02-05 15:46:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:05,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:46:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:05,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:46:05,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:05,480 INFO L87 Difference]: Start difference. First operand 1071 states and 1654 transitions. Second operand has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:46:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:05,635 INFO L93 Difference]: Finished difference Result 2111 states and 3270 transitions. [2025-02-05 15:46:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:46:05,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 132 [2025-02-05 15:46:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:05,644 INFO L225 Difference]: With dead ends: 2111 [2025-02-05 15:46:05,645 INFO L226 Difference]: Without dead ends: 1081 [2025-02-05 15:46:05,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:46:05,649 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 5 mSDsluCounter, 4027 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:05,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4703 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:46:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-02-05 15:46:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2025-02-05 15:46:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 836 states have (on average 1.5454545454545454) internal successors, (1292), 847 states have internal predecessors, (1292), 176 states have call successors, (176), 61 states have call predecessors, (176), 66 states have return successors, (199), 174 states have call predecessors, (199), 174 states have call successors, (199) [2025-02-05 15:46:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1667 transitions. [2025-02-05 15:46:05,712 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1667 transitions. Word has length 132 [2025-02-05 15:46:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:05,712 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1667 transitions. [2025-02-05 15:46:05,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:46:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1667 transitions. [2025-02-05 15:46:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:46:05,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:05,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:05,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:46:05,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:05,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash 538976507, now seen corresponding path program 1 times [2025-02-05 15:46:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:05,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754969562] [2025-02-05 15:46:05,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:05,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:46:05,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:46:05,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:05,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:46:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754969562] [2025-02-05 15:46:05,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754969562] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266162743] [2025-02-05 15:46:05,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:05,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:05,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:05,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:46:06,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:46:06,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:46:06,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:06,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:06,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:06,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:46:06,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:46:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:46:06,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266162743] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:46:06,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:46:06,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:46:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122680759] [2025-02-05 15:46:06,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:46:06,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:46:06,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:06,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:46:06,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:06,297 INFO L87 Difference]: Start difference. First operand 1079 states and 1667 transitions. Second operand has 11 states, 10 states have (on average 15.3) internal successors, (153), 11 states have internal predecessors, (153), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-05 15:46:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:06,914 INFO L93 Difference]: Finished difference Result 3029 states and 4886 transitions. [2025-02-05 15:46:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:46:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.3) internal successors, (153), 11 states have internal predecessors, (153), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 152 [2025-02-05 15:46:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:06,924 INFO L225 Difference]: With dead ends: 3029 [2025-02-05 15:46:06,924 INFO L226 Difference]: Without dead ends: 2005 [2025-02-05 15:46:06,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:46:06,927 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 1560 mSDsluCounter, 4190 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 4882 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:06,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 4882 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:46:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2025-02-05 15:46:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1957. [2025-02-05 15:46:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1556 states have (on average 1.6041131105398458) internal successors, (2496), 1566 states have internal predecessors, (2496), 334 states have call successors, (334), 62 states have call predecessors, (334), 66 states have return successors, (382), 332 states have call predecessors, (382), 332 states have call successors, (382) [2025-02-05 15:46:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3212 transitions. [2025-02-05 15:46:06,999 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3212 transitions. Word has length 152 [2025-02-05 15:46:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:07,001 INFO L471 AbstractCegarLoop]: Abstraction has 1957 states and 3212 transitions. [2025-02-05 15:46:07,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.3) internal successors, (153), 11 states have internal predecessors, (153), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-05 15:46:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3212 transitions. [2025-02-05 15:46:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 15:46:07,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:07,008 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:07,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:07,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:46:07,208 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:07,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1008186847, now seen corresponding path program 1 times [2025-02-05 15:46:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:07,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84787622] [2025-02-05 15:46:07,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:07,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:07,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 15:46:07,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 15:46:07,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:07,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:46:07,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:07,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84787622] [2025-02-05 15:46:07,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84787622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:07,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:07,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310458673] [2025-02-05 15:46:07,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:07,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:07,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:07,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:07,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:07,264 INFO L87 Difference]: Start difference. First operand 1957 states and 3212 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:07,364 INFO L93 Difference]: Finished difference Result 4601 states and 7678 transitions. [2025-02-05 15:46:07,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:07,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2025-02-05 15:46:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:07,377 INFO L225 Difference]: With dead ends: 4601 [2025-02-05 15:46:07,378 INFO L226 Difference]: Without dead ends: 2793 [2025-02-05 15:46:07,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:07,383 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 139 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:07,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1387 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2025-02-05 15:46:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2777. [2025-02-05 15:46:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2218 states have (on average 1.6257889990982868) internal successors, (3606), 2228 states have internal predecessors, (3606), 492 states have call successors, (492), 62 states have call predecessors, (492), 66 states have return successors, (565), 490 states have call predecessors, (565), 490 states have call successors, (565) [2025-02-05 15:46:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 4663 transitions. [2025-02-05 15:46:07,485 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 4663 transitions. Word has length 155 [2025-02-05 15:46:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:07,485 INFO L471 AbstractCegarLoop]: Abstraction has 2777 states and 4663 transitions. [2025-02-05 15:46:07,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 4663 transitions. [2025-02-05 15:46:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 15:46:07,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:07,496 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:07,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:46:07,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:07,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:07,497 INFO L85 PathProgramCache]: Analyzing trace with hash 779991731, now seen corresponding path program 1 times [2025-02-05 15:46:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:07,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168047276] [2025-02-05 15:46:07,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:07,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:07,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 15:46:07,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 15:46:07,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:07,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:46:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:07,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168047276] [2025-02-05 15:46:07,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168047276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:07,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:07,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:07,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505837532] [2025-02-05 15:46:07,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:07,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:07,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:07,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:07,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:07,550 INFO L87 Difference]: Start difference. First operand 2777 states and 4663 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:07,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:07,686 INFO L93 Difference]: Finished difference Result 6657 states and 11275 transitions. [2025-02-05 15:46:07,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:07,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-05 15:46:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:07,703 INFO L225 Difference]: With dead ends: 6657 [2025-02-05 15:46:07,704 INFO L226 Difference]: Without dead ends: 4131 [2025-02-05 15:46:07,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:07,710 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 137 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:07,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1380 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2025-02-05 15:46:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4115. [2025-02-05 15:46:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4115 states, 3318 states have (on average 1.6377335744424353) internal successors, (5434), 3328 states have internal predecessors, (5434), 730 states have call successors, (730), 62 states have call predecessors, (730), 66 states have return successors, (819), 728 states have call predecessors, (819), 728 states have call successors, (819) [2025-02-05 15:46:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 6983 transitions. [2025-02-05 15:46:07,853 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 6983 transitions. Word has length 156 [2025-02-05 15:46:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:07,853 INFO L471 AbstractCegarLoop]: Abstraction has 4115 states and 6983 transitions. [2025-02-05 15:46:07,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 6983 transitions. [2025-02-05 15:46:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:46:07,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:07,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:07,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:46:07,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:07,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash -965891355, now seen corresponding path program 1 times [2025-02-05 15:46:07,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:07,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984457064] [2025-02-05 15:46:07,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:07,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:46:07,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:46:07,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:07,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:07,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984457064] [2025-02-05 15:46:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984457064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:07,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:07,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477237994] [2025-02-05 15:46:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:07,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:07,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:07,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:07,922 INFO L87 Difference]: Start difference. First operand 4115 states and 6983 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:08,130 INFO L93 Difference]: Finished difference Result 9791 states and 16763 transitions. [2025-02-05 15:46:08,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:08,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-02-05 15:46:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:08,169 INFO L225 Difference]: With dead ends: 9791 [2025-02-05 15:46:08,170 INFO L226 Difference]: Without dead ends: 6191 [2025-02-05 15:46:08,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:08,185 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 135 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:08,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1367 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2025-02-05 15:46:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 6175. [2025-02-05 15:46:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6175 states, 5054 states have (on average 1.6470122675108825) internal successors, (8324), 5064 states have internal predecessors, (8324), 1054 states have call successors, (1054), 62 states have call predecessors, (1054), 66 states have return successors, (1193), 1052 states have call predecessors, (1193), 1052 states have call successors, (1193) [2025-02-05 15:46:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6175 states to 6175 states and 10571 transitions. [2025-02-05 15:46:08,471 INFO L78 Accepts]: Start accepts. Automaton has 6175 states and 10571 transitions. Word has length 138 [2025-02-05 15:46:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:08,471 INFO L471 AbstractCegarLoop]: Abstraction has 6175 states and 10571 transitions. [2025-02-05 15:46:08,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6175 states and 10571 transitions. [2025-02-05 15:46:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 15:46:08,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:08,497 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:08,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:46:08,497 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:08,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1576708844, now seen corresponding path program 1 times [2025-02-05 15:46:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:08,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922805901] [2025-02-05 15:46:08,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:08,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:46:08,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:46:08,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:08,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:46:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:08,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922805901] [2025-02-05 15:46:08,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922805901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:08,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:08,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:08,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535946184] [2025-02-05 15:46:08,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:08,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:08,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:08,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:08,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:08,597 INFO L87 Difference]: Start difference. First operand 6175 states and 10571 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:08,792 INFO L93 Difference]: Finished difference Result 14757 states and 25469 transitions. [2025-02-05 15:46:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:08,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2025-02-05 15:46:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:08,841 INFO L225 Difference]: With dead ends: 14757 [2025-02-05 15:46:08,841 INFO L226 Difference]: Without dead ends: 9527 [2025-02-05 15:46:08,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:08,859 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 133 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:08,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1367 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9527 states. [2025-02-05 15:46:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9527 to 9511. [2025-02-05 15:46:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9511 states, 7900 states have (on average 1.6536708860759495) internal successors, (13064), 7910 states have internal predecessors, (13064), 1544 states have call successors, (1544), 62 states have call predecessors, (1544), 66 states have return successors, (1766), 1542 states have call predecessors, (1766), 1542 states have call successors, (1766) [2025-02-05 15:46:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9511 states to 9511 states and 16374 transitions. [2025-02-05 15:46:09,243 INFO L78 Accepts]: Start accepts. Automaton has 9511 states and 16374 transitions. Word has length 158 [2025-02-05 15:46:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:09,243 INFO L471 AbstractCegarLoop]: Abstraction has 9511 states and 16374 transitions. [2025-02-05 15:46:09,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 9511 states and 16374 transitions. [2025-02-05 15:46:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 15:46:09,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:09,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:09,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:46:09,274 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:09,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2112895423, now seen corresponding path program 1 times [2025-02-05 15:46:09,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:09,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190936745] [2025-02-05 15:46:09,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:09,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:09,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:46:09,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:46:09,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:09,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:46:09,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:09,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190936745] [2025-02-05 15:46:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190936745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766731276] [2025-02-05 15:46:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:09,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:09,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:09,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:09,331 INFO L87 Difference]: Start difference. First operand 9511 states and 16374 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:09,629 INFO L93 Difference]: Finished difference Result 23047 states and 40002 transitions. [2025-02-05 15:46:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:09,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 159 [2025-02-05 15:46:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:09,689 INFO L225 Difference]: With dead ends: 23047 [2025-02-05 15:46:09,689 INFO L226 Difference]: Without dead ends: 15135 [2025-02-05 15:46:09,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:09,717 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 131 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:09,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1374 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15135 states. [2025-02-05 15:46:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15135 to 15119. [2025-02-05 15:46:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15119 states, 12522 states have (on average 1.653409998402811) internal successors, (20704), 12532 states have internal predecessors, (20704), 2530 states have call successors, (2530), 62 states have call predecessors, (2530), 66 states have return successors, (2896), 2528 states have call predecessors, (2896), 2528 states have call successors, (2896) [2025-02-05 15:46:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15119 states to 15119 states and 26130 transitions. [2025-02-05 15:46:10,416 INFO L78 Accepts]: Start accepts. Automaton has 15119 states and 26130 transitions. Word has length 159 [2025-02-05 15:46:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:10,417 INFO L471 AbstractCegarLoop]: Abstraction has 15119 states and 26130 transitions. [2025-02-05 15:46:10,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 15119 states and 26130 transitions. [2025-02-05 15:46:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:46:10,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:10,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:10,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:46:10,465 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:10,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash 351478000, now seen corresponding path program 1 times [2025-02-05 15:46:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816760832] [2025-02-05 15:46:10,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:10,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 15:46:10,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 15:46:10,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:10,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:10,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:10,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816760832] [2025-02-05 15:46:10,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816760832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:10,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:10,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:10,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845977501] [2025-02-05 15:46:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:10,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:10,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:10,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:10,526 INFO L87 Difference]: Start difference. First operand 15119 states and 26130 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:11,127 INFO L93 Difference]: Finished difference Result 38067 states and 66194 transitions. [2025-02-05 15:46:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:11,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-02-05 15:46:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:11,230 INFO L225 Difference]: With dead ends: 38067 [2025-02-05 15:46:11,231 INFO L226 Difference]: Without dead ends: 25339 [2025-02-05 15:46:11,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:11,269 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 129 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:11,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1370 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25339 states. [2025-02-05 15:46:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25339 to 25323. [2025-02-05 15:46:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25323 states, 21082 states have (on average 1.654776586661607) internal successors, (34886), 21092 states have internal predecessors, (34886), 4174 states have call successors, (4174), 62 states have call predecessors, (4174), 66 states have return successors, (4729), 4172 states have call predecessors, (4729), 4172 states have call successors, (4729) [2025-02-05 15:46:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25323 states to 25323 states and 43789 transitions. [2025-02-05 15:46:12,236 INFO L78 Accepts]: Start accepts. Automaton has 25323 states and 43789 transitions. Word has length 141 [2025-02-05 15:46:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:12,237 INFO L471 AbstractCegarLoop]: Abstraction has 25323 states and 43789 transitions. [2025-02-05 15:46:12,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 25323 states and 43789 transitions. [2025-02-05 15:46:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:46:12,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:12,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:12,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:46:12,295 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:12,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash 419219655, now seen corresponding path program 1 times [2025-02-05 15:46:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837279624] [2025-02-05 15:46:12,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:12,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:46:12,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:46:12,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:12,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:12,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837279624] [2025-02-05 15:46:12,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837279624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:12,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:12,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192035681] [2025-02-05 15:46:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:12,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:12,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:12,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:12,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:12,349 INFO L87 Difference]: Start difference. First operand 25323 states and 43789 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:13,415 INFO L93 Difference]: Finished difference Result 60629 states and 104804 transitions. [2025-02-05 15:46:13,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:13,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-02-05 15:46:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:13,579 INFO L225 Difference]: With dead ends: 60629 [2025-02-05 15:46:13,579 INFO L226 Difference]: Without dead ends: 39691 [2025-02-05 15:46:13,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:13,628 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 127 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:13,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1342 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39691 states. [2025-02-05 15:46:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39691 to 39675. [2025-02-05 15:46:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39675 states, 33028 states have (on average 1.63206975899237) internal successors, (53904), 33038 states have internal predecessors, (53904), 6580 states have call successors, (6580), 62 states have call predecessors, (6580), 66 states have return successors, (7560), 6578 states have call predecessors, (7560), 6578 states have call successors, (7560) [2025-02-05 15:46:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39675 states to 39675 states and 68044 transitions. [2025-02-05 15:46:15,377 INFO L78 Accepts]: Start accepts. Automaton has 39675 states and 68044 transitions. Word has length 142 [2025-02-05 15:46:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:15,377 INFO L471 AbstractCegarLoop]: Abstraction has 39675 states and 68044 transitions. [2025-02-05 15:46:15,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 39675 states and 68044 transitions. [2025-02-05 15:46:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:46:15,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:15,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:15,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:46:15,435 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:15,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash -739477841, now seen corresponding path program 1 times [2025-02-05 15:46:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:15,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010075776] [2025-02-05 15:46:15,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:15,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:15,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:46:15,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:46:15,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:15,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010075776] [2025-02-05 15:46:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010075776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:15,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:15,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:15,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280120989] [2025-02-05 15:46:15,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:15,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:15,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:15,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:15,492 INFO L87 Difference]: Start difference. First operand 39675 states and 68044 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:17,293 INFO L93 Difference]: Finished difference Result 104723 states and 180405 transitions. [2025-02-05 15:46:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:17,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2025-02-05 15:46:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:17,617 INFO L225 Difference]: With dead ends: 104723 [2025-02-05 15:46:17,618 INFO L226 Difference]: Without dead ends: 70771 [2025-02-05 15:46:17,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:17,733 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 125 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:17,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1370 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70771 states. [2025-02-05 15:46:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70771 to 70755. [2025-02-05 15:46:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70755 states, 59208 states have (on average 1.6297797594919605) internal successors, (96496), 59218 states have internal predecessors, (96496), 11480 states have call successors, (11480), 62 states have call predecessors, (11480), 66 states have return successors, (13274), 11478 states have call predecessors, (13274), 11478 states have call successors, (13274) [2025-02-05 15:46:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70755 states to 70755 states and 121250 transitions. [2025-02-05 15:46:20,195 INFO L78 Accepts]: Start accepts. Automaton has 70755 states and 121250 transitions. Word has length 143 [2025-02-05 15:46:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:20,196 INFO L471 AbstractCegarLoop]: Abstraction has 70755 states and 121250 transitions. [2025-02-05 15:46:20,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:46:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 70755 states and 121250 transitions. [2025-02-05 15:46:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 15:46:20,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:20,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:46:20,566 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:20,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash 329086429, now seen corresponding path program 1 times [2025-02-05 15:46:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:20,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156032867] [2025-02-05 15:46:20,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:20,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 15:46:20,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 15:46:20,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:20,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:46:20,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:20,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156032867] [2025-02-05 15:46:20,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156032867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:20,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:20,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:20,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861233732] [2025-02-05 15:46:20,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:20,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:20,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:20,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:20,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:20,734 INFO L87 Difference]: Start difference. First operand 70755 states and 121250 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:24,151 INFO L93 Difference]: Finished difference Result 192857 states and 331119 transitions. [2025-02-05 15:46:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:24,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-02-05 15:46:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:24,703 INFO L225 Difference]: With dead ends: 192857 [2025-02-05 15:46:24,703 INFO L226 Difference]: Without dead ends: 129719 [2025-02-05 15:46:24,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:24,978 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 123 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:24,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1373 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129719 states. [2025-02-05 15:46:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129719 to 129703. [2025-02-05 15:46:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129703 states, 109130 states have (on average 1.6262805827911666) internal successors, (177476), 109140 states have internal predecessors, (177476), 20506 states have call successors, (20506), 62 states have call predecessors, (20506), 66 states have return successors, (23364), 20504 states have call predecessors, (23364), 20504 states have call successors, (23364) [2025-02-05 15:46:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129703 states to 129703 states and 221346 transitions. [2025-02-05 15:46:29,405 INFO L78 Accepts]: Start accepts. Automaton has 129703 states and 221346 transitions. Word has length 163 [2025-02-05 15:46:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:29,410 INFO L471 AbstractCegarLoop]: Abstraction has 129703 states and 221346 transitions. [2025-02-05 15:46:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:46:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 129703 states and 221346 transitions. [2025-02-05 15:46:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:46:30,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:30,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:30,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:46:30,381 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:30,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:30,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230030, now seen corresponding path program 1 times [2025-02-05 15:46:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106308612] [2025-02-05 15:46:30,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:30,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:46:30,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:46:30,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:30,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106308612] [2025-02-05 15:46:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106308612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495961065] [2025-02-05 15:46:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:30,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:30,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:30,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:30,438 INFO L87 Difference]: Start difference. First operand 129703 states and 221346 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)