./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec11_product26.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f29a19c3efa542dcf2ceb090606fb32840c0b6e985b77630bcd852a7818d8a39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:40:56,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:40:56,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:40:56,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:40:56,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:40:56,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:40:56,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:40:56,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:40:56,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:40:56,703 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:40:56,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:40:56,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:40:56,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:40:56,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:40:56,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:40:56,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:40:56,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:40:56,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:40:56,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:40:56,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:40:56,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:40:56,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:40:56,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:56,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:40:56,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:40:56,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:40:56,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:40:56,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:40:56,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:40:56,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:40:56,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:40:56,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:40:56,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:40:56,707 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 -> f29a19c3efa542dcf2ceb090606fb32840c0b6e985b77630bcd852a7818d8a39 [2025-02-05 15:40:56,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:40:56,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:40:56,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:40:56,992 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:40:56,992 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:40:56,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product26.cil.c [2025-02-05 15:40:58,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d31876d2/aebafdbe2fee4a10bc1cd1e33eeef53e/FLAG4acc12cb0 [2025-02-05 15:40:58,736 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:40:58,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product26.cil.c [2025-02-05 15:40:58,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d31876d2/aebafdbe2fee4a10bc1cd1e33eeef53e/FLAG4acc12cb0 [2025-02-05 15:40:58,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d31876d2/aebafdbe2fee4a10bc1cd1e33eeef53e [2025-02-05 15:40:58,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:40:58,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:40:58,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:58,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:40:58,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:40:58,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:58" (1/1) ... [2025-02-05 15:40:58,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ce3282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:58, skipping insertion in model container [2025-02-05 15:40:58,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:58" (1/1) ... [2025-02-05 15:40:58,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:40:59,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product26.cil.c[63627,63640] [2025-02-05 15:40:59,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:59,368 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:40:59,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-02-05 15:40:59,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [460] [2025-02-05 15:40:59,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [577] [2025-02-05 15:40:59,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [615] [2025-02-05 15:40:59,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [636] [2025-02-05 15:40:59,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [964] [2025-02-05 15:40:59,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1330] [2025-02-05 15:40:59,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1552] [2025-02-05 15:40:59,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2620] [2025-02-05 15:40:59,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2960] [2025-02-05 15:40:59,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2969] [2025-02-05 15:40:59,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product26.cil.c[63627,63640] [2025-02-05 15:40:59,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:59,541 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:40:59,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59 WrapperNode [2025-02-05 15:40:59,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:59,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:59,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:40:59,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:40:59,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,653 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 59, calls inlined = 56, statements flattened = 1089 [2025-02-05 15:40:59,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:59,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:40:59,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:40:59,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:40:59,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,721 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:40:59,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:40:59,785 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:40:59,785 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:40:59,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:40:59,786 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (1/1) ... [2025-02-05 15:40:59,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:59,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:59,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:40:59,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:40:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:40:59,843 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:40:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:40:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:40:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:40:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:40:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:40:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:40:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:40:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:40:59,844 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:40:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:40:59,845 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:40:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:40:59,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:40:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:40:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:40:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:40:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:40:59,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:40:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:40:59,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:41:00,083 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:41:00,086 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:41:00,202 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2209-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~31#1; [2025-02-05 15:41:00,203 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2254: #res#1 := ~retValue_acc~32#1; [2025-02-05 15:41:00,221 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L574-1: createEmail_#res#1 := createEmail_~retValue_acc~14#1; [2025-02-05 15:41:00,236 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1706: #res := ~retValue_acc~24; [2025-02-05 15:41:00,251 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-02-05 15:41:00,320 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-02-05 15:41:00,349 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-02-05 15:41:00,422 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2032: #res := ~retValue_acc~28; [2025-02-05 15:41:00,617 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2597-1: getClientId_#res#1 := getClientId_~retValue_acc~37#1; [2025-02-05 15:41:00,617 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-02-05 15:41:00,618 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~36#1; [2025-02-05 15:41:00,618 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2162-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~30#1; [2025-02-05 15:41:00,618 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~35#1; [2025-02-05 15:41:00,618 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~29#1; [2025-02-05 15:41:00,618 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2908-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2025-02-05 15:41:00,903 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2317-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~33#1; [2025-02-05 15:41:00,904 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2865-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-02-05 15:41:00,904 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2883-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-02-05 15:41:00,904 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2424-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~34#1; [2025-02-05 15:41:00,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-02-05 15:41:00,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L612-1: valid_product_#res#1 := valid_product_~retValue_acc~16#1; [2025-02-05 15:41:00,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-02-05 15:41:00,920 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L530-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~11#1; [2025-02-05 15:41:00,920 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L550: #res#1 := ~retValue_acc~12#1; [2025-02-05 15:41:01,086 INFO L? ?]: Removed 540 outVars from TransFormulas that were not future-live. [2025-02-05 15:41:01,087 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:41:01,103 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:41:01,103 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:41:01,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:01 BoogieIcfgContainer [2025-02-05 15:41:01,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:41:01,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:41:01,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:41:01,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:41:01,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:40:58" (1/3) ... [2025-02-05 15:41:01,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7884e6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:01, skipping insertion in model container [2025-02-05 15:41:01,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:59" (2/3) ... [2025-02-05 15:41:01,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7884e6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:01, skipping insertion in model container [2025-02-05 15:41:01,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:01" (3/3) ... [2025-02-05 15:41:01,113 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product26.cil.c [2025-02-05 15:41:01,127 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:41:01,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product26.cil.c that has 25 procedures, 399 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:41:01,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:41:01,201 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;@1940dd30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:41:01,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:41:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 311 states have (on average 1.5594855305466238) internal successors, (485), 316 states have internal predecessors, (485), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 15:41:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:41:01,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:01,230 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:01,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1074296693, now seen corresponding path program 1 times [2025-02-05 15:41:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:01,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702670013] [2025-02-05 15:41:01,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:01,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:41:01,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:41:01,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:01,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:41:02,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702670013] [2025-02-05 15:41:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702670013] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514156254] [2025-02-05 15:41:02,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:02,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:02,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:02,020 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:41:02,022 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:41:02,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:41:02,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:41:02,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:02,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:02,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:41:02,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 15:41:02,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:02,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514156254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:02,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:02,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:41:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547990859] [2025-02-05 15:41:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:02,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:41:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:02,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:41:02,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:02,481 INFO L87 Difference]: Start difference. First operand has 399 states, 311 states have (on average 1.5594855305466238) internal successors, (485), 316 states have internal predecessors, (485), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:02,548 INFO L93 Difference]: Finished difference Result 601 states and 902 transitions. [2025-02-05 15:41:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:41:02,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 137 [2025-02-05 15:41:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:02,563 INFO L225 Difference]: With dead ends: 601 [2025-02-05 15:41:02,563 INFO L226 Difference]: Without dead ends: 392 [2025-02-05 15:41:02,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 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:41:02,571 INFO L435 NwaCegarLoop]: 606 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, 606 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:41:02,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-05 15:41:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-05 15:41:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 305 states have (on average 1.5573770491803278) internal successors, (475), 309 states have internal predecessors, (475), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-05 15:41:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 598 transitions. [2025-02-05 15:41:02,633 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 598 transitions. Word has length 137 [2025-02-05 15:41:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:02,634 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 598 transitions. [2025-02-05 15:41:02,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 598 transitions. [2025-02-05 15:41:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:41:02,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:02,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:02,652 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:41:02,843 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:41:02,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1364273469, now seen corresponding path program 1 times [2025-02-05 15:41:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342588458] [2025-02-05 15:41:02,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:02,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:02,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:41:02,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:41:02,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:02,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:41:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342588458] [2025-02-05 15:41:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342588458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658465673] [2025-02-05 15:41:03,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:03,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:03,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:03,144 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:41:03,146 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:41:03,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:41:03,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:41:03,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:03,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:03,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:41:03,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:41:03,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658465673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684265312] [2025-02-05 15:41:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:03,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:03,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:03,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:03,532 INFO L87 Difference]: Start difference. First operand 392 states and 598 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:03,579 INFO L93 Difference]: Finished difference Result 590 states and 880 transitions. [2025-02-05 15:41:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:03,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-02-05 15:41:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:03,585 INFO L225 Difference]: With dead ends: 590 [2025-02-05 15:41:03,585 INFO L226 Difference]: Without dead ends: 394 [2025-02-05 15:41:03,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 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:41:03,587 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 0 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1192 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:41:03,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1192 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-05 15:41:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-02-05 15:41:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 307 states have (on average 1.5537459283387622) internal successors, (477), 311 states have internal predecessors, (477), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-05 15:41:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 600 transitions. [2025-02-05 15:41:03,632 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 600 transitions. Word has length 119 [2025-02-05 15:41:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:03,633 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 600 transitions. [2025-02-05 15:41:03,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 600 transitions. [2025-02-05 15:41:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:41:03,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:03,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:03,647 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:41:03,839 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:41:03,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1910510986, now seen corresponding path program 1 times [2025-02-05 15:41:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:03,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56958028] [2025-02-05 15:41:03,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:03,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:41:03,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:41:03,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:03,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:41:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56958028] [2025-02-05 15:41:04,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56958028] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166908260] [2025-02-05 15:41:04,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:04,167 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:41:04,170 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:41:04,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:41:04,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:41:04,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:04,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:04,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:04,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 15:41:04,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166908260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:04,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658988812] [2025-02-05 15:41:04,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:04,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:04,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:04,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:04,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:04,570 INFO L87 Difference]: Start difference. First operand 394 states and 600 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:04,621 INFO L93 Difference]: Finished difference Result 840 states and 1299 transitions. [2025-02-05 15:41:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-02-05 15:41:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:04,629 INFO L225 Difference]: With dead ends: 840 [2025-02-05 15:41:04,629 INFO L226 Difference]: Without dead ends: 473 [2025-02-05 15:41:04,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 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:41:04,632 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 142 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1161 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:41:04,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1161 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-05 15:41:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 465. [2025-02-05 15:41:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 368 states have internal predecessors, (573), 76 states have call successors, (76), 24 states have call predecessors, (76), 24 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 15:41:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 724 transitions. [2025-02-05 15:41:04,669 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 724 transitions. Word has length 146 [2025-02-05 15:41:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:04,670 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 724 transitions. [2025-02-05 15:41:04,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 724 transitions. [2025-02-05 15:41:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:41:04,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:04,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:04,687 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:41:04,881 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:41:04,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:04,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1698237097, now seen corresponding path program 1 times [2025-02-05 15:41:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:04,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389286180] [2025-02-05 15:41:04,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:04,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:04,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:41:04,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:41:04,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:04,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:41:05,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:05,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389286180] [2025-02-05 15:41:05,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389286180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:05,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497171314] [2025-02-05 15:41:05,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:05,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:05,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:05,110 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:41:05,112 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:41:05,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:41:05,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:41:05,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:05,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:05,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:41:05,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:41:05,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:05,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497171314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:05,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:05,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:41:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704335947] [2025-02-05 15:41:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:05,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:05,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:05,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:05,510 INFO L87 Difference]: Start difference. First operand 465 states and 724 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:41:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:05,593 INFO L93 Difference]: Finished difference Result 921 states and 1438 transitions. [2025-02-05 15:41:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:05,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 147 [2025-02-05 15:41:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:05,600 INFO L225 Difference]: With dead ends: 921 [2025-02-05 15:41:05,600 INFO L226 Difference]: Without dead ends: 467 [2025-02-05 15:41:05,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 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:41:05,604 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 2 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2349 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:41:05,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2349 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-02-05 15:41:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-02-05 15:41:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 370 states have internal predecessors, (574), 76 states have call successors, (76), 24 states have call predecessors, (76), 25 states have return successors, (77), 74 states have call predecessors, (77), 75 states have call successors, (77) [2025-02-05 15:41:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 727 transitions. [2025-02-05 15:41:05,637 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 727 transitions. Word has length 147 [2025-02-05 15:41:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:05,637 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 727 transitions. [2025-02-05 15:41:05,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:41:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 727 transitions. [2025-02-05 15:41:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:41:05,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:05,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:05,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:41:05,842 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:41:05,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash 180086254, now seen corresponding path program 1 times [2025-02-05 15:41:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253565237] [2025-02-05 15:41:05,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:05,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:41:05,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:41:05,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:05,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:41:06,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253565237] [2025-02-05 15:41:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253565237] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306327112] [2025-02-05 15:41:06,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:06,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:06,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:06,048 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:41:06,051 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:41:06,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:41:06,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:41:06,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:06,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:06,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:41:06,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:41:06,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:06,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306327112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:06,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:06,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:41:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351402735] [2025-02-05 15:41:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:06,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:06,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:06,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:06,483 INFO L87 Difference]: Start difference. First operand 467 states and 727 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:41:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:06,557 INFO L93 Difference]: Finished difference Result 923 states and 1443 transitions. [2025-02-05 15:41:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:06,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 148 [2025-02-05 15:41:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:06,564 INFO L225 Difference]: With dead ends: 923 [2025-02-05 15:41:06,564 INFO L226 Difference]: Without dead ends: 469 [2025-02-05 15:41:06,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:06,567 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 2 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2335 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:41:06,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2335 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-05 15:41:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-02-05 15:41:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 366 states have (on average 1.5710382513661203) internal successors, (575), 372 states have internal predecessors, (575), 76 states have call successors, (76), 24 states have call predecessors, (76), 26 states have return successors, (82), 74 states have call predecessors, (82), 75 states have call successors, (82) [2025-02-05 15:41:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 733 transitions. [2025-02-05 15:41:06,588 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 733 transitions. Word has length 148 [2025-02-05 15:41:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:06,589 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 733 transitions. [2025-02-05 15:41:06,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:41:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 733 transitions. [2025-02-05 15:41:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:41:06,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:06,592 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:41:06,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:41:06,796 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:41:06,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:06,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 654444207, now seen corresponding path program 1 times [2025-02-05 15:41:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870920904] [2025-02-05 15:41:06,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:06,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:41:06,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:41:06,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:06,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:06,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:06,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870920904] [2025-02-05 15:41:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870920904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:06,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:06,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:06,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214218047] [2025-02-05 15:41:06,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:06,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:06,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:06,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:06,968 INFO L87 Difference]: Start difference. First operand 469 states and 733 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:41:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:07,017 INFO L93 Difference]: Finished difference Result 915 states and 1434 transitions. [2025-02-05 15:41:07,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:07,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 130 [2025-02-05 15:41:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:07,021 INFO L225 Difference]: With dead ends: 915 [2025-02-05 15:41:07,021 INFO L226 Difference]: Without dead ends: 469 [2025-02-05 15:41:07,023 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:41:07,024 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 2 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2353 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:41:07,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2353 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-05 15:41:07,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-02-05 15:41:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 366 states have (on average 1.5710382513661203) internal successors, (575), 372 states have internal predecessors, (575), 76 states have call successors, (76), 24 states have call predecessors, (76), 26 states have return successors, (81), 74 states have call predecessors, (81), 75 states have call successors, (81) [2025-02-05 15:41:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 732 transitions. [2025-02-05 15:41:07,044 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 732 transitions. Word has length 130 [2025-02-05 15:41:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:07,044 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 732 transitions. [2025-02-05 15:41:07,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:41:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 732 transitions. [2025-02-05 15:41:07,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:41:07,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:07,048 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:07,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:41:07,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash 539165979, now seen corresponding path program 1 times [2025-02-05 15:41:07,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004824900] [2025-02-05 15:41:07,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:07,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:41:07,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:41:07,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:07,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:41:07,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:07,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004824900] [2025-02-05 15:41:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004824900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:07,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191268441] [2025-02-05 15:41:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:07,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:07,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:07,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:07,213 INFO L87 Difference]: Start difference. First operand 469 states and 732 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:41:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:07,296 INFO L93 Difference]: Finished difference Result 917 states and 1437 transitions. [2025-02-05 15:41:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:07,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 150 [2025-02-05 15:41:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:07,303 INFO L225 Difference]: With dead ends: 917 [2025-02-05 15:41:07,303 INFO L226 Difference]: Without dead ends: 471 [2025-02-05 15:41:07,305 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:41:07,306 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2356 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:41:07,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2356 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-05 15:41:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-02-05 15:41:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 367 states have (on average 1.569482288828338) internal successors, (576), 374 states have internal predecessors, (576), 76 states have call successors, (76), 24 states have call predecessors, (76), 27 states have return successors, (83), 74 states have call predecessors, (83), 75 states have call successors, (83) [2025-02-05 15:41:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 735 transitions. [2025-02-05 15:41:07,326 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 735 transitions. Word has length 150 [2025-02-05 15:41:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:07,326 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 735 transitions. [2025-02-05 15:41:07,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:41:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 735 transitions. [2025-02-05 15:41:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:41:07,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:07,330 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:41:07,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:41:07,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:07,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash -810165396, now seen corresponding path program 1 times [2025-02-05 15:41:07,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:07,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837417217] [2025-02-05 15:41:07,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:07,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:41:07,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:41:07,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:07,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:41:07,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:07,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837417217] [2025-02-05 15:41:07,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837417217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:07,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:07,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:41:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964802399] [2025-02-05 15:41:07,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:07,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:41:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:07,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:41:07,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:07,495 INFO L87 Difference]: Start difference. First operand 471 states and 735 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:41:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:07,646 INFO L93 Difference]: Finished difference Result 919 states and 1436 transitions. [2025-02-05 15:41:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:41:07,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 132 [2025-02-05 15:41:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:07,651 INFO L225 Difference]: With dead ends: 919 [2025-02-05 15:41:07,651 INFO L226 Difference]: Without dead ends: 473 [2025-02-05 15:41:07,652 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:41:07,653 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 7 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4045 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:41:07,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4045 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:41:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-05 15:41:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-02-05 15:41:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 369 states have (on average 1.5663956639566397) internal successors, (578), 375 states have internal predecessors, (578), 76 states have call successors, (76), 25 states have call predecessors, (76), 27 states have return successors, (82), 74 states have call predecessors, (82), 75 states have call successors, (82) [2025-02-05 15:41:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 736 transitions. [2025-02-05 15:41:07,676 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 736 transitions. Word has length 132 [2025-02-05 15:41:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:07,676 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 736 transitions. [2025-02-05 15:41:07,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:41:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 736 transitions. [2025-02-05 15:41:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:41:07,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:07,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:07,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:41:07,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:07,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1097554439, now seen corresponding path program 1 times [2025-02-05 15:41:07,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:07,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351192443] [2025-02-05 15:41:07,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:07,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:07,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:41:07,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:41:07,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:07,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:41:07,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:07,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351192443] [2025-02-05 15:41:07,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351192443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:07,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:07,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:41:07,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621493167] [2025-02-05 15:41:07,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:07,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:41:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:07,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:41:07,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:07,874 INFO L87 Difference]: Start difference. First operand 473 states and 736 transitions. Second operand has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 15:41:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:08,038 INFO L93 Difference]: Finished difference Result 922 states and 1443 transitions. [2025-02-05 15:41:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:41:08,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 152 [2025-02-05 15:41:08,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:08,042 INFO L225 Difference]: With dead ends: 922 [2025-02-05 15:41:08,042 INFO L226 Difference]: Without dead ends: 476 [2025-02-05 15:41:08,044 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:41:08,045 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 5 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4059 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:41:08,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4059 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:41:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-02-05 15:41:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2025-02-05 15:41:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 371 states have (on average 1.5633423180592991) internal successors, (580), 378 states have internal predecessors, (580), 76 states have call successors, (76), 25 states have call predecessors, (76), 28 states have return successors, (87), 74 states have call predecessors, (87), 75 states have call successors, (87) [2025-02-05 15:41:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 743 transitions. [2025-02-05 15:41:08,068 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 743 transitions. Word has length 152 [2025-02-05 15:41:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:08,069 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 743 transitions. [2025-02-05 15:41:08,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 15:41:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 743 transitions. [2025-02-05 15:41:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 15:41:08,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:08,072 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:08,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:41:08,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:08,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash -80066616, now seen corresponding path program 1 times [2025-02-05 15:41:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427785714] [2025-02-05 15:41:08,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:08,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:41:08,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:41:08,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:08,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-05 15:41:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:08,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427785714] [2025-02-05 15:41:08,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427785714] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:08,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377573816] [2025-02-05 15:41:08,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:08,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:08,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:08,289 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:41:08,290 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:41:08,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:41:08,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:41:08,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:08,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:08,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:08,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:41:08,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:41:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:41:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377573816] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:41:08,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:41:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:41:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890590966] [2025-02-05 15:41:08,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:41:08,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:41:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:08,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:41:08,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:08,810 INFO L87 Difference]: Start difference. First operand 476 states and 743 transitions. Second operand has 11 states, 10 states have (on average 15.0) internal successors, (150), 11 states have internal predecessors, (150), 4 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-02-05 15:41:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:09,539 INFO L93 Difference]: Finished difference Result 1384 states and 2253 transitions. [2025-02-05 15:41:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:41:09,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.0) internal successors, (150), 11 states have internal predecessors, (150), 4 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 153 [2025-02-05 15:41:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:09,546 INFO L225 Difference]: With dead ends: 1384 [2025-02-05 15:41:09,547 INFO L226 Difference]: Without dead ends: 940 [2025-02-05 15:41:09,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 303 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:41:09,550 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 1633 mSDsluCounter, 3578 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 4159 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:09,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 4159 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:41:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-02-05 15:41:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 916. [2025-02-05 15:41:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 732 states have (on average 1.616120218579235) internal successors, (1183), 738 states have internal predecessors, (1183), 155 states have call successors, (155), 26 states have call predecessors, (155), 28 states have return successors, (176), 153 states have call predecessors, (176), 154 states have call successors, (176) [2025-02-05 15:41:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1514 transitions. [2025-02-05 15:41:09,598 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1514 transitions. Word has length 153 [2025-02-05 15:41:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:09,598 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1514 transitions. [2025-02-05 15:41:09,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.0) internal successors, (150), 11 states have internal predecessors, (150), 4 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-02-05 15:41:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1514 transitions. [2025-02-05 15:41:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:41:09,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:09,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:09,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:41:09,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:41:09,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:09,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:09,806 INFO L85 PathProgramCache]: Analyzing trace with hash -267497617, now seen corresponding path program 1 times [2025-02-05 15:41:09,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986468216] [2025-02-05 15:41:09,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:09,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:41:09,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:41:09,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:09,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:09,885 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:41:09,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:09,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986468216] [2025-02-05 15:41:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986468216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404503922] [2025-02-05 15:41:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:09,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:09,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:09,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:09,886 INFO L87 Difference]: Start difference. First operand 916 states and 1514 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:09,955 INFO L93 Difference]: Finished difference Result 2169 states and 3643 transitions. [2025-02-05 15:41:09,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-02-05 15:41:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:09,966 INFO L225 Difference]: With dead ends: 2169 [2025-02-05 15:41:09,966 INFO L226 Difference]: Without dead ends: 1334 [2025-02-05 15:41:09,971 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:41:09,972 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 139 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:09,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-02-05 15:41:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1326. [2025-02-05 15:41:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1063 states have (on average 1.6349952963311383) internal successors, (1738), 1069 states have internal predecessors, (1738), 234 states have call successors, (234), 26 states have call predecessors, (234), 28 states have return successors, (265), 232 states have call predecessors, (265), 233 states have call successors, (265) [2025-02-05 15:41:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2237 transitions. [2025-02-05 15:41:10,063 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2237 transitions. Word has length 137 [2025-02-05 15:41:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:10,064 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 2237 transitions. [2025-02-05 15:41:10,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2237 transitions. [2025-02-05 15:41:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:41:10,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:10,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:10,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:41:10,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:10,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash 388162832, now seen corresponding path program 1 times [2025-02-05 15:41:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:10,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221697881] [2025-02-05 15:41:10,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:10,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:10,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:41:10,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:41:10,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:10,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:41:10,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:10,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221697881] [2025-02-05 15:41:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221697881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:10,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:10,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919782192] [2025-02-05 15:41:10,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:10,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:10,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:10,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:10,156 INFO L87 Difference]: Start difference. First operand 1326 states and 2237 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:10,229 INFO L93 Difference]: Finished difference Result 3197 states and 5429 transitions. [2025-02-05 15:41:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:10,230 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2025-02-05 15:41:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:10,244 INFO L225 Difference]: With dead ends: 3197 [2025-02-05 15:41:10,244 INFO L226 Difference]: Without dead ends: 2003 [2025-02-05 15:41:10,250 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:41:10,250 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 137 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1196 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:41:10,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1196 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2025-02-05 15:41:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1995. [2025-02-05 15:41:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1613 states have (on average 1.644141351518909) internal successors, (2652), 1619 states have internal predecessors, (2652), 353 states have call successors, (353), 26 states have call predecessors, (353), 28 states have return successors, (384), 351 states have call predecessors, (384), 352 states have call successors, (384) [2025-02-05 15:41:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 3389 transitions. [2025-02-05 15:41:10,371 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 3389 transitions. Word has length 157 [2025-02-05 15:41:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 1995 states and 3389 transitions. [2025-02-05 15:41:10,372 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 3389 transitions. [2025-02-05 15:41:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:41:10,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:10,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:10,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:41:10,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:10,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 513909870, now seen corresponding path program 1 times [2025-02-05 15:41:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:10,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578681219] [2025-02-05 15:41:10,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:10,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:41:10,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:41:10,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:10,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:10,447 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:41:10,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:10,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578681219] [2025-02-05 15:41:10,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578681219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:10,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:10,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:10,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897563821] [2025-02-05 15:41:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:10,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:10,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:10,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:10,448 INFO L87 Difference]: Start difference. First operand 1995 states and 3389 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:10,569 INFO L93 Difference]: Finished difference Result 4764 states and 8156 transitions. [2025-02-05 15:41:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:10,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2025-02-05 15:41:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:10,591 INFO L225 Difference]: With dead ends: 4764 [2025-02-05 15:41:10,591 INFO L226 Difference]: Without dead ends: 3033 [2025-02-05 15:41:10,599 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:41:10,600 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 135 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1183 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:41:10,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1183 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3033 states. [2025-02-05 15:41:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3033 to 3025. [2025-02-05 15:41:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 2481 states have (on average 1.6513502619911327) internal successors, (4097), 2487 states have internal predecessors, (4097), 515 states have call successors, (515), 26 states have call predecessors, (515), 28 states have return successors, (562), 513 states have call predecessors, (562), 514 states have call successors, (562) [2025-02-05 15:41:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 5174 transitions. [2025-02-05 15:41:10,778 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 5174 transitions. Word has length 139 [2025-02-05 15:41:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:10,778 INFO L471 AbstractCegarLoop]: Abstraction has 3025 states and 5174 transitions. [2025-02-05 15:41:10,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 5174 transitions. [2025-02-05 15:41:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:41:10,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:10,798 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:10,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:41:10,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:10,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1781370146, now seen corresponding path program 1 times [2025-02-05 15:41:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267444006] [2025-02-05 15:41:10,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:10,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:41:10,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:41:10,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:10,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:10,859 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:41:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267444006] [2025-02-05 15:41:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267444006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:10,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:10,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334351052] [2025-02-05 15:41:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:10,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:10,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:10,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:10,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:10,862 INFO L87 Difference]: Start difference. First operand 3025 states and 5174 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:11,012 INFO L93 Difference]: Finished difference Result 7247 states and 12483 transitions. [2025-02-05 15:41:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:11,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2025-02-05 15:41:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:11,049 INFO L225 Difference]: With dead ends: 7247 [2025-02-05 15:41:11,050 INFO L226 Difference]: Without dead ends: 4701 [2025-02-05 15:41:11,063 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:41:11,064 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 133 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1183 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:41:11,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1183 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4701 states. [2025-02-05 15:41:11,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4701 to 4693. [2025-02-05 15:41:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4693 states, 3904 states have (on average 1.6565061475409837) internal successors, (6467), 3910 states have internal predecessors, (6467), 760 states have call successors, (760), 26 states have call predecessors, (760), 28 states have return successors, (833), 758 states have call predecessors, (833), 759 states have call successors, (833) [2025-02-05 15:41:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4693 states to 4693 states and 8060 transitions. [2025-02-05 15:41:11,373 INFO L78 Accepts]: Start accepts. Automaton has 4693 states and 8060 transitions. Word has length 140 [2025-02-05 15:41:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:11,373 INFO L471 AbstractCegarLoop]: Abstraction has 4693 states and 8060 transitions. [2025-02-05 15:41:11,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4693 states and 8060 transitions. [2025-02-05 15:41:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:41:11,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:11,398 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:11,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:41:11,399 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:11,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash 812288653, now seen corresponding path program 1 times [2025-02-05 15:41:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509432495] [2025-02-05 15:41:11,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:11,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 15:41:11,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 15:41:11,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:11,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:11,465 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:41:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509432495] [2025-02-05 15:41:11,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509432495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:11,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:11,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:11,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970194903] [2025-02-05 15:41:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:11,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:11,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:11,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:11,467 INFO L87 Difference]: Start difference. First operand 4693 states and 8060 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:11,741 INFO L93 Difference]: Finished difference Result 11392 states and 19704 transitions. [2025-02-05 15:41:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:11,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 141 [2025-02-05 15:41:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:11,789 INFO L225 Difference]: With dead ends: 11392 [2025-02-05 15:41:11,789 INFO L226 Difference]: Without dead ends: 7505 [2025-02-05 15:41:11,803 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:41:11,804 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 131 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1202 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:41:11,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1202 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2025-02-05 15:41:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 7497. [2025-02-05 15:41:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7497 states, 6215 states have (on average 1.6551890587288818) internal successors, (10287), 6221 states have internal predecessors, (10287), 1253 states have call successors, (1253), 26 states have call predecessors, (1253), 28 states have return successors, (1370), 1251 states have call predecessors, (1370), 1252 states have call successors, (1370) [2025-02-05 15:41:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7497 states to 7497 states and 12910 transitions. [2025-02-05 15:41:12,280 INFO L78 Accepts]: Start accepts. Automaton has 7497 states and 12910 transitions. Word has length 141 [2025-02-05 15:41:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:12,281 INFO L471 AbstractCegarLoop]: Abstraction has 7497 states and 12910 transitions. [2025-02-05 15:41:12,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 7497 states and 12910 transitions. [2025-02-05 15:41:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 15:41:12,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:12,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:12,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:41:12,319 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:12,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1059030386, now seen corresponding path program 1 times [2025-02-05 15:41:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:12,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527799469] [2025-02-05 15:41:12,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:12,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 15:41:12,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 15:41:12,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:12,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:41:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:12,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527799469] [2025-02-05 15:41:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527799469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:12,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817103716] [2025-02-05 15:41:12,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:12,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:12,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:12,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:12,406 INFO L87 Difference]: Start difference. First operand 7497 states and 12910 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:12,882 INFO L93 Difference]: Finished difference Result 18902 states and 32764 transitions. [2025-02-05 15:41:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:12,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 161 [2025-02-05 15:41:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:12,963 INFO L225 Difference]: With dead ends: 18902 [2025-02-05 15:41:12,964 INFO L226 Difference]: Without dead ends: 12607 [2025-02-05 15:41:12,999 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:41:13,000 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 129 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1188 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:41:13,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1188 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12607 states. [2025-02-05 15:41:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12607 to 12599. [2025-02-05 15:41:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12599 states, 10495 states have (on average 1.6558361124344927) internal successors, (17378), 10501 states have internal predecessors, (17378), 2075 states have call successors, (2075), 26 states have call predecessors, (2075), 28 states have return successors, (2270), 2073 states have call predecessors, (2270), 2074 states have call successors, (2270) [2025-02-05 15:41:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12599 states to 12599 states and 21723 transitions. [2025-02-05 15:41:13,671 INFO L78 Accepts]: Start accepts. Automaton has 12599 states and 21723 transitions. Word has length 161 [2025-02-05 15:41:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:13,672 INFO L471 AbstractCegarLoop]: Abstraction has 12599 states and 21723 transitions. [2025-02-05 15:41:13,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 12599 states and 21723 transitions. [2025-02-05 15:41:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 15:41:13,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:13,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:13,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:41:13,721 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:13,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:13,723 INFO L85 PathProgramCache]: Analyzing trace with hash -774464283, now seen corresponding path program 1 times [2025-02-05 15:41:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:13,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16986483] [2025-02-05 15:41:13,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:13,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:13,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 15:41:13,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 15:41:13,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:13,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:41:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16986483] [2025-02-05 15:41:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16986483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:13,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:13,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159735754] [2025-02-05 15:41:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:13,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:13,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:13,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:13,809 INFO L87 Difference]: Start difference. First operand 12599 states and 21723 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:14,358 INFO L93 Difference]: Finished difference Result 30183 states and 51981 transitions. [2025-02-05 15:41:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:14,359 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 162 [2025-02-05 15:41:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:14,459 INFO L225 Difference]: With dead ends: 30183 [2025-02-05 15:41:14,460 INFO L226 Difference]: Without dead ends: 19783 [2025-02-05 15:41:14,509 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:41:14,510 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 127 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1166 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:41:14,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1166 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19783 states. [2025-02-05 15:41:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19783 to 19775. [2025-02-05 15:41:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19775 states, 16468 states have (on average 1.6326815642458101) internal successors, (26887), 16474 states have internal predecessors, (26887), 3278 states have call successors, (3278), 26 states have call predecessors, (3278), 28 states have return successors, (3617), 3276 states have call predecessors, (3617), 3277 states have call successors, (3617) [2025-02-05 15:41:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19775 states to 19775 states and 33782 transitions. [2025-02-05 15:41:15,588 INFO L78 Accepts]: Start accepts. Automaton has 19775 states and 33782 transitions. Word has length 162 [2025-02-05 15:41:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:15,588 INFO L471 AbstractCegarLoop]: Abstraction has 19775 states and 33782 transitions. [2025-02-05 15:41:15,589 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 19775 states and 33782 transitions. [2025-02-05 15:41:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 15:41:15,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:15,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:15,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:41:15,649 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:15,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1547312612, now seen corresponding path program 1 times [2025-02-05 15:41:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410319559] [2025-02-05 15:41:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:15,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:41:15,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:41:15,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:15,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:15,738 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:41:15,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410319559] [2025-02-05 15:41:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410319559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:15,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:15,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108439918] [2025-02-05 15:41:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:15,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:15,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:15,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:15,742 INFO L87 Difference]: Start difference. First operand 19775 states and 33782 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:17,088 INFO L93 Difference]: Finished difference Result 52230 states and 89580 transitions. [2025-02-05 15:41:17,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:17,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 144 [2025-02-05 15:41:17,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:17,270 INFO L225 Difference]: With dead ends: 52230 [2025-02-05 15:41:17,271 INFO L226 Difference]: Without dead ends: 35323 [2025-02-05 15:41:17,324 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:41:17,325 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 125 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1186 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:41:17,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1186 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35323 states. [2025-02-05 15:41:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35323 to 35315. [2025-02-05 15:41:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35315 states, 29558 states have (on average 1.6301170579876851) internal successors, (48183), 29564 states have internal predecessors, (48183), 5728 states have call successors, (5728), 26 states have call predecessors, (5728), 28 states have return successors, (6341), 5726 states have call predecessors, (6341), 5727 states have call successors, (6341) [2025-02-05 15:41:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35315 states to 35315 states and 60252 transitions. [2025-02-05 15:41:18,871 INFO L78 Accepts]: Start accepts. Automaton has 35315 states and 60252 transitions. Word has length 144 [2025-02-05 15:41:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:18,871 INFO L471 AbstractCegarLoop]: Abstraction has 35315 states and 60252 transitions. [2025-02-05 15:41:18,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 35315 states and 60252 transitions. [2025-02-05 15:41:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:41:18,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:18,936 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:18,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:41:18,937 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:18,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1002556885, now seen corresponding path program 1 times [2025-02-05 15:41:18,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:18,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601948661] [2025-02-05 15:41:18,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:18,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:41:18,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:41:18,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:18,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:19,009 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:41:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:19,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601948661] [2025-02-05 15:41:19,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601948661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:19,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:19,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:19,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860449140] [2025-02-05 15:41:19,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:19,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:19,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:19,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:19,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:19,011 INFO L87 Difference]: Start difference. First operand 35315 states and 60252 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:21,125 INFO L93 Difference]: Finished difference Result 96297 states and 164827 transitions. [2025-02-05 15:41:21,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:21,126 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 145 [2025-02-05 15:41:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:21,753 INFO L225 Difference]: With dead ends: 96297 [2025-02-05 15:41:21,753 INFO L226 Difference]: Without dead ends: 64797 [2025-02-05 15:41:21,837 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:41:21,838 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 123 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1186 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:41:21,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1186 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64797 states. [2025-02-05 15:41:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64797 to 64789. [2025-02-05 15:41:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64789 states, 54519 states have (on average 1.6264605000091712) internal successors, (88673), 54525 states have internal predecessors, (88673), 10241 states have call successors, (10241), 26 states have call predecessors, (10241), 28 states have return successors, (11386), 10239 states have call predecessors, (11386), 10240 states have call successors, (11386) [2025-02-05 15:41:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64789 states to 64789 states and 110300 transitions. [2025-02-05 15:41:24,284 INFO L78 Accepts]: Start accepts. Automaton has 64789 states and 110300 transitions. Word has length 145 [2025-02-05 15:41:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:24,284 INFO L471 AbstractCegarLoop]: Abstraction has 64789 states and 110300 transitions. [2025-02-05 15:41:24,285 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 64789 states and 110300 transitions. [2025-02-05 15:41:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 15:41:24,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:24,355 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:24,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:41:24,356 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:24,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1932277356, now seen corresponding path program 1 times [2025-02-05 15:41:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:24,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425648857] [2025-02-05 15:41:24,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:24,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 15:41:24,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 15:41:24,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:24,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:41:24,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425648857] [2025-02-05 15:41:24,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425648857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:24,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:24,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:24,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618790229] [2025-02-05 15:41:24,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:24,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:24,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:24,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:24,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:24,433 INFO L87 Difference]: Start difference. First operand 64789 states and 110300 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:27,078 INFO L93 Difference]: Finished difference Result 121448 states and 207181 transitions. [2025-02-05 15:41:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:27,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 165 [2025-02-05 15:41:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:27,857 INFO L225 Difference]: With dead ends: 121448 [2025-02-05 15:41:27,858 INFO L226 Difference]: Without dead ends: 121252 [2025-02-05 15:41:27,913 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:41:27,916 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 118 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:27,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121252 states. [2025-02-05 15:41:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121252 to 121244. [2025-02-05 15:41:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121244 states, 102606 states have (on average 1.6216595520729782) internal successors, (166392), 102612 states have internal predecessors, (166392), 18609 states have call successors, (18609), 26 states have call predecessors, (18609), 28 states have return successors, (20800), 18607 states have call predecessors, (20800), 18608 states have call successors, (20800) [2025-02-05 15:41:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121244 states to 121244 states and 205801 transitions. [2025-02-05 15:41:32,631 INFO L78 Accepts]: Start accepts. Automaton has 121244 states and 205801 transitions. Word has length 165 [2025-02-05 15:41:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:32,632 INFO L471 AbstractCegarLoop]: Abstraction has 121244 states and 205801 transitions. [2025-02-05 15:41:32,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:41:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 121244 states and 205801 transitions. [2025-02-05 15:41:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:41:32,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:32,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:41:32,748 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1664758090, now seen corresponding path program 1 times [2025-02-05 15:41:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082571763] [2025-02-05 15:41:32,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:32,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:32,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:41:32,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:41:32,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:32,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:41:34,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082571763] [2025-02-05 15:41:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082571763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611602741] [2025-02-05 15:41:34,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:34,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:34,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:34,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:34,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:41:34,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:41:34,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:41:34,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:34,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:34,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 15:41:34,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:41:35,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:35,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611602741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:35,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:35,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-02-05 15:41:35,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129287028] [2025-02-05 15:41:35,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:35,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:41:35,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:35,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:41:35,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:41:35,074 INFO L87 Difference]: Start difference. First operand 121244 states and 205801 transitions. Second operand has 12 states, 11 states have (on average 10.0) internal successors, (110), 9 states have internal predecessors, (110), 5 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-05 15:41:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:41,040 INFO L93 Difference]: Finished difference Result 241550 states and 415491 transitions. [2025-02-05 15:41:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:41:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.0) internal successors, (110), 9 states have internal predecessors, (110), 5 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 147 [2025-02-05 15:41:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:42,508 INFO L225 Difference]: With dead ends: 241550 [2025-02-05 15:41:42,509 INFO L226 Difference]: Without dead ends: 241362 [2025-02-05 15:41:42,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:41:42,611 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 1531 mSDsluCounter, 4312 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 5031 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:42,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 5031 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:41:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241362 states.