./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_spec0_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 7ed16a2a74d5e33f66ab9b575b27ed24f9a6964adc1478fcc08a5f7b11595b14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:29:55,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:29:55,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:29:55,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:29:55,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:29:55,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:29:55,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:29:55,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:29:55,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:29:55,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:29:55,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:29:55,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:29:55,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:29:55,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:29:55,106 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:29:55,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:29:55,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:55,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:29:55,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:29:55,108 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:29:55,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:29:55,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:29:55,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:29:55,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:29:55,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:29:55,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:29:55,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:29:55,108 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 -> 7ed16a2a74d5e33f66ab9b575b27ed24f9a6964adc1478fcc08a5f7b11595b14 [2025-03-08 05:29:55,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:29:55,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:29:55,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:29:55,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:29:55,337 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:29:55,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product35.cil.c [2025-03-08 05:29:56,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e060369e/c1f0ec6157fb4b1cb64be5ed8217f309/FLAG8ff0ea6f9 [2025-03-08 05:29:56,802 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:29:56,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product35.cil.c [2025-03-08 05:29:56,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e060369e/c1f0ec6157fb4b1cb64be5ed8217f309/FLAG8ff0ea6f9 [2025-03-08 05:29:57,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e060369e/c1f0ec6157fb4b1cb64be5ed8217f309 [2025-03-08 05:29:57,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:29:57,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:29:57,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:57,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:29:57,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:29:57,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b000c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57, skipping insertion in model container [2025-03-08 05:29:57,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:29:57,290 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_spec0_product35.cil.c[5573,5586] [2025-03-08 05:29:57,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:57,512 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:29:57,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-03-08 05:29:57,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [66] [2025-03-08 05:29:57,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [225] [2025-03-08 05:29:57,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [234] [2025-03-08 05:29:57,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [600] [2025-03-08 05:29:57,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [620] [2025-03-08 05:29:57,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [658] [2025-03-08 05:29:57,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1108] [2025-03-08 05:29:57,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2179] [2025-03-08 05:29:57,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2412] [2025-03-08 05:29:57,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2710] [2025-03-08 05:29:57,535 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_spec0_product35.cil.c[5573,5586] [2025-03-08 05:29:57,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:57,633 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:29:57,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57 WrapperNode [2025-03-08 05:29:57,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:57,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:57,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:29:57,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:29:57,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,693 INFO L138 Inliner]: procedures = 137, calls = 226, calls flagged for inlining = 66, calls inlined = 63, statements flattened = 1141 [2025-03-08 05:29:57,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:57,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:29:57,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:29:57,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:29:57,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,739 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-08 05:29:57,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:29:57,796 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:29:57,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:29:57,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:29:57,797 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (1/1) ... [2025-03-08 05:29:57,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:57,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:57,827 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-08 05:29:57,830 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-08 05:29:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:29:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:29:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:29:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:29:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:29:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:29:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:29:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:29:57,851 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:29:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:29:57,851 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:29:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:29:57,851 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:29:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:29:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:29:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:29:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:29:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:29:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:29:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:29:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:29:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:29:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:29:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:29:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:29:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:29:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:29:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:29:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:29:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:29:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:29:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:29:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:29:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:29:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:29:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:29:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:29:58,039 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:29:58,041 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:29:58,154 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014: #res := ~retValue_acc~41; [2025-03-08 05:29:58,189 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L990: #res := ~retValue_acc~14; [2025-03-08 05:29:58,227 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813: #res#1 := ~retValue_acc~26#1; [2025-03-08 05:29:58,227 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1768-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~25#1; [2025-03-08 05:29:58,254 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2037: #res := ~retValue_acc~29; [2025-03-08 05:29:58,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721: #res := ~retValue_acc~24; [2025-03-08 05:29:58,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L222-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-03-08 05:29:58,283 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1265: #res := ~retValue_acc~18; [2025-03-08 05:29:58,295 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2940: #res := ~retValue_acc~39; [2025-03-08 05:29:58,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2977: #res := ~retValue_acc~40; [2025-03-08 05:29:58,350 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3051: #res := ~retValue_acc~42; [2025-03-08 05:29:58,377 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2825: #res := ~retValue_acc~36; [2025-03-08 05:29:58,432 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1591: #res := ~retValue_acc~22; [2025-03-08 05:29:58,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2109-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~30#1; [2025-03-08 05:29:58,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1674-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~23#1; [2025-03-08 05:29:58,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088-1: isVerified_#res#1 := isVerified_~retValue_acc~43#1; [2025-03-08 05:29:58,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2156-1: getClientId_#res#1 := getClientId_~retValue_acc~31#1; [2025-03-08 05:29:58,561 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751-1: getEmailId_#res#1 := getEmailId_~retValue_acc~34#1; [2025-03-08 05:29:58,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L947-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~11#1; [2025-03-08 05:29:58,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L965-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~13#1; [2025-03-08 05:29:58,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~27#1; [2025-03-08 05:29:58,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L655-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-03-08 05:29:58,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L956-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~12#1; [2025-03-08 05:29:58,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1983-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~28#1; [2025-03-08 05:29:58,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: #res := ~retValue_acc~35; [2025-03-08 05:29:58,829 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L178-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~1#1; [2025-03-08 05:29:58,830 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: #res#1 := ~retValue_acc~2#1; [2025-03-08 05:29:58,992 INFO L? ?]: Removed 604 outVars from TransFormulas that were not future-live. [2025-03-08 05:29:58,993 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:29:59,013 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:29:59,013 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:29:59,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:59 BoogieIcfgContainer [2025-03-08 05:29:59,014 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:29:59,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:29:59,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:29:59,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:29:59,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:57" (1/3) ... [2025-03-08 05:29:59,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5010c5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:59, skipping insertion in model container [2025-03-08 05:29:59,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:57" (2/3) ... [2025-03-08 05:29:59,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5010c5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:59, skipping insertion in model container [2025-03-08 05:29:59,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:59" (3/3) ... [2025-03-08 05:29:59,022 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product35.cil.c [2025-03-08 05:29:59,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:29:59,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product35.cil.c that has 30 procedures, 461 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:29:59,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:29:59,087 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;@6b7e55c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:29:59,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:29:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 461 states, 356 states have (on average 1.5365168539325842) internal successors, (547), 361 states have internal predecessors, (547), 74 states have call successors, (74), 29 states have call predecessors, (74), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 05:29:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:29:59,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:59,108 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:59,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:59,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash -515453773, now seen corresponding path program 1 times [2025-03-08 05:29:59,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:59,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888334006] [2025-03-08 05:29:59,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:59,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:59,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:29:59,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:29:59,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:59,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:29:59,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:59,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888334006] [2025-03-08 05:29:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888334006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:59,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89567686] [2025-03-08 05:29:59,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:59,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:59,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:59,729 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-08 05:29:59,731 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-08 05:29:59,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:30:00,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:30:00,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:00,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:00,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:30:00,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:30:00,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:00,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89567686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:00,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:00,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:30:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818015402] [2025-03-08 05:30:00,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:00,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:00,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:00,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:00,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:30:00,167 INFO L87 Difference]: Start difference. First operand has 461 states, 356 states have (on average 1.5365168539325842) internal successors, (547), 361 states have internal predecessors, (547), 74 states have call successors, (74), 29 states have call predecessors, (74), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:30:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:00,247 INFO L93 Difference]: Finished difference Result 727 states and 1078 transitions. [2025-03-08 05:30:00,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:00,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2025-03-08 05:30:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:00,258 INFO L225 Difference]: With dead ends: 727 [2025-03-08 05:30:00,258 INFO L226 Difference]: Without dead ends: 455 [2025-03-08 05:30:00,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 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-08 05:30:00,264 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 0 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1379 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-08 05:30:00,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1379 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-08 05:30:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-03-08 05:30:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 351 states have (on average 1.5327635327635327) internal successors, (538), 355 states have internal predecessors, (538), 74 states have call successors, (74), 29 states have call predecessors, (74), 29 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 05:30:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 685 transitions. [2025-03-08 05:30:00,337 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 685 transitions. Word has length 158 [2025-03-08 05:30:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:00,338 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 685 transitions. [2025-03-08 05:30:00,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:30:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 685 transitions. [2025-03-08 05:30:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 05:30:00,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:00,345 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:00,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:00,550 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-08 05:30:00,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:00,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1821849469, now seen corresponding path program 1 times [2025-03-08 05:30:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:00,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797841576] [2025-03-08 05:30:00,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:00,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:30:00,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:30:00,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:00,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:30:00,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:00,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797841576] [2025-03-08 05:30:00,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797841576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:00,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8563042] [2025-03-08 05:30:00,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:00,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:00,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:00,816 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-08 05:30:00,818 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-08 05:30:00,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:30:01,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:30:01,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:01,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:01,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1326 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:01,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:30:01,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:01,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8563042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:01,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:01,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:30:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921414193] [2025-03-08 05:30:01,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:01,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:01,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:01,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:30:01,199 INFO L87 Difference]: Start difference. First operand 455 states and 685 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:30:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:01,252 INFO L93 Difference]: Finished difference Result 962 states and 1469 transitions. [2025-03-08 05:30:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:01,252 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 165 [2025-03-08 05:30:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:01,257 INFO L225 Difference]: With dead ends: 962 [2025-03-08 05:30:01,260 INFO L226 Difference]: Without dead ends: 533 [2025-03-08 05:30:01,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 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-08 05:30:01,263 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 142 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:01,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1342 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-08 05:30:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 525. [2025-03-08 05:30:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 407 states have (on average 1.5552825552825553) internal successors, (633), 411 states have internal predecessors, (633), 88 states have call successors, (88), 29 states have call predecessors, (88), 29 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:30:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 808 transitions. [2025-03-08 05:30:01,324 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 808 transitions. Word has length 165 [2025-03-08 05:30:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:01,324 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 808 transitions. [2025-03-08 05:30:01,324 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:30:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 808 transitions. [2025-03-08 05:30:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 05:30:01,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:01,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:30:01,339 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-08 05:30:01,530 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-08 05:30:01,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:01,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:01,532 INFO L85 PathProgramCache]: Analyzing trace with hash 394736347, now seen corresponding path program 1 times [2025-03-08 05:30:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:01,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206873224] [2025-03-08 05:30:01,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:01,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:01,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:30:01,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:30:01,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:01,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-08 05:30:01,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206873224] [2025-03-08 05:30:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206873224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:01,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626883740] [2025-03-08 05:30:01,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:01,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:01,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:01,709 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-08 05:30:01,710 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-08 05:30:01,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:30:01,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:30:01,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:01,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:01,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:30:02,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:30:02,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626883740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:02,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:02,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:30:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866448620] [2025-03-08 05:30:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:02,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:02,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:02,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:02,048 INFO L87 Difference]: Start difference. First operand 525 states and 808 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, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:30:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:02,105 INFO L93 Difference]: Finished difference Result 1041 states and 1606 transitions. [2025-03-08 05:30:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:02,106 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, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 185 [2025-03-08 05:30:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:02,109 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 05:30:02,109 INFO L226 Difference]: Without dead ends: 527 [2025-03-08 05:30:02,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 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-08 05:30:02,111 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 2 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2693 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-08 05:30:02,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2693 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:02,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-08 05:30:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-03-08 05:30:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 408 states have (on average 1.553921568627451) internal successors, (634), 413 states have internal predecessors, (634), 88 states have call successors, (88), 29 states have call predecessors, (88), 30 states have return successors, (89), 86 states have call predecessors, (89), 87 states have call successors, (89) [2025-03-08 05:30:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 811 transitions. [2025-03-08 05:30:02,139 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 811 transitions. Word has length 185 [2025-03-08 05:30:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:02,139 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 811 transitions. [2025-03-08 05:30:02,139 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, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:30:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 811 transitions. [2025-03-08 05:30:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:30:02,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:02,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-08 05:30:02,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:02,343 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-08 05:30:02,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:02,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 704407828, now seen corresponding path program 1 times [2025-03-08 05:30:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017574777] [2025-03-08 05:30:02,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:02,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:30:02,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:30:02,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:02,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:30:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017574777] [2025-03-08 05:30:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017574777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608521435] [2025-03-08 05:30:02,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:02,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:02,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:02,528 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-08 05:30:02,529 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-08 05:30:02,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:30:02,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:30:02,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:02,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:02,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:30:02,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:30:02,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:02,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608521435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:02,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:02,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:30:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786664537] [2025-03-08 05:30:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:02,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:02,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:02,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:30:02,888 INFO L87 Difference]: Start difference. First operand 527 states and 811 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:30:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:02,955 INFO L93 Difference]: Finished difference Result 1043 states and 1611 transitions. [2025-03-08 05:30:02,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:02,955 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), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 167 [2025-03-08 05:30:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:02,958 INFO L225 Difference]: With dead ends: 1043 [2025-03-08 05:30:02,959 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 05:30:02,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 165 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-08 05:30:02,961 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 2 mSDsluCounter, 2005 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2679 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-08 05:30:02,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2679 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 05:30:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-08 05:30:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 409 states have (on average 1.5525672371638142) internal successors, (635), 415 states have internal predecessors, (635), 88 states have call successors, (88), 29 states have call predecessors, (88), 31 states have return successors, (94), 86 states have call predecessors, (94), 87 states have call successors, (94) [2025-03-08 05:30:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 817 transitions. [2025-03-08 05:30:02,983 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 817 transitions. Word has length 167 [2025-03-08 05:30:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:02,983 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 817 transitions. [2025-03-08 05:30:02,984 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), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:30:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 817 transitions. [2025-03-08 05:30:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 05:30:02,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:02,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 05:30:02,995 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-08 05:30:03,187 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-08 05:30:03,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:03,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1042986009, now seen corresponding path program 1 times [2025-03-08 05:30:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072582570] [2025-03-08 05:30:03,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:03,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 05:30:03,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 05:30:03,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:03,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-08 05:30:03,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:03,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072582570] [2025-03-08 05:30:03,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072582570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:03,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:03,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031687876] [2025-03-08 05:30:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:03,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:03,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:03,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:03,365 INFO L87 Difference]: Start difference. First operand 529 states and 817 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:30:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:03,401 INFO L93 Difference]: Finished difference Result 1035 states and 1602 transitions. [2025-03-08 05:30:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:03,402 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 187 [2025-03-08 05:30:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:03,404 INFO L225 Difference]: With dead ends: 1035 [2025-03-08 05:30:03,404 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 05:30:03,405 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-08 05:30:03,406 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 2 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2697 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-08 05:30:03,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2697 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 05:30:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-08 05:30:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 409 states have (on average 1.5525672371638142) internal successors, (635), 415 states have internal predecessors, (635), 88 states have call successors, (88), 29 states have call predecessors, (88), 31 states have return successors, (93), 86 states have call predecessors, (93), 87 states have call successors, (93) [2025-03-08 05:30:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 816 transitions. [2025-03-08 05:30:03,433 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 816 transitions. Word has length 187 [2025-03-08 05:30:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:03,433 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 816 transitions. [2025-03-08 05:30:03,433 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:30:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 816 transitions. [2025-03-08 05:30:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 05:30:03,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:03,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-03-08 05:30:03,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:30:03,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:03,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 527567463, now seen corresponding path program 2 times [2025-03-08 05:30:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132373664] [2025-03-08 05:30:03,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:30:03,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:03,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-08 05:30:03,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 188 statements. [2025-03-08 05:30:03,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:30:03,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 05:30:03,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:03,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132373664] [2025-03-08 05:30:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132373664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:03,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:03,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:30:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635202984] [2025-03-08 05:30:03,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:03,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:30:03,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:03,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:30:03,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:03,595 INFO L87 Difference]: Start difference. First operand 529 states and 816 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, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:30:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:04,055 INFO L93 Difference]: Finished difference Result 1469 states and 2239 transitions. [2025-03-08 05:30:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:30:04,055 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, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 188 [2025-03-08 05:30:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:04,061 INFO L225 Difference]: With dead ends: 1469 [2025-03-08 05:30:04,062 INFO L226 Difference]: Without dead ends: 1216 [2025-03-08 05:30:04,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:30:04,063 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 823 mSDsluCounter, 4218 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 4968 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:04,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 4968 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:30:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-08 05:30:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1053. [2025-03-08 05:30:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 816 states have (on average 1.5563725490196079) internal successors, (1270), 825 states have internal predecessors, (1270), 174 states have call successors, (174), 59 states have call predecessors, (174), 62 states have return successors, (188), 172 states have call predecessors, (188), 172 states have call successors, (188) [2025-03-08 05:30:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1632 transitions. [2025-03-08 05:30:04,110 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1632 transitions. Word has length 188 [2025-03-08 05:30:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:04,110 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1632 transitions. [2025-03-08 05:30:04,110 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, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:30:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1632 transitions. [2025-03-08 05:30:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 05:30:04,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:04,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 05:30:04,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:30:04,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:04,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash -993490381, now seen corresponding path program 1 times [2025-03-08 05:30:04,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:04,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514257498] [2025-03-08 05:30:04,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:04,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:04,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 05:30:04,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 05:30:04,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:04,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-08 05:30:04,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:04,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514257498] [2025-03-08 05:30:04,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514257498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:04,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:04,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:04,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317301462] [2025-03-08 05:30:04,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:04,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:04,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:04,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:04,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:04,270 INFO L87 Difference]: Start difference. First operand 1053 states and 1632 transitions. Second operand has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:30:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:04,331 INFO L93 Difference]: Finished difference Result 2075 states and 3224 transitions. [2025-03-08 05:30:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:04,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 189 [2025-03-08 05:30:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:04,337 INFO L225 Difference]: With dead ends: 2075 [2025-03-08 05:30:04,337 INFO L226 Difference]: Without dead ends: 1057 [2025-03-08 05:30:04,340 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-08 05:30:04,341 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 1 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2700 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-08 05:30:04,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2700 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-03-08 05:30:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2025-03-08 05:30:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 818 states have (on average 1.5550122249388754) internal successors, (1272), 829 states have internal predecessors, (1272), 174 states have call successors, (174), 59 states have call predecessors, (174), 64 states have return successors, (191), 172 states have call predecessors, (191), 172 states have call successors, (191) [2025-03-08 05:30:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1637 transitions. [2025-03-08 05:30:04,392 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1637 transitions. Word has length 189 [2025-03-08 05:30:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:04,392 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1637 transitions. [2025-03-08 05:30:04,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:30:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1637 transitions. [2025-03-08 05:30:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 05:30:04,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:04,397 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 05:30:04,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:30:04,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:04,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2056254896, now seen corresponding path program 1 times [2025-03-08 05:30:04,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:04,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933724180] [2025-03-08 05:30:04,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:04,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 05:30:04,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 05:30:04,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:04,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:30:04,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:04,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933724180] [2025-03-08 05:30:04,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933724180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:04,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:04,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:30:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442433915] [2025-03-08 05:30:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:04,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:30:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:04,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:30:04,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:04,567 INFO L87 Difference]: Start difference. First operand 1057 states and 1637 transitions. Second operand has 8 states, 7 states have (on average 16.142857142857142) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-08 05:30:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:04,711 INFO L93 Difference]: Finished difference Result 2074 states and 3217 transitions. [2025-03-08 05:30:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:30:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 16.142857142857142) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 190 [2025-03-08 05:30:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:04,717 INFO L225 Difference]: With dead ends: 2074 [2025-03-08 05:30:04,717 INFO L226 Difference]: Without dead ends: 1061 [2025-03-08 05:30:04,720 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-08 05:30:04,721 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 7 mSDsluCounter, 3979 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4647 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-08 05:30:04,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4647 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-08 05:30:04,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1059. [2025-03-08 05:30:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 820 states have (on average 1.553658536585366) internal successors, (1274), 830 states have internal predecessors, (1274), 174 states have call successors, (174), 60 states have call predecessors, (174), 64 states have return successors, (189), 172 states have call predecessors, (189), 172 states have call successors, (189) [2025-03-08 05:30:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1637 transitions. [2025-03-08 05:30:04,759 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1637 transitions. Word has length 190 [2025-03-08 05:30:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:04,759 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1637 transitions. [2025-03-08 05:30:04,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 16.142857142857142) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-08 05:30:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1637 transitions. [2025-03-08 05:30:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 05:30:04,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:04,763 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:04,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:30:04,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:04,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash 337826497, now seen corresponding path program 1 times [2025-03-08 05:30:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:04,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404415665] [2025-03-08 05:30:04,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:04,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 05:30:04,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 05:30:04,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:04,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:30:04,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:04,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404415665] [2025-03-08 05:30:04,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404415665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:04,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:04,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:30:04,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020282838] [2025-03-08 05:30:04,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:04,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:30:04,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:04,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:30:04,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:04,901 INFO L87 Difference]: Start difference. First operand 1059 states and 1637 transitions. Second operand has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 05:30:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:05,030 INFO L93 Difference]: Finished difference Result 2087 states and 3236 transitions. [2025-03-08 05:30:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:30:05,031 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 172 [2025-03-08 05:30:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:05,037 INFO L225 Difference]: With dead ends: 2087 [2025-03-08 05:30:05,037 INFO L226 Difference]: Without dead ends: 1069 [2025-03-08 05:30:05,040 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-08 05:30:05,041 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 5 mSDsluCounter, 3991 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4661 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:05,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4661 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-03-08 05:30:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1067. [2025-03-08 05:30:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 826 states have (on average 1.549636803874092) internal successors, (1280), 837 states have internal predecessors, (1280), 174 states have call successors, (174), 61 states have call predecessors, (174), 66 states have return successors, (196), 172 states have call predecessors, (196), 172 states have call successors, (196) [2025-03-08 05:30:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1650 transitions. [2025-03-08 05:30:05,080 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1650 transitions. Word has length 172 [2025-03-08 05:30:05,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:05,080 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1650 transitions. [2025-03-08 05:30:05,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 05:30:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1650 transitions. [2025-03-08 05:30:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 05:30:05,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:05,084 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, 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-08 05:30:05,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:30:05,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1487015078, now seen corresponding path program 1 times [2025-03-08 05:30:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14168281] [2025-03-08 05:30:05,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:05,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 05:30:05,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 05:30:05,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:05,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:30:05,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14168281] [2025-03-08 05:30:05,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14168281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815298896] [2025-03-08 05:30:05,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:05,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:05,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:05,261 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-08 05:30:05,262 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-08 05:30:05,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 05:30:05,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 05:30:05,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:05,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:05,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:05,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:05,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:30:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815298896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:30:05,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:30:05,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:30:05,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199997087] [2025-03-08 05:30:05,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:30:05,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:30:05,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:05,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:30:05,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:30:05,754 INFO L87 Difference]: Start difference. First operand 1067 states and 1650 transitions. Second operand has 11 states, 10 states have (on average 15.9) internal successors, (159), 11 states have internal predecessors, (159), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 05:30:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:06,478 INFO L93 Difference]: Finished difference Result 2995 states and 4842 transitions. [2025-03-08 05:30:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:30:06,479 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.9) internal successors, (159), 11 states have internal predecessors, (159), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) Word has length 173 [2025-03-08 05:30:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:06,491 INFO L225 Difference]: With dead ends: 2995 [2025-03-08 05:30:06,491 INFO L226 Difference]: Without dead ends: 1981 [2025-03-08 05:30:06,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 343 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-08 05:30:06,496 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 1402 mSDsluCounter, 4758 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 5436 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:06,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 5436 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:30:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2025-03-08 05:30:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1933. [2025-03-08 05:30:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1534 states have (on average 1.6114732724902217) internal successors, (2472), 1544 states have internal predecessors, (2472), 332 states have call successors, (332), 62 states have call predecessors, (332), 66 states have return successors, (379), 330 states have call predecessors, (379), 330 states have call successors, (379) [2025-03-08 05:30:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 3183 transitions. [2025-03-08 05:30:06,579 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 3183 transitions. Word has length 173 [2025-03-08 05:30:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:06,580 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 3183 transitions. [2025-03-08 05:30:06,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.9) internal successors, (159), 11 states have internal predecessors, (159), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 05:30:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 3183 transitions. [2025-03-08 05:30:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 05:30:06,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:06,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-03-08 05:30:06,597 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-08 05:30:06,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:30:06,793 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:06,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash 623559209, now seen corresponding path program 1 times [2025-03-08 05:30:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:06,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678142775] [2025-03-08 05:30:06,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:06,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 05:30:06,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 05:30:06,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:06,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:30:06,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:06,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678142775] [2025-03-08 05:30:06,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678142775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:06,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:06,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17153519] [2025-03-08 05:30:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:06,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:06,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:06,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:06,854 INFO L87 Difference]: Start difference. First operand 1933 states and 3183 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:06,921 INFO L93 Difference]: Finished difference Result 4543 states and 7610 transitions. [2025-03-08 05:30:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 196 [2025-03-08 05:30:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:06,937 INFO L225 Difference]: With dead ends: 4543 [2025-03-08 05:30:06,937 INFO L226 Difference]: Without dead ends: 2755 [2025-03-08 05:30:06,945 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-08 05:30:06,945 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 139 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:06,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1370 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2025-03-08 05:30:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2739. [2025-03-08 05:30:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2739 states, 2182 states have (on average 1.6351970669110907) internal successors, (3568), 2192 states have internal predecessors, (3568), 490 states have call successors, (490), 62 states have call predecessors, (490), 66 states have return successors, (562), 488 states have call predecessors, (562), 488 states have call successors, (562) [2025-03-08 05:30:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 4620 transitions. [2025-03-08 05:30:07,091 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 4620 transitions. Word has length 196 [2025-03-08 05:30:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 2739 states and 4620 transitions. [2025-03-08 05:30:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 4620 transitions. [2025-03-08 05:30:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 05:30:07,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:07,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:07,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:30:07,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:07,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1982180857, now seen corresponding path program 1 times [2025-03-08 05:30:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:07,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678353486] [2025-03-08 05:30:07,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:07,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 05:30:07,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 05:30:07,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:07,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:30:07,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:07,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678353486] [2025-03-08 05:30:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678353486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:07,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:07,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661729110] [2025-03-08 05:30:07,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:07,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:07,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:07,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:07,169 INFO L87 Difference]: Start difference. First operand 2739 states and 4620 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:07,268 INFO L93 Difference]: Finished difference Result 6565 states and 11173 transitions. [2025-03-08 05:30:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:07,268 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 197 [2025-03-08 05:30:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:07,291 INFO L225 Difference]: With dead ends: 6565 [2025-03-08 05:30:07,292 INFO L226 Difference]: Without dead ends: 4069 [2025-03-08 05:30:07,302 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-08 05:30:07,303 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 137 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1362 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-08 05:30:07,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1362 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2025-03-08 05:30:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 4053. [2025-03-08 05:30:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 3258 states have (on average 1.6488643339472069) internal successors, (5372), 3268 states have internal predecessors, (5372), 728 states have call successors, (728), 62 states have call predecessors, (728), 66 states have return successors, (816), 726 states have call predecessors, (816), 726 states have call successors, (816) [2025-03-08 05:30:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 6916 transitions. [2025-03-08 05:30:07,469 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 6916 transitions. Word has length 197 [2025-03-08 05:30:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:07,470 INFO L471 AbstractCegarLoop]: Abstraction has 4053 states and 6916 transitions. [2025-03-08 05:30:07,470 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 6916 transitions. [2025-03-08 05:30:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 05:30:07,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:07,489 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, 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-08 05:30:07,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:30:07,489 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash -786630337, now seen corresponding path program 1 times [2025-03-08 05:30:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:07,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878815621] [2025-03-08 05:30:07,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:07,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:07,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:30:07,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:30:07,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:07,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878815621] [2025-03-08 05:30:07,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878815621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:07,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:07,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:07,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150672947] [2025-03-08 05:30:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:07,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:07,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:07,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:07,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:07,546 INFO L87 Difference]: Start difference. First operand 4053 states and 6916 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:30:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:07,700 INFO L93 Difference]: Finished difference Result 9643 states and 16605 transitions. [2025-03-08 05:30:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:07,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 179 [2025-03-08 05:30:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:07,738 INFO L225 Difference]: With dead ends: 9643 [2025-03-08 05:30:07,739 INFO L226 Difference]: Without dead ends: 6089 [2025-03-08 05:30:07,752 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-08 05:30:07,753 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 135 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1355 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-08 05:30:07,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1355 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2025-03-08 05:30:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 6073. [2025-03-08 05:30:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6073 states, 4954 states have (on average 1.6596689543802987) internal successors, (8222), 4964 states have internal predecessors, (8222), 1052 states have call successors, (1052), 62 states have call predecessors, (1052), 66 states have return successors, (1190), 1050 states have call predecessors, (1190), 1050 states have call successors, (1190) [2025-03-08 05:30:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6073 states to 6073 states and 10464 transitions. [2025-03-08 05:30:07,991 INFO L78 Accepts]: Start accepts. Automaton has 6073 states and 10464 transitions. Word has length 179 [2025-03-08 05:30:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:07,991 INFO L471 AbstractCegarLoop]: Abstraction has 6073 states and 10464 transitions. [2025-03-08 05:30:07,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:30:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 6073 states and 10464 transitions. [2025-03-08 05:30:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 05:30:08,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:08,018 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:08,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:30:08,019 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:08,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash 815038298, now seen corresponding path program 1 times [2025-03-08 05:30:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530652527] [2025-03-08 05:30:08,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:08,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:08,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 05:30:08,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 05:30:08,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:08,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:30:08,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:08,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530652527] [2025-03-08 05:30:08,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530652527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:08,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:08,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651212503] [2025-03-08 05:30:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:08,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:08,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:08,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:08,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:08,079 INFO L87 Difference]: Start difference. First operand 6073 states and 10464 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:08,299 INFO L93 Difference]: Finished difference Result 14517 states and 25219 transitions. [2025-03-08 05:30:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:08,300 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 199 [2025-03-08 05:30:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:08,369 INFO L225 Difference]: With dead ends: 14517 [2025-03-08 05:30:08,369 INFO L226 Difference]: Without dead ends: 9359 [2025-03-08 05:30:08,394 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-08 05:30:08,394 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 133 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1355 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-08 05:30:08,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1355 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2025-03-08 05:30:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9343. [2025-03-08 05:30:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9343 states, 7734 states have (on average 1.6674424618567365) internal successors, (12896), 7744 states have internal predecessors, (12896), 1542 states have call successors, (1542), 62 states have call predecessors, (1542), 66 states have return successors, (1763), 1540 states have call predecessors, (1763), 1540 states have call successors, (1763) [2025-03-08 05:30:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9343 states to 9343 states and 16201 transitions. [2025-03-08 05:30:08,893 INFO L78 Accepts]: Start accepts. Automaton has 9343 states and 16201 transitions. Word has length 199 [2025-03-08 05:30:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:08,895 INFO L471 AbstractCegarLoop]: Abstraction has 9343 states and 16201 transitions. [2025-03-08 05:30:08,895 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 9343 states and 16201 transitions. [2025-03-08 05:30:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 05:30:08,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:08,933 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:08,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:30:08,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:08,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1503644615, now seen corresponding path program 1 times [2025-03-08 05:30:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:08,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520798797] [2025-03-08 05:30:08,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:08,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:08,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 05:30:08,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 05:30:08,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:30:09,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520798797] [2025-03-08 05:30:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520798797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:09,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:09,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85735473] [2025-03-08 05:30:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:09,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:09,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:09,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:09,011 INFO L87 Difference]: Start difference. First operand 9343 states and 16201 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:09,381 INFO L93 Difference]: Finished difference Result 22653 states and 39598 transitions. [2025-03-08 05:30:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:09,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 200 [2025-03-08 05:30:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:09,437 INFO L225 Difference]: With dead ends: 22653 [2025-03-08 05:30:09,437 INFO L226 Difference]: Without dead ends: 14857 [2025-03-08 05:30:09,459 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-08 05:30:09,460 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 131 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1369 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-08 05:30:09,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1369 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14857 states. [2025-03-08 05:30:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14857 to 14841. [2025-03-08 05:30:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14841 states, 12246 states have (on average 1.6679732157439164) internal successors, (20426), 12256 states have internal predecessors, (20426), 2528 states have call successors, (2528), 62 states have call predecessors, (2528), 66 states have return successors, (2893), 2526 states have call predecessors, (2893), 2526 states have call successors, (2893) [2025-03-08 05:30:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14841 states to 14841 states and 25847 transitions. [2025-03-08 05:30:09,980 INFO L78 Accepts]: Start accepts. Automaton has 14841 states and 25847 transitions. Word has length 200 [2025-03-08 05:30:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:09,980 INFO L471 AbstractCegarLoop]: Abstraction has 14841 states and 25847 transitions. [2025-03-08 05:30:09,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 14841 states and 25847 transitions. [2025-03-08 05:30:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 05:30:10,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:10,023 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:10,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:30:10,023 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1791053499, now seen corresponding path program 1 times [2025-03-08 05:30:10,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:10,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301699357] [2025-03-08 05:30:10,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:10,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 05:30:10,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 05:30:10,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:30:10,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:10,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301699357] [2025-03-08 05:30:10,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301699357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:10,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:10,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:10,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013759518] [2025-03-08 05:30:10,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:10,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:10,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:10,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:10,085 INFO L87 Difference]: Start difference. First operand 14841 states and 25847 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:10,533 INFO L93 Difference]: Finished difference Result 37407 states and 65524 transitions. [2025-03-08 05:30:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:10,534 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 201 [2025-03-08 05:30:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:10,638 INFO L225 Difference]: With dead ends: 37407 [2025-03-08 05:30:10,638 INFO L226 Difference]: Without dead ends: 24873 [2025-03-08 05:30:10,674 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-08 05:30:10,675 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 129 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1360 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-08 05:30:10,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1360 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24873 states. [2025-03-08 05:30:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24873 to 24857. [2025-03-08 05:30:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24857 states, 20618 states have (on average 1.6694150742070035) internal successors, (34420), 20628 states have internal predecessors, (34420), 4172 states have call successors, (4172), 62 states have call predecessors, (4172), 66 states have return successors, (4726), 4170 states have call predecessors, (4726), 4170 states have call successors, (4726) [2025-03-08 05:30:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24857 states to 24857 states and 43318 transitions. [2025-03-08 05:30:11,958 INFO L78 Accepts]: Start accepts. Automaton has 24857 states and 43318 transitions. Word has length 201 [2025-03-08 05:30:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:11,958 INFO L471 AbstractCegarLoop]: Abstraction has 24857 states and 43318 transitions. [2025-03-08 05:30:11,959 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand 24857 states and 43318 transitions. [2025-03-08 05:30:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 05:30:12,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:12,059 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:12,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:30:12,059 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2038703290, now seen corresponding path program 1 times [2025-03-08 05:30:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30927521] [2025-03-08 05:30:12,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:12,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 05:30:12,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 05:30:12,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:12,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:30:12,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:12,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30927521] [2025-03-08 05:30:12,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30927521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:12,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:12,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:12,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007384818] [2025-03-08 05:30:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:12,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:12,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:12,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:12,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:12,124 INFO L87 Difference]: Start difference. First operand 24857 states and 43318 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:12,899 INFO L93 Difference]: Finished difference Result 59493 states and 103658 transitions. [2025-03-08 05:30:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:12,900 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 202 [2025-03-08 05:30:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:13,064 INFO L225 Difference]: With dead ends: 59493 [2025-03-08 05:30:13,064 INFO L226 Difference]: Without dead ends: 38893 [2025-03-08 05:30:13,113 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-08 05:30:13,114 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 127 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1330 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-08 05:30:13,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1330 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38893 states. [2025-03-08 05:30:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38893 to 38877. [2025-03-08 05:30:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38877 states, 32232 states have (on average 1.6476172747580045) internal successors, (53106), 32242 states have internal predecessors, (53106), 6578 states have call successors, (6578), 62 states have call predecessors, (6578), 66 states have return successors, (7557), 6576 states have call predecessors, (7557), 6576 states have call successors, (7557) [2025-03-08 05:30:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38877 states to 38877 states and 67241 transitions. [2025-03-08 05:30:14,652 INFO L78 Accepts]: Start accepts. Automaton has 38877 states and 67241 transitions. Word has length 202 [2025-03-08 05:30:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:14,653 INFO L471 AbstractCegarLoop]: Abstraction has 38877 states and 67241 transitions. [2025-03-08 05:30:14,653 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 38877 states and 67241 transitions. [2025-03-08 05:30:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 05:30:14,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:14,791 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:14,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:30:14,791 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:14,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1349517724, now seen corresponding path program 1 times [2025-03-08 05:30:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:14,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487473711] [2025-03-08 05:30:14,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:14,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 05:30:14,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 05:30:14,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:14,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:30:14,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:14,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487473711] [2025-03-08 05:30:14,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487473711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:14,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636811513] [2025-03-08 05:30:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:14,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:14,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:14,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:14,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:14,877 INFO L87 Difference]: Start difference. First operand 38877 states and 67241 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:16,475 INFO L93 Difference]: Finished difference Result 102707 states and 178379 transitions. [2025-03-08 05:30:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:16,476 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 203 [2025-03-08 05:30:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:16,750 INFO L225 Difference]: With dead ends: 102707 [2025-03-08 05:30:16,750 INFO L226 Difference]: Without dead ends: 69367 [2025-03-08 05:30:16,819 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-08 05:30:16,820 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 125 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1358 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-08 05:30:16,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1358 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69367 states. [2025-03-08 05:30:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69367 to 69351. [2025-03-08 05:30:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69351 states, 57806 states have (on average 1.6450195481437913) internal successors, (95092), 57816 states have internal predecessors, (95092), 11478 states have call successors, (11478), 62 states have call predecessors, (11478), 66 states have return successors, (13271), 11476 states have call predecessors, (13271), 11476 states have call successors, (13271) [2025-03-08 05:30:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69351 states to 69351 states and 119841 transitions. [2025-03-08 05:30:19,739 INFO L78 Accepts]: Start accepts. Automaton has 69351 states and 119841 transitions. Word has length 203 [2025-03-08 05:30:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:19,739 INFO L471 AbstractCegarLoop]: Abstraction has 69351 states and 119841 transitions. [2025-03-08 05:30:19,739 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 69351 states and 119841 transitions. [2025-03-08 05:30:19,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 05:30:19,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:19,979 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, 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-08 05:30:19,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:30:19,979 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:19,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:19,980 INFO L85 PathProgramCache]: Analyzing trace with hash 745243874, now seen corresponding path program 1 times [2025-03-08 05:30:19,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:19,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470417286] [2025-03-08 05:30:19,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:19,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:20,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:30:20,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:30:20,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:20,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:20,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470417286] [2025-03-08 05:30:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470417286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:20,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003430944] [2025-03-08 05:30:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:20,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:20,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:20,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:20,053 INFO L87 Difference]: Start difference. First operand 69351 states and 119841 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:30:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:22,761 INFO L93 Difference]: Finished difference Result 189171 states and 327423 transitions. [2025-03-08 05:30:22,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:22,761 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 185 [2025-03-08 05:30:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:23,334 INFO L225 Difference]: With dead ends: 189171 [2025-03-08 05:30:23,334 INFO L226 Difference]: Without dead ends: 127177 [2025-03-08 05:30:23,467 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-08 05:30:23,468 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 123 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1366 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-08 05:30:23,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1366 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127177 states. [2025-03-08 05:30:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127177 to 127161. [2025-03-08 05:30:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127161 states, 106590 states have (on average 1.6411858523313632) internal successors, (174934), 106600 states have internal predecessors, (174934), 20504 states have call successors, (20504), 62 states have call predecessors, (20504), 66 states have return successors, (23361), 20502 states have call predecessors, (23361), 20502 states have call successors, (23361) [2025-03-08 05:30:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127161 states to 127161 states and 218799 transitions. [2025-03-08 05:30:28,458 INFO L78 Accepts]: Start accepts. Automaton has 127161 states and 218799 transitions. Word has length 185 [2025-03-08 05:30:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:28,459 INFO L471 AbstractCegarLoop]: Abstraction has 127161 states and 218799 transitions. [2025-03-08 05:30:28,459 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:30:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 127161 states and 218799 transitions. [2025-03-08 05:30:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 05:30:28,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:28,728 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:28,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:30:28,728 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:28,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2059848419, now seen corresponding path program 1 times [2025-03-08 05:30:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739219216] [2025-03-08 05:30:28,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:28,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:28,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 05:30:28,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 05:30:28,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:28,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:30:28,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:28,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739219216] [2025-03-08 05:30:28,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739219216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:28,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:28,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:28,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823205013] [2025-03-08 05:30:28,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:28,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:28,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:28,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:28,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:28,785 INFO L87 Difference]: Start difference. First operand 127161 states and 218799 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:30:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:33,155 INFO L93 Difference]: Finished difference Result 238431 states and 411086 transitions. [2025-03-08 05:30:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:33,155 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 205 [2025-03-08 05:30:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:34,355 INFO L225 Difference]: With dead ends: 238431 [2025-03-08 05:30:34,355 INFO L226 Difference]: Without dead ends: 237911 [2025-03-08 05:30:34,450 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-08 05:30:34,450 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 118 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1372 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-08 05:30:34,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1372 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237911 states.