./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product35.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 66ba4360d8cd17925c78e04f17940e3bee0e828bd2ae8cc06c9e6a2549687bf9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:44,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:44,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:44,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:44,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:44,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:44,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:44,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:44,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:44,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:44,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:44,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:44,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:44,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:44,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:44,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:44,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:44,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:44,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:44,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:44,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:44,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:44,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:44,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:44,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:44,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:44,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:44,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:44,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:44,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:44,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:44,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:44,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:44,217 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/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 -> 66ba4360d8cd17925c78e04f17940e3bee0e828bd2ae8cc06c9e6a2549687bf9 [2025-03-03 14:22:44,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:44,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:44,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:44,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:44,407 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:44,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product35.cil.c [2025-03-03 14:22:45,515 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d5bd6ea/c9550a028a104259b48e411cdddb86f4/FLAG10b241afd [2025-03-03 14:22:45,819 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:45,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product35.cil.c [2025-03-03 14:22:45,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d5bd6ea/c9550a028a104259b48e411cdddb86f4/FLAG10b241afd [2025-03-03 14:22:46,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d5bd6ea/c9550a028a104259b48e411cdddb86f4 [2025-03-03 14:22:46,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:46,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:46,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:46,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:46,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:46,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2abf1583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46, skipping insertion in model container [2025-03-03 14:22:46,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:46,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product35.cil.c[40704,40717] [2025-03-03 14:22:46,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:46,552 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:46,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-03-03 14:22:46,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [208] [2025-03-03 14:22:46,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [225] [2025-03-03 14:22:46,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1305] [2025-03-03 14:22:46,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1671] [2025-03-03 14:22:46,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1680] [2025-03-03 14:22:46,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1718] [2025-03-03 14:22:46,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2120] [2025-03-03 14:22:46,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2560] [2025-03-03 14:22:46,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2591] [2025-03-03 14:22:46,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2901] [2025-03-03 14:22:46,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product35.cil.c[40704,40717] [2025-03-03 14:22:46,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:46,660 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:46,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46 WrapperNode [2025-03-03 14:22:46,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:46,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:46,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:46,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:46,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,720 INFO L138 Inliner]: procedures = 137, calls = 228, calls flagged for inlining = 65, calls inlined = 62, statements flattened = 1142 [2025-03-03 14:22:46,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:46,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:46,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:46,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:46,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,759 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-03-03 14:22:46,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:46,808 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:46,808 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:46,808 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:46,809 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (1/1) ... [2025-03-03 14:22:46,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:46,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:46,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:22:46,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:22:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:22:46,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:22:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:22:46,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:22:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:22:46,856 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:22:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:22:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:22:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:22:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:22:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:22:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:22:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:22:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:22:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:22:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:22:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:22:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:46,861 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:46,862 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:22:46,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:22:46,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:46,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:47,029 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:47,032 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:47,119 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2027: #res := ~retValue_acc~35; [2025-03-03 14:22:47,130 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2101: #res := ~retValue_acc~37; [2025-03-03 14:22:47,166 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: #res := ~retValue_acc~42; [2025-03-03 14:22:47,195 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L894-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~15#1; [2025-03-03 14:22:47,195 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L939: #res#1 := ~retValue_acc~16#1; [2025-03-03 14:22:47,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1163: #res := ~retValue_acc~19; [2025-03-03 14:22:47,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L847: #res := ~retValue_acc~14; [2025-03-03 14:22:47,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L205-1: createEmail_#res#1 := createEmail_~retValue_acc~3#1; [2025-03-03 14:22:47,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: #res := ~retValue_acc~8; [2025-03-03 14:22:47,267 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1953: #res := ~retValue_acc~33; [2025-03-03 14:22:47,304 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1990: #res := ~retValue_acc~34; [2025-03-03 14:22:47,318 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2064: #res := ~retValue_acc~36; [2025-03-03 14:22:47,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838: #res := ~retValue_acc~30; [2025-03-03 14:22:47,397 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: #res := ~retValue_acc~12; [2025-03-03 14:22:47,539 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1282-1: getClientId_#res#1 := getClientId_~retValue_acc~21#1; [2025-03-03 14:22:47,539 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~20#1; [2025-03-03 14:22:47,539 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1764-1: getEmailId_#res#1 := getEmailId_~retValue_acc~28#1; [2025-03-03 14:22:47,539 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L800-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~13#1; [2025-03-03 14:22:47,752 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1109-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~18#1; [2025-03-03 14:22:47,753 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-03-03 14:22:47,753 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2419-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-03-03 14:22:47,753 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~17#1; [2025-03-03 14:22:47,753 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1715-1: valid_product_#res#1 := valid_product_~retValue_acc~26#1; [2025-03-03 14:22:47,753 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-03-03 14:22:47,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1801: #res := ~retValue_acc~29; [2025-03-03 14:22:47,772 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L161-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~0#1; [2025-03-03 14:22:47,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: #res#1 := ~retValue_acc~1#1; [2025-03-03 14:22:47,937 INFO L? ?]: Removed 606 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:47,938 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:47,957 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:47,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:47,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:47 BoogieIcfgContainer [2025-03-03 14:22:47,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:47,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:47,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:47,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:47,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:46" (1/3) ... [2025-03-03 14:22:47,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f70124e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:47, skipping insertion in model container [2025-03-03 14:22:47,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:46" (2/3) ... [2025-03-03 14:22:47,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f70124e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:47, skipping insertion in model container [2025-03-03 14:22:47,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:47" (3/3) ... [2025-03-03 14:22:47,965 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product35.cil.c [2025-03-03 14:22:47,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:47,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product35.cil.c that has 31 procedures, 471 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:22:48,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:48,053 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;@21d8dac1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:48,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 471 states, 362 states have (on average 1.5303867403314917) internal successors, (554), 367 states have internal predecessors, (554), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-03 14:22:48,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 14:22:48,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:48,083 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:48,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2072678947, now seen corresponding path program 1 times [2025-03-03 14:22:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:48,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283441450] [2025-03-03 14:22:48,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:48,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:22:48,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:22:48,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:48,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 14:22:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283441450] [2025-03-03 14:22:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283441450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:48,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636929879] [2025-03-03 14:22:48,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:48,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:48,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:48,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:48,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:22:48,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:22:49,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:22:49,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:49,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:49,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:22:49,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:22:49,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:49,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636929879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:49,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:22:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901103656] [2025-03-03 14:22:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:49,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:49,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:49,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:49,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:49,111 INFO L87 Difference]: Start difference. First operand has 471 states, 362 states have (on average 1.5303867403314917) internal successors, (554), 367 states have internal predecessors, (554), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:49,177 INFO L93 Difference]: Finished difference Result 745 states and 1100 transitions. [2025-03-03 14:22:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 170 [2025-03-03 14:22:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:49,191 INFO L225 Difference]: With dead ends: 745 [2025-03-03 14:22:49,191 INFO L226 Difference]: Without dead ends: 464 [2025-03-03 14:22:49,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 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-03-03 14:22:49,197 INFO L435 NwaCegarLoop]: 705 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, 705 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-03-03 14:22:49,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-03 14:22:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-03-03 14:22:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 356 states have (on average 1.5280898876404494) internal successors, (544), 360 states have internal predecessors, (544), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 14:22:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 697 transitions. [2025-03-03 14:22:49,274 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 697 transitions. Word has length 170 [2025-03-03 14:22:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:49,276 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 697 transitions. [2025-03-03 14:22:49,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 697 transitions. [2025-03-03 14:22:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 14:22:49,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:49,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:49,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:22:49,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:22:49,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:49,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:49,482 INFO L85 PathProgramCache]: Analyzing trace with hash -892543681, now seen corresponding path program 1 times [2025-03-03 14:22:49,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:49,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134284968] [2025-03-03 14:22:49,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:22:49,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:22:49,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:49,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 14:22:49,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:49,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134284968] [2025-03-03 14:22:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134284968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:49,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724060409] [2025-03-03 14:22:49,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:49,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:49,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:49,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:49,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:22:49,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:22:50,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:22:50,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:50,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:50,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:50,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:22:50,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724060409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:50,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033598903] [2025-03-03 14:22:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:50,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:50,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:50,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:50,130 INFO L87 Difference]: Start difference. First operand 464 states and 697 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:50,169 INFO L93 Difference]: Finished difference Result 734 states and 1078 transitions. [2025-03-03 14:22:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:50,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-03-03 14:22:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:50,173 INFO L225 Difference]: With dead ends: 734 [2025-03-03 14:22:50,174 INFO L226 Difference]: Without dead ends: 466 [2025-03-03 14:22:50,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 171 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-03-03 14:22:50,176 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 0 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1390 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-03-03 14:22:50,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1390 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-03 14:22:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-03-03 14:22:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 358 states have (on average 1.5251396648044693) internal successors, (546), 362 states have internal predecessors, (546), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 14:22:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 699 transitions. [2025-03-03 14:22:50,238 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 699 transitions. Word has length 171 [2025-03-03 14:22:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:50,239 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 699 transitions. [2025-03-03 14:22:50,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 699 transitions. [2025-03-03 14:22:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 14:22:50,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:50,242 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:50,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:22:50,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:22:50,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:50,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash -268260285, now seen corresponding path program 1 times [2025-03-03 14:22:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935521554] [2025-03-03 14:22:50,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:50,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 14:22:50,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 14:22:50,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:50,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 14:22:50,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935521554] [2025-03-03 14:22:50,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935521554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866915942] [2025-03-03 14:22:50,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:50,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:50,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:50,669 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:50,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:22:50,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 14:22:50,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 14:22:50,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:50,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:50,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:50,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:22:50,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:50,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866915942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:50,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:50,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926307061] [2025-03-03 14:22:50,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:50,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:50,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:50,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:50,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:50,986 INFO L87 Difference]: Start difference. First operand 466 states and 699 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:51,017 INFO L93 Difference]: Finished difference Result 984 states and 1497 transitions. [2025-03-03 14:22:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:51,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2025-03-03 14:22:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:51,022 INFO L225 Difference]: With dead ends: 984 [2025-03-03 14:22:51,022 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:22:51,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 179 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-03-03 14:22:51,024 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 142 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1359 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-03-03 14:22:51,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1359 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:22:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 537. [2025-03-03 14:22:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 415 states have (on average 1.546987951807229) internal successors, (642), 419 states have internal predecessors, (642), 91 states have call successors, (91), 30 states have call predecessors, (91), 30 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:22:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 823 transitions. [2025-03-03 14:22:51,053 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 823 transitions. Word has length 179 [2025-03-03 14:22:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:51,053 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 823 transitions. [2025-03-03 14:22:51,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 823 transitions. [2025-03-03 14:22:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 14:22:51,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:51,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:51,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:22:51,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:51,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:51,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1479748191, now seen corresponding path program 1 times [2025-03-03 14:22:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736822793] [2025-03-03 14:22:51,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:51,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 14:22:51,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 14:22:51,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:51,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 14:22:51,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:51,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736822793] [2025-03-03 14:22:51,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736822793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:51,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805846287] [2025-03-03 14:22:51,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:51,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:51,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:51,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:51,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:22:51,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 14:22:51,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 14:22:51,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:51,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:51,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:51,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:51,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:51,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805846287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:51,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:51,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966580767] [2025-03-03 14:22:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:51,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:51,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:51,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:51,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:51,809 INFO L87 Difference]: Start difference. First operand 537 states and 823 transitions. Second operand has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:51,864 INFO L93 Difference]: Finished difference Result 1065 states and 1636 transitions. [2025-03-03 14:22:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:51,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 180 [2025-03-03 14:22:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:51,869 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 14:22:51,870 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 14:22:51,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 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-03-03 14:22:51,873 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2745 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-03-03 14:22:51,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2745 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 14:22:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-03 14:22:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 416 states have (on average 1.5456730769230769) internal successors, (643), 421 states have internal predecessors, (643), 91 states have call successors, (91), 30 states have call predecessors, (91), 31 states have return successors, (92), 89 states have call predecessors, (92), 90 states have call successors, (92) [2025-03-03 14:22:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 826 transitions. [2025-03-03 14:22:51,894 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 826 transitions. Word has length 180 [2025-03-03 14:22:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:51,894 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 826 transitions. [2025-03-03 14:22:51,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 826 transitions. [2025-03-03 14:22:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 14:22:51,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:51,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:51,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:52,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2077198179, now seen corresponding path program 1 times [2025-03-03 14:22:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559350002] [2025-03-03 14:22:52,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:52,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 14:22:52,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 14:22:52,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:52,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:52,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:52,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559350002] [2025-03-03 14:22:52,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559350002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:52,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19789416] [2025-03-03 14:22:52,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:52,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:52,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:52,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:52,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:22:52,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 14:22:52,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 14:22:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:52,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:52,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:52,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19789416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:52,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:52,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:22:52,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097876035] [2025-03-03 14:22:52,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:52,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:52,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:52,645 INFO L87 Difference]: Start difference. First operand 539 states and 826 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:52,709 INFO L93 Difference]: Finished difference Result 1067 states and 1641 transitions. [2025-03-03 14:22:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:52,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 181 [2025-03-03 14:22:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:52,714 INFO L225 Difference]: With dead ends: 1067 [2025-03-03 14:22:52,714 INFO L226 Difference]: Without dead ends: 541 [2025-03-03 14:22:52,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:52,717 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 2 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2731 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-03-03 14:22:52,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2731 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-03 14:22:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-03 14:22:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 417 states have (on average 1.5443645083932853) internal successors, (644), 423 states have internal predecessors, (644), 91 states have call successors, (91), 30 states have call predecessors, (91), 32 states have return successors, (97), 89 states have call predecessors, (97), 90 states have call successors, (97) [2025-03-03 14:22:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 832 transitions. [2025-03-03 14:22:52,748 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 832 transitions. Word has length 181 [2025-03-03 14:22:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:52,748 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 832 transitions. [2025-03-03 14:22:52,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 832 transitions. [2025-03-03 14:22:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 14:22:52,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:52,751 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:52,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:52,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:52,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:52,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1386355956, now seen corresponding path program 1 times [2025-03-03 14:22:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:52,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974232243] [2025-03-03 14:22:52,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:52,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 14:22:52,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 14:22:52,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:52,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 14:22:53,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:53,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974232243] [2025-03-03 14:22:53,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974232243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:53,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:53,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:53,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307312253] [2025-03-03 14:22:53,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:53,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:53,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:53,107 INFO L87 Difference]: Start difference. First operand 541 states and 832 transitions. Second operand has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:53,146 INFO L93 Difference]: Finished difference Result 1059 states and 1632 transitions. [2025-03-03 14:22:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:53,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 182 [2025-03-03 14:22:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:53,150 INFO L225 Difference]: With dead ends: 1059 [2025-03-03 14:22:53,150 INFO L226 Difference]: Without dead ends: 541 [2025-03-03 14:22:53,152 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-03-03 14:22:53,152 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 2 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2749 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-03-03 14:22:53,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2749 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-03 14:22:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-03 14:22:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 417 states have (on average 1.5443645083932853) internal successors, (644), 423 states have internal predecessors, (644), 91 states have call successors, (91), 30 states have call predecessors, (91), 32 states have return successors, (96), 89 states have call predecessors, (96), 90 states have call successors, (96) [2025-03-03 14:22:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 831 transitions. [2025-03-03 14:22:53,175 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 831 transitions. Word has length 182 [2025-03-03 14:22:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:53,175 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 831 transitions. [2025-03-03 14:22:53,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 831 transitions. [2025-03-03 14:22:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 14:22:53,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:53,178 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:53,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:53,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:53,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash 914625132, now seen corresponding path program 2 times [2025-03-03 14:22:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175165937] [2025-03-03 14:22:53,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:53,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:53,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 183 statements into 2 equivalence classes. [2025-03-03 14:22:53,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 81 of 183 statements. [2025-03-03 14:22:53,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:53,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:22:53,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175165937] [2025-03-03 14:22:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175165937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:53,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:53,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126173510] [2025-03-03 14:22:53,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:53,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:53,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:53,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:53,384 INFO L87 Difference]: Start difference. First operand 541 states and 831 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:53,860 INFO L93 Difference]: Finished difference Result 1510 states and 2293 transitions. [2025-03-03 14:22:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:22:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 183 [2025-03-03 14:22:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:53,868 INFO L225 Difference]: With dead ends: 1510 [2025-03-03 14:22:53,869 INFO L226 Difference]: Without dead ends: 1248 [2025-03-03 14:22:53,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:22:53,871 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 843 mSDsluCounter, 4259 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 5016 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:53,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 5016 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:22:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2025-03-03 14:22:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1077. [2025-03-03 14:22:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 832 states have (on average 1.5480769230769231) internal successors, (1288), 841 states have internal predecessors, (1288), 180 states have call successors, (180), 61 states have call predecessors, (180), 64 states have return successors, (194), 178 states have call predecessors, (194), 178 states have call successors, (194) [2025-03-03 14:22:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1662 transitions. [2025-03-03 14:22:53,921 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1662 transitions. Word has length 183 [2025-03-03 14:22:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:53,922 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1662 transitions. [2025-03-03 14:22:53,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1662 transitions. [2025-03-03 14:22:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 14:22:53,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:53,927 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:53,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:22:53,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:53,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 161078592, now seen corresponding path program 1 times [2025-03-03 14:22:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:53,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914459385] [2025-03-03 14:22:53,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:53,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 14:22:53,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 14:22:53,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:53,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:22:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914459385] [2025-03-03 14:22:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914459385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:54,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860062652] [2025-03-03 14:22:54,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:54,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:54,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:54,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:54,071 INFO L87 Difference]: Start difference. First operand 1077 states and 1662 transitions. Second operand has 5 states, 4 states have (on average 25.5) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:22:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:54,152 INFO L93 Difference]: Finished difference Result 2123 states and 3284 transitions. [2025-03-03 14:22:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:54,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.5) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2025-03-03 14:22:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:54,158 INFO L225 Difference]: With dead ends: 2123 [2025-03-03 14:22:54,158 INFO L226 Difference]: Without dead ends: 1081 [2025-03-03 14:22:54,161 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-03-03 14:22:54,162 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2752 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-03-03 14:22:54,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2752 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-03 14:22:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2025-03-03 14:22:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 834 states have (on average 1.5467625899280575) internal successors, (1290), 845 states have internal predecessors, (1290), 180 states have call successors, (180), 61 states have call predecessors, (180), 66 states have return successors, (197), 178 states have call predecessors, (197), 178 states have call successors, (197) [2025-03-03 14:22:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1667 transitions. [2025-03-03 14:22:54,202 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1667 transitions. Word has length 165 [2025-03-03 14:22:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:54,202 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1667 transitions. [2025-03-03 14:22:54,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.5) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:22:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1667 transitions. [2025-03-03 14:22:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 14:22:54,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:54,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:54,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:22:54,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:54,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1400285821, now seen corresponding path program 1 times [2025-03-03 14:22:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:54,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379036827] [2025-03-03 14:22:54,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:54,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:54,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:22:54,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:22:54,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:54,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:22:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:54,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379036827] [2025-03-03 14:22:54,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379036827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:54,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:54,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:54,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231187384] [2025-03-03 14:22:54,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:54,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:54,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:54,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:54,341 INFO L87 Difference]: Start difference. First operand 1081 states and 1667 transitions. Second operand has 8 states, 7 states have (on average 15.142857142857142) internal successors, (106), 8 states have internal predecessors, (106), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 14:22:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:54,469 INFO L93 Difference]: Finished difference Result 2121 states and 3276 transitions. [2025-03-03 14:22:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:54,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.142857142857142) internal successors, (106), 8 states have internal predecessors, (106), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 166 [2025-03-03 14:22:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:54,477 INFO L225 Difference]: With dead ends: 2121 [2025-03-03 14:22:54,477 INFO L226 Difference]: Without dead ends: 1085 [2025-03-03 14:22:54,481 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-03-03 14:22:54,481 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 7 mSDsluCounter, 4057 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4738 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-03-03 14:22:54,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4738 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-03-03 14:22:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2025-03-03 14:22:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 836 states have (on average 1.5454545454545454) internal successors, (1292), 846 states have internal predecessors, (1292), 180 states have call successors, (180), 62 states have call predecessors, (180), 66 states have return successors, (195), 178 states have call predecessors, (195), 178 states have call successors, (195) [2025-03-03 14:22:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1667 transitions. [2025-03-03 14:22:54,519 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1667 transitions. Word has length 166 [2025-03-03 14:22:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:54,520 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1667 transitions. [2025-03-03 14:22:54,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.142857142857142) internal successors, (106), 8 states have internal predecessors, (106), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 14:22:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1667 transitions. [2025-03-03 14:22:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:22:54,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:54,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:54,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:22:54,524 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:54,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:54,525 INFO L85 PathProgramCache]: Analyzing trace with hash 856817130, now seen corresponding path program 2 times [2025-03-03 14:22:54,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:54,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635766373] [2025-03-03 14:22:54,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:54,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-03-03 14:22:54,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 84 of 167 statements. [2025-03-03 14:22:54,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:54,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635766373] [2025-03-03 14:22:54,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635766373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:54,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:54,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:22:54,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266632100] [2025-03-03 14:22:54,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:54,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:22:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:54,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:22:54,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:54,693 INFO L87 Difference]: Start difference. First operand 1083 states and 1667 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 3 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (20), 5 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:22:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:54,821 INFO L93 Difference]: Finished difference Result 1695 states and 2560 transitions. [2025-03-03 14:22:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:22:54,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 3 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (20), 5 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2025-03-03 14:22:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:54,828 INFO L225 Difference]: With dead ends: 1695 [2025-03-03 14:22:54,828 INFO L226 Difference]: Without dead ends: 1173 [2025-03-03 14:22:54,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:54,831 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 40 mSDsluCounter, 5069 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 5803 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:54,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 5803 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-03-03 14:22:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1165. [2025-03-03 14:22:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 887 states have (on average 1.5355129650507329) internal successors, (1362), 903 states have internal predecessors, (1362), 208 states have call successors, (208), 62 states have call predecessors, (208), 69 states have return successors, (233), 205 states have call predecessors, (233), 206 states have call successors, (233) [2025-03-03 14:22:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1803 transitions. [2025-03-03 14:22:54,882 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1803 transitions. Word has length 167 [2025-03-03 14:22:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:54,882 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1803 transitions. [2025-03-03 14:22:54,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 3 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (20), 5 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:22:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1803 transitions. [2025-03-03 14:22:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:22:54,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:54,887 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:54,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:22:54,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:54,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1705824686, now seen corresponding path program 1 times [2025-03-03 14:22:54,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:54,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210158461] [2025-03-03 14:22:54,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:54,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:54,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:22:54,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:22:54,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:54,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 14:22:54,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:54,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210158461] [2025-03-03 14:22:54,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210158461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:54,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084815993] [2025-03-03 14:22:54,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:54,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:54,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:54,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:54,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:22:55,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:22:55,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:22:55,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:55,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:55,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:55,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:22:55,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:55,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084815993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:55,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:55,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125984683] [2025-03-03 14:22:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:55,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:55,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:55,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:55,310 INFO L87 Difference]: Start difference. First operand 1165 states and 1803 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:55,372 INFO L93 Difference]: Finished difference Result 1756 states and 2717 transitions. [2025-03-03 14:22:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:55,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2025-03-03 14:22:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:55,380 INFO L225 Difference]: With dead ends: 1756 [2025-03-03 14:22:55,380 INFO L226 Difference]: Without dead ends: 1171 [2025-03-03 14:22:55,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 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-03-03 14:22:55,383 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 1 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:55,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2742 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-03-03 14:22:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1167. [2025-03-03 14:22:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 888 states have (on average 1.53490990990991) internal successors, (1363), 905 states have internal predecessors, (1363), 208 states have call successors, (208), 62 states have call predecessors, (208), 70 states have return successors, (236), 205 states have call predecessors, (236), 206 states have call successors, (236) [2025-03-03 14:22:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1807 transitions. [2025-03-03 14:22:55,437 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1807 transitions. Word has length 167 [2025-03-03 14:22:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:55,438 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1807 transitions. [2025-03-03 14:22:55,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1807 transitions. [2025-03-03 14:22:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 14:22:55,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:55,444 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:55,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:55,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:55,645 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:55,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1187169734, now seen corresponding path program 1 times [2025-03-03 14:22:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284468361] [2025-03-03 14:22:55,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:55,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 14:22:55,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 14:22:55,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:55,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:55,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:55,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284468361] [2025-03-03 14:22:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284468361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:55,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:55,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573294268] [2025-03-03 14:22:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:55,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:55,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:55,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:55,799 INFO L87 Difference]: Start difference. First operand 1167 states and 1807 transitions. Second operand has 8 states, 7 states have (on average 16.714285714285715) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:22:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:55,926 INFO L93 Difference]: Finished difference Result 2303 states and 3573 transitions. [2025-03-03 14:22:55,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:55,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 16.714285714285715) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 187 [2025-03-03 14:22:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:55,933 INFO L225 Difference]: With dead ends: 2303 [2025-03-03 14:22:55,933 INFO L226 Difference]: Without dead ends: 1177 [2025-03-03 14:22:55,937 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-03-03 14:22:55,938 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 5 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4752 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:55,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4752 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-03-03 14:22:55,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1175. [2025-03-03 14:22:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 894 states have (on average 1.5313199105145414) internal successors, (1369), 912 states have internal predecessors, (1369), 208 states have call successors, (208), 63 states have call predecessors, (208), 72 states have return successors, (242), 205 states have call predecessors, (242), 206 states have call successors, (242) [2025-03-03 14:22:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1819 transitions. [2025-03-03 14:22:55,990 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1819 transitions. Word has length 187 [2025-03-03 14:22:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:55,990 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1819 transitions. [2025-03-03 14:22:55,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 16.714285714285715) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:22:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1819 transitions. [2025-03-03 14:22:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 14:22:55,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:55,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:55,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:22:55,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:55,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1945603786, now seen corresponding path program 1 times [2025-03-03 14:22:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214683045] [2025-03-03 14:22:55,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 14:22:56,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 14:22:56,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:56,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 14:22:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214683045] [2025-03-03 14:22:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214683045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044868086] [2025-03-03 14:22:56,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:56,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:56,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:56,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:22:56,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 14:22:56,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 14:22:56,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:56,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:56,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:56,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:22:56,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:22:56,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044868086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:56,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:56,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:22:56,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644817538] [2025-03-03 14:22:56,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:56,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:22:56,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:56,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:22:56,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:56,640 INFO L87 Difference]: Start difference. First operand 1175 states and 1819 transitions. Second operand has 11 states, 10 states have (on average 18.7) internal successors, (187), 11 states have internal predecessors, (187), 4 states have call successors, (47), 2 states have call predecessors, (47), 3 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2025-03-03 14:22:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:57,265 INFO L93 Difference]: Finished difference Result 3221 states and 5189 transitions. [2025-03-03 14:22:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:22:57,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 18.7) internal successors, (187), 11 states have internal predecessors, (187), 4 states have call successors, (47), 2 states have call predecessors, (47), 3 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) Word has length 188 [2025-03-03 14:22:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:57,276 INFO L225 Difference]: With dead ends: 3221 [2025-03-03 14:22:57,277 INFO L226 Difference]: Without dead ends: 2101 [2025-03-03 14:22:57,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 373 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-03-03 14:22:57,282 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1507 mSDsluCounter, 4241 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 4930 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:57,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 4930 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:22:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2025-03-03 14:22:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2053. [2025-03-03 14:22:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 1614 states have (on average 1.594175960346964) internal successors, (2573), 1631 states have internal predecessors, (2573), 366 states have call successors, (366), 64 states have call predecessors, (366), 72 states have return successors, (425), 363 states have call predecessors, (425), 364 states have call successors, (425) [2025-03-03 14:22:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3364 transitions. [2025-03-03 14:22:57,360 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3364 transitions. Word has length 188 [2025-03-03 14:22:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:57,361 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3364 transitions. [2025-03-03 14:22:57,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 18.7) internal successors, (187), 11 states have internal predecessors, (187), 4 states have call successors, (47), 2 states have call predecessors, (47), 3 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2025-03-03 14:22:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3364 transitions. [2025-03-03 14:22:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 14:22:57,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:57,369 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:57,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:57,574 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:57,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash 905449822, now seen corresponding path program 1 times [2025-03-03 14:22:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:57,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543830513] [2025-03-03 14:22:57,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:57,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 14:22:57,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 14:22:57,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:57,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:57,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543830513] [2025-03-03 14:22:57,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543830513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:57,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:57,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:57,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798709022] [2025-03-03 14:22:57,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:57,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:57,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:57,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:57,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:57,629 INFO L87 Difference]: Start difference. First operand 2053 states and 3364 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:57,744 INFO L93 Difference]: Finished difference Result 4793 states and 7981 transitions. [2025-03-03 14:22:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:57,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 172 [2025-03-03 14:22:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:57,758 INFO L225 Difference]: With dead ends: 4793 [2025-03-03 14:22:57,759 INFO L226 Difference]: Without dead ends: 2889 [2025-03-03 14:22:57,764 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-03-03 14:22:57,765 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 139 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1400 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-03-03 14:22:57,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1400 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2025-03-03 14:22:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2873. [2025-03-03 14:22:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2276 states have (on average 1.618189806678383) internal successors, (3683), 2293 states have internal predecessors, (3683), 524 states have call successors, (524), 64 states have call predecessors, (524), 72 states have return successors, (608), 521 states have call predecessors, (608), 522 states have call successors, (608) [2025-03-03 14:22:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 4815 transitions. [2025-03-03 14:22:57,869 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 4815 transitions. Word has length 172 [2025-03-03 14:22:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:57,870 INFO L471 AbstractCegarLoop]: Abstraction has 2873 states and 4815 transitions. [2025-03-03 14:22:57,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 4815 transitions. [2025-03-03 14:22:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 14:22:57,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:57,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:57,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:57,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:57,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1442941003, now seen corresponding path program 1 times [2025-03-03 14:22:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:57,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570727322] [2025-03-03 14:22:57,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:57,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 14:22:57,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 14:22:57,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:57,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:57,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:57,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570727322] [2025-03-03 14:22:57,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570727322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:57,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:57,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236729008] [2025-03-03 14:22:57,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:57,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:57,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:57,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:57,934 INFO L87 Difference]: Start difference. First operand 2873 states and 4815 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:58,012 INFO L93 Difference]: Finished difference Result 6849 states and 11578 transitions. [2025-03-03 14:22:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:58,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 173 [2025-03-03 14:22:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:58,039 INFO L225 Difference]: With dead ends: 6849 [2025-03-03 14:22:58,039 INFO L226 Difference]: Without dead ends: 4227 [2025-03-03 14:22:58,051 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-03-03 14:22:58,052 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 137 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1384 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-03-03 14:22:58,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states. [2025-03-03 14:22:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 4211. [2025-03-03 14:22:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4211 states, 3376 states have (on average 1.632405213270142) internal successors, (5511), 3393 states have internal predecessors, (5511), 762 states have call successors, (762), 64 states have call predecessors, (762), 72 states have return successors, (862), 759 states have call predecessors, (862), 760 states have call successors, (862) [2025-03-03 14:22:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 7135 transitions. [2025-03-03 14:22:58,266 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 7135 transitions. Word has length 173 [2025-03-03 14:22:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:58,266 INFO L471 AbstractCegarLoop]: Abstraction has 4211 states and 7135 transitions. [2025-03-03 14:22:58,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 7135 transitions. [2025-03-03 14:22:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 14:22:58,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:58,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:58,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:58,289 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:58,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:58,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1922838808, now seen corresponding path program 1 times [2025-03-03 14:22:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584697821] [2025-03-03 14:22:58,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:58,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 14:22:58,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 14:22:58,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:58,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:22:58,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:58,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584697821] [2025-03-03 14:22:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584697821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:58,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584739364] [2025-03-03 14:22:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:58,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:58,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:58,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:58,349 INFO L87 Difference]: Start difference. First operand 4211 states and 7135 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:58,456 INFO L93 Difference]: Finished difference Result 9983 states and 17066 transitions. [2025-03-03 14:22:58,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:58,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2025-03-03 14:22:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:58,494 INFO L225 Difference]: With dead ends: 9983 [2025-03-03 14:22:58,495 INFO L226 Difference]: Without dead ends: 6287 [2025-03-03 14:22:58,514 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-03-03 14:22:58,515 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 135 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1381 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-03-03 14:22:58,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1381 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6287 states. [2025-03-03 14:22:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6287 to 6271. [2025-03-03 14:22:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6271 states, 5112 states have (on average 1.6433881064162754) internal successors, (8401), 5129 states have internal predecessors, (8401), 1086 states have call successors, (1086), 64 states have call predecessors, (1086), 72 states have return successors, (1236), 1083 states have call predecessors, (1236), 1084 states have call successors, (1236) [2025-03-03 14:22:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6271 states to 6271 states and 10723 transitions. [2025-03-03 14:22:58,758 INFO L78 Accepts]: Start accepts. Automaton has 6271 states and 10723 transitions. Word has length 193 [2025-03-03 14:22:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:58,758 INFO L471 AbstractCegarLoop]: Abstraction has 6271 states and 10723 transitions. [2025-03-03 14:22:58,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6271 states and 10723 transitions. [2025-03-03 14:22:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 14:22:58,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:58,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:58,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:22:58,785 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:58,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash -774925885, now seen corresponding path program 1 times [2025-03-03 14:22:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:58,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254655047] [2025-03-03 14:22:58,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:58,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:58,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 14:22:58,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 14:22:58,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:58,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:22:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254655047] [2025-03-03 14:22:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254655047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:58,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:58,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:58,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943905313] [2025-03-03 14:22:58,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:58,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:58,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:58,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:58,847 INFO L87 Difference]: Start difference. First operand 6271 states and 10723 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:59,050 INFO L93 Difference]: Finished difference Result 14949 states and 25772 transitions. [2025-03-03 14:22:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:59,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 194 [2025-03-03 14:22:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:59,088 INFO L225 Difference]: With dead ends: 14949 [2025-03-03 14:22:59,088 INFO L226 Difference]: Without dead ends: 9623 [2025-03-03 14:22:59,105 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-03-03 14:22:59,106 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 133 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1381 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-03-03 14:22:59,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1381 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:59,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9623 states. [2025-03-03 14:22:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9623 to 9607. [2025-03-03 14:22:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9607 states, 7958 states have (on average 1.6512942950490073) internal successors, (13141), 7975 states have internal predecessors, (13141), 1576 states have call successors, (1576), 64 states have call predecessors, (1576), 72 states have return successors, (1809), 1573 states have call predecessors, (1809), 1574 states have call successors, (1809) [2025-03-03 14:22:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9607 states to 9607 states and 16526 transitions. [2025-03-03 14:22:59,528 INFO L78 Accepts]: Start accepts. Automaton has 9607 states and 16526 transitions. Word has length 194 [2025-03-03 14:22:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:59,529 INFO L471 AbstractCegarLoop]: Abstraction has 9607 states and 16526 transitions. [2025-03-03 14:22:59,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 9607 states and 16526 transitions. [2025-03-03 14:22:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 14:22:59,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:59,562 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:59,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:22:59,563 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:59,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:59,564 INFO L85 PathProgramCache]: Analyzing trace with hash -815544105, now seen corresponding path program 1 times [2025-03-03 14:22:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:59,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243584162] [2025-03-03 14:22:59,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:59,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:59,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:22:59,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:22:59,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:59,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:22:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:59,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243584162] [2025-03-03 14:22:59,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243584162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:59,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:59,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871098747] [2025-03-03 14:22:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:59,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:59,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:59,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:59,620 INFO L87 Difference]: Start difference. First operand 9607 states and 16526 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:59,881 INFO L93 Difference]: Finished difference Result 23239 states and 40305 transitions. [2025-03-03 14:22:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:59,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 195 [2025-03-03 14:22:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:59,938 INFO L225 Difference]: With dead ends: 23239 [2025-03-03 14:22:59,938 INFO L226 Difference]: Without dead ends: 15231 [2025-03-03 14:22:59,961 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-03-03 14:22:59,961 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 131 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1396 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-03-03 14:22:59,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1396 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15231 states. [2025-03-03 14:23:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15231 to 15215. [2025-03-03 14:23:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15215 states, 12580 states have (on average 1.6519077901430843) internal successors, (20781), 12597 states have internal predecessors, (20781), 2562 states have call successors, (2562), 64 states have call predecessors, (2562), 72 states have return successors, (2939), 2559 states have call predecessors, (2939), 2560 states have call successors, (2939) [2025-03-03 14:23:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15215 states to 15215 states and 26282 transitions. [2025-03-03 14:23:00,491 INFO L78 Accepts]: Start accepts. Automaton has 15215 states and 26282 transitions. Word has length 195 [2025-03-03 14:23:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:00,491 INFO L471 AbstractCegarLoop]: Abstraction has 15215 states and 26282 transitions. [2025-03-03 14:23:00,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:23:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 15215 states and 26282 transitions. [2025-03-03 14:23:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 14:23:00,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:00,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:00,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:23:00,535 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:00,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash -446744845, now seen corresponding path program 1 times [2025-03-03 14:23:00,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:00,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958377932] [2025-03-03 14:23:00,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:00,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 14:23:00,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 14:23:00,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:00,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:23:00,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:00,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958377932] [2025-03-03 14:23:00,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958377932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:00,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:00,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:00,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725482888] [2025-03-03 14:23:00,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:00,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:00,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:00,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:00,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:00,585 INFO L87 Difference]: Start difference. First operand 15215 states and 26282 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:23:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:01,010 INFO L93 Difference]: Finished difference Result 38259 states and 66497 transitions. [2025-03-03 14:23:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:01,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 177 [2025-03-03 14:23:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:01,118 INFO L225 Difference]: With dead ends: 38259 [2025-03-03 14:23:01,118 INFO L226 Difference]: Without dead ends: 25435 [2025-03-03 14:23:01,157 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-03-03 14:23:01,157 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 129 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1384 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-03-03 14:23:01,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25435 states. [2025-03-03 14:23:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25435 to 25419. [2025-03-03 14:23:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25419 states, 21140 states have (on average 1.6538789025543992) internal successors, (34963), 21157 states have internal predecessors, (34963), 4206 states have call successors, (4206), 64 states have call predecessors, (4206), 72 states have return successors, (4772), 4203 states have call predecessors, (4772), 4204 states have call successors, (4772) [2025-03-03 14:23:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25419 states to 25419 states and 43941 transitions. [2025-03-03 14:23:02,274 INFO L78 Accepts]: Start accepts. Automaton has 25419 states and 43941 transitions. Word has length 177 [2025-03-03 14:23:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:02,275 INFO L471 AbstractCegarLoop]: Abstraction has 25419 states and 43941 transitions. [2025-03-03 14:23:02,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:23:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 25419 states and 43941 transitions. [2025-03-03 14:23:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 14:23:02,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:02,365 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:02,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:23:02,365 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1044503882, now seen corresponding path program 1 times [2025-03-03 14:23:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131031322] [2025-03-03 14:23:02,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:02,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 14:23:02,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 14:23:02,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:02,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:23:02,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:02,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131031322] [2025-03-03 14:23:02,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131031322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:02,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:02,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:02,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645982419] [2025-03-03 14:23:02,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:02,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:02,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:02,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:02,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:02,439 INFO L87 Difference]: Start difference. First operand 25419 states and 43941 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:23:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:03,259 INFO L93 Difference]: Finished difference Result 60821 states and 105107 transitions. [2025-03-03 14:23:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:03,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 197 [2025-03-03 14:23:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:03,430 INFO L225 Difference]: With dead ends: 60821 [2025-03-03 14:23:03,430 INFO L226 Difference]: Without dead ends: 39787 [2025-03-03 14:23:03,496 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-03-03 14:23:03,496 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 127 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1356 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-03-03 14:23:03,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1356 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39787 states. [2025-03-03 14:23:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39787 to 39771. [2025-03-03 14:23:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39771 states, 33086 states have (on average 1.6315359970984706) internal successors, (53981), 33103 states have internal predecessors, (53981), 6612 states have call successors, (6612), 64 states have call predecessors, (6612), 72 states have return successors, (7603), 6609 states have call predecessors, (7603), 6610 states have call successors, (7603) [2025-03-03 14:23:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39771 states to 39771 states and 68196 transitions. [2025-03-03 14:23:04,973 INFO L78 Accepts]: Start accepts. Automaton has 39771 states and 68196 transitions. Word has length 197 [2025-03-03 14:23:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:04,975 INFO L471 AbstractCegarLoop]: Abstraction has 39771 states and 68196 transitions. [2025-03-03 14:23:04,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:23:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 39771 states and 68196 transitions. [2025-03-03 14:23:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 14:23:05,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:05,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:05,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:23:05,098 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:05,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:05,099 INFO L85 PathProgramCache]: Analyzing trace with hash 164427794, now seen corresponding path program 1 times [2025-03-03 14:23:05,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:05,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144242924] [2025-03-03 14:23:05,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:05,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:05,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 14:23:05,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 14:23:05,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:05,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:23:05,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144242924] [2025-03-03 14:23:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144242924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:05,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858664684] [2025-03-03 14:23:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:05,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:05,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:05,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:05,154 INFO L87 Difference]: Start difference. First operand 39771 states and 68196 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:23:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:06,736 INFO L93 Difference]: Finished difference Result 104915 states and 180708 transitions. [2025-03-03 14:23:06,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 179 [2025-03-03 14:23:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:07,031 INFO L225 Difference]: With dead ends: 104915 [2025-03-03 14:23:07,031 INFO L226 Difference]: Without dead ends: 70867 [2025-03-03 14:23:07,124 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-03-03 14:23:07,124 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 125 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1384 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-03-03 14:23:07,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70867 states. [2025-03-03 14:23:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70867 to 70851. [2025-03-03 14:23:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70851 states, 59266 states have (on average 1.6294840211925894) internal successors, (96573), 59283 states have internal predecessors, (96573), 11512 states have call successors, (11512), 64 states have call predecessors, (11512), 72 states have return successors, (13317), 11509 states have call predecessors, (13317), 11510 states have call successors, (13317) [2025-03-03 14:23:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70851 states to 70851 states and 121402 transitions. [2025-03-03 14:23:09,535 INFO L78 Accepts]: Start accepts. Automaton has 70851 states and 121402 transitions. Word has length 179 [2025-03-03 14:23:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:09,535 INFO L471 AbstractCegarLoop]: Abstraction has 70851 states and 121402 transitions. [2025-03-03 14:23:09,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:23:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 70851 states and 121402 transitions. [2025-03-03 14:23:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 14:23:09,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:09,708 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:09,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:23:09,709 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:09,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1727783861, now seen corresponding path program 1 times [2025-03-03 14:23:09,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:09,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822962088] [2025-03-03 14:23:09,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:09,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 14:23:09,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 14:23:09,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:09,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:23:09,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:09,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822962088] [2025-03-03 14:23:09,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822962088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:09,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:09,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629457500] [2025-03-03 14:23:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:09,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:09,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:09,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:09,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:09,765 INFO L87 Difference]: Start difference. First operand 70851 states and 121402 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:23:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:12,882 INFO L93 Difference]: Finished difference Result 193049 states and 331422 transitions. [2025-03-03 14:23:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:12,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 199 [2025-03-03 14:23:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:13,446 INFO L225 Difference]: With dead ends: 193049 [2025-03-03 14:23:13,446 INFO L226 Difference]: Without dead ends: 129815 [2025-03-03 14:23:13,618 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-03-03 14:23:13,620 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 123 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1385 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-03-03 14:23:13,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1385 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129815 states. [2025-03-03 14:23:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129815 to 129799. [2025-03-03 14:23:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129799 states, 109188 states have (on average 1.6261219181595048) internal successors, (177553), 109205 states have internal predecessors, (177553), 20538 states have call successors, (20538), 64 states have call predecessors, (20538), 72 states have return successors, (23407), 20535 states have call predecessors, (23407), 20536 states have call successors, (23407) [2025-03-03 14:23:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129799 states to 129799 states and 221498 transitions. [2025-03-03 14:23:18,547 INFO L78 Accepts]: Start accepts. Automaton has 129799 states and 221498 transitions. Word has length 199 [2025-03-03 14:23:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:18,547 INFO L471 AbstractCegarLoop]: Abstraction has 129799 states and 221498 transitions. [2025-03-03 14:23:18,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:23:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 129799 states and 221498 transitions. [2025-03-03 14:23:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 14:23:18,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:18,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:18,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:23:18,807 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:18,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash 420248721, now seen corresponding path program 1 times [2025-03-03 14:23:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436605060] [2025-03-03 14:23:18,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:18,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 14:23:18,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 14:23:18,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:18,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:23:18,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436605060] [2025-03-03 14:23:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436605060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:18,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:18,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:18,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792669724] [2025-03-03 14:23:18,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:18,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:18,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:18,858 INFO L87 Difference]: Start difference. First operand 129799 states and 221498 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:23:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:23,341 INFO L93 Difference]: Finished difference Result 243345 states and 416121 transitions. [2025-03-03 14:23:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 181 [2025-03-03 14:23:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:24,443 INFO L225 Difference]: With dead ends: 243345 [2025-03-03 14:23:24,443 INFO L226 Difference]: Without dead ends: 242725 [2025-03-03 14:23:24,530 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-03-03 14:23:24,531 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 118 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1398 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-03-03 14:23:24,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1398 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242725 states.