./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product23.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product23.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 b26e97b5c42973451de5f20f984873ade34b15aaa31cbbdc58b330ea8f51f185 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:13,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:14,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:14,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:14,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:14,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:14,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:14,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:14,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:14,061 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:14,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:14,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:14,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:14,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:14,061 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:14,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:14,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:14,065 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:14,066 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:14,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:14,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:14,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:14,067 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:14,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:14,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:14,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:14,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:14,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:14,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:14,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:14,067 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 -> b26e97b5c42973451de5f20f984873ade34b15aaa31cbbdc58b330ea8f51f185 [2025-03-03 14:22:14,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:14,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:14,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:14,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:14,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:14,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product23.cil.c [2025-03-03 14:22:15,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72f08c8a/6495b22555e1444bb0560868f3ef2a51/FLAGcba371789 [2025-03-03 14:22:15,830 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:15,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product23.cil.c [2025-03-03 14:22:15,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72f08c8a/6495b22555e1444bb0560868f3ef2a51/FLAGcba371789 [2025-03-03 14:22:16,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72f08c8a/6495b22555e1444bb0560868f3ef2a51 [2025-03-03 14:22:16,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:16,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:16,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:16,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:16,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:16,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5870fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16, skipping insertion in model container [2025-03-03 14:22:16,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:16,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product23.cil.c[46731,46744] [2025-03-03 14:22:16,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:16,475 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:16,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-03 14:22:16,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [380] [2025-03-03 14:22:16,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [415] [2025-03-03 14:22:16,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1483] [2025-03-03 14:22:16,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1823] [2025-03-03 14:22:16,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1858] [2025-03-03 14:22:16,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1875] [2025-03-03 14:22:16,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2277] [2025-03-03 14:22:16,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2286] [2025-03-03 14:22:16,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2652] [2025-03-03 14:22:16,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2749] [2025-03-03 14:22:16,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product23.cil.c[46731,46744] [2025-03-03 14:22:16,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:16,603 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:16,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16 WrapperNode [2025-03-03 14:22:16,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:16,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:16,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:16,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:16,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,671 INFO L138 Inliner]: procedures = 130, calls = 201, calls flagged for inlining = 58, calls inlined = 52, statements flattened = 948 [2025-03-03 14:22:16,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:16,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:16,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:16,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:16,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,710 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:22:16,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:16,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:16,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:16,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:16,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (1/1) ... [2025-03-03 14:22:16,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:16,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:22:16,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:22:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:22:16,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:22:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:22:16,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:22:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:16,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:22:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:22:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:16,808 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:16,808 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:16,808 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:16,808 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:16,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:22:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:16,968 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:16,970 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:17,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1025-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~10#1; [2025-03-03 14:22:17,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2184: #res := ~retValue_acc~34; [2025-03-03 14:22:17,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2258: #res := ~retValue_acc~36; [2025-03-03 14:22:17,127 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1117: #res#1 := ~retValue_acc~12#1; [2025-03-03 14:22:17,128 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~11#1; [2025-03-03 14:22:17,157 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1341: #res := ~retValue_acc~15; [2025-03-03 14:22:17,165 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746-1: createEmail_#res#1 := createEmail_~retValue_acc~42#1; [2025-03-03 14:22:17,180 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L569: #res := ~retValue_acc~4; [2025-03-03 14:22:17,215 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2221: #res := ~retValue_acc~35; [2025-03-03 14:22:17,247 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1995: #res := ~retValue_acc~29; [2025-03-03 14:22:17,304 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L895: #res := ~retValue_acc~8; [2025-03-03 14:22:17,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1460-1: getClientId_#res#1 := getClientId_~retValue_acc~17#1; [2025-03-03 14:22:17,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L978-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~9#1; [2025-03-03 14:22:17,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1719-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~22#1; [2025-03-03 14:22:17,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855-1: valid_product_#res#1 := valid_product_~retValue_acc~24#1; [2025-03-03 14:22:17,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1180-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~13#1; [2025-03-03 14:22:17,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1676-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~19#1; [2025-03-03 14:22:17,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1694-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~21#1; [2025-03-03 14:22:17,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~14#1; [2025-03-03 14:22:17,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1685-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~20#1; [2025-03-03 14:22:17,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958: #res := ~retValue_acc~28; [2025-03-03 14:22:17,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722: #res := ~retValue_acc~40; [2025-03-03 14:22:17,798 INFO L? ?]: Removed 506 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:17,799 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:17,813 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:17,813 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:17,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:17 BoogieIcfgContainer [2025-03-03 14:22:17,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:17,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:17,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:17,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:17,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:16" (1/3) ... [2025-03-03 14:22:17,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a7945d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:17, skipping insertion in model container [2025-03-03 14:22:17,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:16" (2/3) ... [2025-03-03 14:22:17,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a7945d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:17, skipping insertion in model container [2025-03-03 14:22:17,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:17" (3/3) ... [2025-03-03 14:22:17,821 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product23.cil.c [2025-03-03 14:22:17,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:17,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product23.cil.c that has 24 procedures, 375 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:22:17,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:17,893 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;@2edab383, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:17,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 375 states, 297 states have (on average 1.5723905723905724) internal successors, (467), 300 states have internal predecessors, (467), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 14:22:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:22:17,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:17,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:17,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:17,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1803277306, now seen corresponding path program 1 times [2025-03-03 14:22:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:17,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698592825] [2025-03-03 14:22:17,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:18,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:22:18,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:22:18,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:18,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:22:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:18,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698592825] [2025-03-03 14:22:18,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698592825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899947917] [2025-03-03 14:22:18,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:18,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:18,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:18,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:18,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:22:18,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:22:18,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:22:18,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:18,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:18,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:22:18,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:18,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899947917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:18,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:18,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:22:18,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070731951] [2025-03-03 14:22:18,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:18,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:18,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:18,881 INFO L87 Difference]: Start difference. First operand has 375 states, 297 states have (on average 1.5723905723905724) internal successors, (467), 300 states have internal predecessors, (467), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:18,930 INFO L93 Difference]: Finished difference Result 558 states and 838 transitions. [2025-03-03 14:22:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:18,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2025-03-03 14:22:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:18,940 INFO L225 Difference]: With dead ends: 558 [2025-03-03 14:22:18,940 INFO L226 Difference]: Without dead ends: 368 [2025-03-03 14:22:18,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:18,946 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:18,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:18,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-03 14:22:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-03 14:22:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 291 states have (on average 1.570446735395189) internal successors, (457), 293 states have internal predecessors, (457), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 14:22:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 562 transitions. [2025-03-03 14:22:19,011 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 562 transitions. Word has length 117 [2025-03-03 14:22:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:19,011 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 562 transitions. [2025-03-03 14:22:19,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 562 transitions. [2025-03-03 14:22:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:22:19,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:19,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:19,031 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-03 14:22:19,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:22:19,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:19,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 196323662, now seen corresponding path program 1 times [2025-03-03 14:22:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767791735] [2025-03-03 14:22:19,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:19,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:19,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:19,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:19,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:19,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:19,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767791735] [2025-03-03 14:22:19,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767791735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:19,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294040127] [2025-03-03 14:22:19,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:19,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:19,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:19,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:19,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:22:19,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:19,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:19,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:19,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:19,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:19,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:19,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:19,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294040127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:19,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:19,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755235679] [2025-03-03 14:22:19,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:19,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:19,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:19,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:19,816 INFO L87 Difference]: Start difference. First operand 368 states and 562 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:19,863 INFO L93 Difference]: Finished difference Result 547 states and 816 transitions. [2025-03-03 14:22:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:19,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2025-03-03 14:22:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:19,867 INFO L225 Difference]: With dead ends: 547 [2025-03-03 14:22:19,868 INFO L226 Difference]: Without dead ends: 370 [2025-03-03 14:22:19,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:19,869 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:19,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-03 14:22:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-03 14:22:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 293 states have (on average 1.5665529010238908) internal successors, (459), 295 states have internal predecessors, (459), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 14:22:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 564 transitions. [2025-03-03 14:22:19,898 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 564 transitions. Word has length 137 [2025-03-03 14:22:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:19,899 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 564 transitions. [2025-03-03 14:22:19,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 564 transitions. [2025-03-03 14:22:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:22:19,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:19,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:19,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:22:20,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:22:20,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1036470239, now seen corresponding path program 1 times [2025-03-03 14:22:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:20,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733233415] [2025-03-03 14:22:20,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:20,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:22:20,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:22:20,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:20,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733233415] [2025-03-03 14:22:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733233415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229701200] [2025-03-03 14:22:20,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:20,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:20,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:20,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:20,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:22:20,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:22:20,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:22:20,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:20,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:20,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:20,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:20,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:20,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229701200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:20,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:20,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027439577] [2025-03-03 14:22:20,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:20,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:20,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:20,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:20,602 INFO L87 Difference]: Start difference. First operand 370 states and 564 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:20,641 INFO L93 Difference]: Finished difference Result 787 states and 1219 transitions. [2025-03-03 14:22:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:20,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-03-03 14:22:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:20,645 INFO L225 Difference]: With dead ends: 787 [2025-03-03 14:22:20,646 INFO L226 Difference]: Without dead ends: 444 [2025-03-03 14:22:20,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:20,649 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 134 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:20,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1095 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-03 14:22:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 436. [2025-03-03 14:22:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 345 states have (on average 1.5855072463768116) internal successors, (547), 347 states have internal predecessors, (547), 67 states have call successors, (67), 23 states have call predecessors, (67), 23 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 14:22:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 680 transitions. [2025-03-03 14:22:20,668 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 680 transitions. Word has length 126 [2025-03-03 14:22:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:20,668 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 680 transitions. [2025-03-03 14:22:20,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 680 transitions. [2025-03-03 14:22:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:22:20,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:20,671 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:20,681 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-03 14:22:20,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:20,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:20,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:20,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1294305141, now seen corresponding path program 1 times [2025-03-03 14:22:20,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:20,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021233147] [2025-03-03 14:22:20,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:20,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:22:20,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:22:20,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:20,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:22:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021233147] [2025-03-03 14:22:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021233147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436043456] [2025-03-03 14:22:21,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:21,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:21,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:21,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:21,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:22:21,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:22:21,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:22:21,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:21,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:21,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:21,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:22:21,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436043456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:21,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434965076] [2025-03-03 14:22:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:21,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:21,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:21,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:21,367 INFO L87 Difference]: Start difference. First operand 436 states and 680 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:21,427 INFO L93 Difference]: Finished difference Result 863 states and 1350 transitions. [2025-03-03 14:22:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:21,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2025-03-03 14:22:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:21,430 INFO L225 Difference]: With dead ends: 863 [2025-03-03 14:22:21,430 INFO L226 Difference]: Without dead ends: 438 [2025-03-03 14:22:21,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:21,434 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:21,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2205 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-03 14:22:21,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-03 14:22:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 346 states have (on average 1.583815028901734) internal successors, (548), 349 states have internal predecessors, (548), 67 states have call successors, (67), 23 states have call predecessors, (67), 24 states have return successors, (68), 65 states have call predecessors, (68), 66 states have call successors, (68) [2025-03-03 14:22:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 683 transitions. [2025-03-03 14:22:21,454 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 683 transitions. Word has length 146 [2025-03-03 14:22:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:21,455 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 683 transitions. [2025-03-03 14:22:21,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 683 transitions. [2025-03-03 14:22:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:22:21,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:21,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:21,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:21,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:21,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:21,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1771122081, now seen corresponding path program 1 times [2025-03-03 14:22:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:21,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262046948] [2025-03-03 14:22:21,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:21,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:22:21,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:22:21,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:21,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262046948] [2025-03-03 14:22:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262046948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328049585] [2025-03-03 14:22:21,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:21,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:21,814 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:21,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:22:21,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:22:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:22:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:22,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:22,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:22:22,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:22,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328049585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:22,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:22,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:22:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942743382] [2025-03-03 14:22:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:22,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:22,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:22,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:22,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:22,094 INFO L87 Difference]: Start difference. First operand 438 states and 683 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:22,154 INFO L93 Difference]: Finished difference Result 865 states and 1355 transitions. [2025-03-03 14:22:22,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:22,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2025-03-03 14:22:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:22,158 INFO L225 Difference]: With dead ends: 865 [2025-03-03 14:22:22,160 INFO L226 Difference]: Without dead ends: 440 [2025-03-03 14:22:22,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:22,162 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:22,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2191 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:22,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-03 14:22:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-03-03 14:22:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 347 states have (on average 1.5821325648414986) internal successors, (549), 351 states have internal predecessors, (549), 67 states have call successors, (67), 23 states have call predecessors, (67), 25 states have return successors, (73), 65 states have call predecessors, (73), 66 states have call successors, (73) [2025-03-03 14:22:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 689 transitions. [2025-03-03 14:22:22,181 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 689 transitions. Word has length 128 [2025-03-03 14:22:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:22,181 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 689 transitions. [2025-03-03 14:22:22,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 689 transitions. [2025-03-03 14:22:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:22:22,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:22,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:22,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:22:22,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:22,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:22,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1849542865, now seen corresponding path program 1 times [2025-03-03 14:22:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:22,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424611133] [2025-03-03 14:22:22,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:22,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:22:22,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:22:22,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:22,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:22,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:22,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424611133] [2025-03-03 14:22:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424611133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:22,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:22,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:22,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583407887] [2025-03-03 14:22:22,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:22,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:22,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:22,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:22,533 INFO L87 Difference]: Start difference. First operand 440 states and 689 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:22,580 INFO L93 Difference]: Finished difference Result 857 states and 1346 transitions. [2025-03-03 14:22:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 129 [2025-03-03 14:22:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:22,585 INFO L225 Difference]: With dead ends: 857 [2025-03-03 14:22:22,585 INFO L226 Difference]: Without dead ends: 440 [2025-03-03 14:22:22,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:22,588 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 2 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:22,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2209 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-03 14:22:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-03-03 14:22:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 347 states have (on average 1.5821325648414986) internal successors, (549), 351 states have internal predecessors, (549), 67 states have call successors, (67), 23 states have call predecessors, (67), 25 states have return successors, (72), 65 states have call predecessors, (72), 66 states have call successors, (72) [2025-03-03 14:22:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 688 transitions. [2025-03-03 14:22:22,617 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 688 transitions. Word has length 129 [2025-03-03 14:22:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:22,617 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 688 transitions. [2025-03-03 14:22:22,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 688 transitions. [2025-03-03 14:22:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:22:22,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:22,620 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:22,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:22,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:22,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1565255459, now seen corresponding path program 1 times [2025-03-03 14:22:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082626768] [2025-03-03 14:22:22,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:22,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:22:22,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:22:22,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:22,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:22:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082626768] [2025-03-03 14:22:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082626768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:22,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:22,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:22,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105313086] [2025-03-03 14:22:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:22,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:22,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:22,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:22,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:22,773 INFO L87 Difference]: Start difference. First operand 440 states and 688 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:22,814 INFO L93 Difference]: Finished difference Result 859 states and 1349 transitions. [2025-03-03 14:22:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-03-03 14:22:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:22,818 INFO L225 Difference]: With dead ends: 859 [2025-03-03 14:22:22,818 INFO L226 Difference]: Without dead ends: 442 [2025-03-03 14:22:22,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:22,819 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:22,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2212 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-03 14:22:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-03 14:22:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 348 states have (on average 1.5804597701149425) internal successors, (550), 353 states have internal predecessors, (550), 67 states have call successors, (67), 23 states have call predecessors, (67), 26 states have return successors, (74), 65 states have call predecessors, (74), 66 states have call successors, (74) [2025-03-03 14:22:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 691 transitions. [2025-03-03 14:22:22,834 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 691 transitions. Word has length 149 [2025-03-03 14:22:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:22,835 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 691 transitions. [2025-03-03 14:22:22,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:22,835 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 691 transitions. [2025-03-03 14:22:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:22:22,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:22,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:22,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:22:22,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:22,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:22,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1527456791, now seen corresponding path program 1 times [2025-03-03 14:22:22,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:22,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002128150] [2025-03-03 14:22:22,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:22,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:22,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:22:22,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:22:22,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:22,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:22:23,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:23,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002128150] [2025-03-03 14:22:23,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002128150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:23,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:23,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:23,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718753226] [2025-03-03 14:22:23,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:23,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:23,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:23,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:23,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:23,003 INFO L87 Difference]: Start difference. First operand 442 states and 691 transitions. Second operand has 8 states, 7 states have (on average 13.857142857142858) internal successors, (97), 8 states have internal predecessors, (97), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 14:22:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:23,132 INFO L93 Difference]: Finished difference Result 861 states and 1348 transitions. [2025-03-03 14:22:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:23,133 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.857142857142858) internal successors, (97), 8 states have internal predecessors, (97), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 150 [2025-03-03 14:22:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:23,135 INFO L225 Difference]: With dead ends: 861 [2025-03-03 14:22:23,136 INFO L226 Difference]: Without dead ends: 444 [2025-03-03 14:22:23,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:23,138 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 7 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:23,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3793 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-03 14:22:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-03 14:22:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 350 states have (on average 1.5771428571428572) internal successors, (552), 354 states have internal predecessors, (552), 67 states have call successors, (67), 24 states have call predecessors, (67), 26 states have return successors, (73), 65 states have call predecessors, (73), 66 states have call successors, (73) [2025-03-03 14:22:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 692 transitions. [2025-03-03 14:22:23,159 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 692 transitions. Word has length 150 [2025-03-03 14:22:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:23,160 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 692 transitions. [2025-03-03 14:22:23,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.857142857142858) internal successors, (97), 8 states have internal predecessors, (97), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 14:22:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 692 transitions. [2025-03-03 14:22:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:22:23,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:23,162 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:23,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:22:23,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:23,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:23,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1416637728, now seen corresponding path program 1 times [2025-03-03 14:22:23,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:23,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690119018] [2025-03-03 14:22:23,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:23,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:23,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:22:23,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:22:23,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:23,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690119018] [2025-03-03 14:22:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690119018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:23,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:23,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649302989] [2025-03-03 14:22:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:23,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:23,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:23,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:23,309 INFO L87 Difference]: Start difference. First operand 444 states and 692 transitions. Second operand has 8 states, 7 states have (on average 13.0) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:23,433 INFO L93 Difference]: Finished difference Result 864 states and 1355 transitions. [2025-03-03 14:22:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:23,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 132 [2025-03-03 14:22:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:23,437 INFO L225 Difference]: With dead ends: 864 [2025-03-03 14:22:23,437 INFO L226 Difference]: Without dead ends: 447 [2025-03-03 14:22:23,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:23,440 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 5 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3807 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-03 14:22:23,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3807 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-03 14:22:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-03-03 14:22:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 352 states have (on average 1.5738636363636365) internal successors, (554), 357 states have internal predecessors, (554), 67 states have call successors, (67), 24 states have call predecessors, (67), 27 states have return successors, (78), 65 states have call predecessors, (78), 66 states have call successors, (78) [2025-03-03 14:22:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 699 transitions. [2025-03-03 14:22:23,457 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 699 transitions. Word has length 132 [2025-03-03 14:22:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:23,458 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 699 transitions. [2025-03-03 14:22:23,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 699 transitions. [2025-03-03 14:22:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:22:23,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:23,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:23,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:22:23,460 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:23,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:23,461 INFO L85 PathProgramCache]: Analyzing trace with hash -371475593, now seen corresponding path program 1 times [2025-03-03 14:22:23,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:23,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316128129] [2025-03-03 14:22:23,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:23,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:22:23,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:22:23,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:23,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:22:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316128129] [2025-03-03 14:22:23,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316128129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239356325] [2025-03-03 14:22:23,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:23,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:23,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:23,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:23,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:22:23,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:22:23,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:22:23,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:23,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:23,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:23,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239356325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:24,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:24,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:22:24,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539108336] [2025-03-03 14:22:24,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:24,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:22:24,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:24,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:22:24,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:24,015 INFO L87 Difference]: Start difference. First operand 447 states and 699 transitions. Second operand has 11 states, 10 states have (on average 14.4) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:22:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:24,589 INFO L93 Difference]: Finished difference Result 1301 states and 2125 transitions. [2025-03-03 14:22:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:22:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.4) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 133 [2025-03-03 14:22:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:24,597 INFO L225 Difference]: With dead ends: 1301 [2025-03-03 14:22:24,597 INFO L226 Difference]: Without dead ends: 886 [2025-03-03 14:22:24,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:22:24,600 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1493 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 3582 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:24,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 3582 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:22:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-03 14:22:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 862. [2025-03-03 14:22:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 688 states have (on average 1.623546511627907) internal successors, (1117), 692 states have internal predecessors, (1117), 146 states have call successors, (146), 25 states have call predecessors, (146), 27 states have return successors, (167), 144 states have call predecessors, (167), 145 states have call successors, (167) [2025-03-03 14:22:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1430 transitions. [2025-03-03 14:22:24,637 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1430 transitions. Word has length 133 [2025-03-03 14:22:24,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:24,637 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1430 transitions. [2025-03-03 14:22:24,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.4) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:22:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1430 transitions. [2025-03-03 14:22:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:22:24,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:24,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:24,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:24,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:24,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:24,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash 248785999, now seen corresponding path program 1 times [2025-03-03 14:22:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611501349] [2025-03-03 14:22:24,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:24,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:22:24,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:22:24,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:24,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:24,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611501349] [2025-03-03 14:22:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611501349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:24,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:24,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:24,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549066909] [2025-03-03 14:22:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:24,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:24,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:24,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:24,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:24,895 INFO L87 Difference]: Start difference. First operand 862 states and 1430 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:24,930 INFO L93 Difference]: Finished difference Result 2036 states and 3435 transitions. [2025-03-03 14:22:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:24,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-03 14:22:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:24,937 INFO L225 Difference]: With dead ends: 2036 [2025-03-03 14:22:24,937 INFO L226 Difference]: Without dead ends: 1255 [2025-03-03 14:22:24,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:24,940 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 131 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:24,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-03 14:22:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1247. [2025-03-03 14:22:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 994 states have (on average 1.6418511066398391) internal successors, (1632), 998 states have internal predecessors, (1632), 225 states have call successors, (225), 25 states have call predecessors, (225), 27 states have return successors, (256), 223 states have call predecessors, (256), 224 states have call successors, (256) [2025-03-03 14:22:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2113 transitions. [2025-03-03 14:22:24,989 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2113 transitions. Word has length 136 [2025-03-03 14:22:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:24,989 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 2113 transitions. [2025-03-03 14:22:24,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2113 transitions. [2025-03-03 14:22:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:22:25,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:25,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:25,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:22:25,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:25,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:25,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1057710793, now seen corresponding path program 1 times [2025-03-03 14:22:25,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:25,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191396826] [2025-03-03 14:22:25,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:25,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:25,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:25,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:25,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:25,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191396826] [2025-03-03 14:22:25,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191396826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:25,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:25,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:25,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505943788] [2025-03-03 14:22:25,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:25,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:25,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:25,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:25,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:25,071 INFO L87 Difference]: Start difference. First operand 1247 states and 2113 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:25,123 INFO L93 Difference]: Finished difference Result 2999 states and 5117 transitions. [2025-03-03 14:22:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:25,124 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-03 14:22:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:25,135 INFO L225 Difference]: With dead ends: 2999 [2025-03-03 14:22:25,135 INFO L226 Difference]: Without dead ends: 1884 [2025-03-03 14:22:25,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:25,139 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 129 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:25,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2025-03-03 14:22:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1876. [2025-03-03 14:22:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1504 states have (on average 1.6502659574468086) internal successors, (2482), 1508 states have internal predecessors, (2482), 344 states have call successors, (344), 25 states have call predecessors, (344), 27 states have return successors, (375), 342 states have call predecessors, (375), 343 states have call successors, (375) [2025-03-03 14:22:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 3201 transitions. [2025-03-03 14:22:25,215 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 3201 transitions. Word has length 137 [2025-03-03 14:22:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:25,216 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 3201 transitions. [2025-03-03 14:22:25,216 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 3201 transitions. [2025-03-03 14:22:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 14:22:25,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:25,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:25,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:22:25,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:25,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash -534844816, now seen corresponding path program 1 times [2025-03-03 14:22:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:25,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56914557] [2025-03-03 14:22:25,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:25,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 14:22:25,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 14:22:25,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56914557] [2025-03-03 14:22:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56914557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:25,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434883478] [2025-03-03 14:22:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:25,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:25,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:25,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:25,313 INFO L87 Difference]: Start difference. First operand 1876 states and 3201 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:25,407 INFO L93 Difference]: Finished difference Result 4461 states and 7676 transitions. [2025-03-03 14:22:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:25,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-03 14:22:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:25,422 INFO L225 Difference]: With dead ends: 4461 [2025-03-03 14:22:25,422 INFO L226 Difference]: Without dead ends: 2849 [2025-03-03 14:22:25,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:25,429 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 127 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:25,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2025-03-03 14:22:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2841. [2025-03-03 14:22:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2307 states have (on average 1.657130472475076) internal successors, (3823), 2311 states have internal predecessors, (3823), 506 states have call successors, (506), 25 states have call predecessors, (506), 27 states have return successors, (553), 504 states have call predecessors, (553), 505 states have call successors, (553) [2025-03-03 14:22:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 4882 transitions. [2025-03-03 14:22:25,539 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 4882 transitions. Word has length 138 [2025-03-03 14:22:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:25,540 INFO L471 AbstractCegarLoop]: Abstraction has 2841 states and 4882 transitions. [2025-03-03 14:22:25,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 4882 transitions. [2025-03-03 14:22:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:22:25,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:25,555 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:25,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:22:25,555 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:25,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -926242040, now seen corresponding path program 1 times [2025-03-03 14:22:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:25,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533642321] [2025-03-03 14:22:25,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:25,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:22:25,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:22:25,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:25,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:25,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533642321] [2025-03-03 14:22:25,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533642321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:25,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:25,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:25,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557999714] [2025-03-03 14:22:25,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:25,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:25,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:25,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:25,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:25,606 INFO L87 Difference]: Start difference. First operand 2841 states and 4882 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:25,706 INFO L93 Difference]: Finished difference Result 6769 states and 11723 transitions. [2025-03-03 14:22:25,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:25,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-03-03 14:22:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:25,730 INFO L225 Difference]: With dead ends: 6769 [2025-03-03 14:22:25,731 INFO L226 Difference]: Without dead ends: 4407 [2025-03-03 14:22:25,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:25,741 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 125 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:25,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4407 states. [2025-03-03 14:22:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4407 to 4399. [2025-03-03 14:22:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4399 states, 3620 states have (on average 1.6621546961325966) internal successors, (6017), 3624 states have internal predecessors, (6017), 751 states have call successors, (751), 25 states have call predecessors, (751), 27 states have return successors, (824), 749 states have call predecessors, (824), 750 states have call successors, (824) [2025-03-03 14:22:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4399 states to 4399 states and 7592 transitions. [2025-03-03 14:22:25,942 INFO L78 Accepts]: Start accepts. Automaton has 4399 states and 7592 transitions. Word has length 139 [2025-03-03 14:22:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:25,942 INFO L471 AbstractCegarLoop]: Abstraction has 4399 states and 7592 transitions. [2025-03-03 14:22:25,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4399 states and 7592 transitions. [2025-03-03 14:22:25,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:22:25,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:25,960 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:25,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:25,960 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:25,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1311075188, now seen corresponding path program 1 times [2025-03-03 14:22:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:25,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290937065] [2025-03-03 14:22:25,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:25,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:22:25,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:22:25,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:26,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:26,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290937065] [2025-03-03 14:22:26,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290937065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:26,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:26,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:26,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272151401] [2025-03-03 14:22:26,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:26,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:26,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:26,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,012 INFO L87 Difference]: Start difference. First operand 4399 states and 7592 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:26,160 INFO L93 Difference]: Finished difference Result 10884 states and 18896 transitions. [2025-03-03 14:22:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:26,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 159 [2025-03-03 14:22:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:26,200 INFO L225 Difference]: With dead ends: 10884 [2025-03-03 14:22:26,200 INFO L226 Difference]: Without dead ends: 7211 [2025-03-03 14:22:26,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,212 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 123 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:26,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7211 states. [2025-03-03 14:22:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7211 to 7203. [2025-03-03 14:22:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7203 states, 5931 states have (on average 1.6585735963581183) internal successors, (9837), 5935 states have internal predecessors, (9837), 1244 states have call successors, (1244), 25 states have call predecessors, (1244), 27 states have return successors, (1361), 1242 states have call predecessors, (1361), 1243 states have call successors, (1361) [2025-03-03 14:22:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7203 states to 7203 states and 12442 transitions. [2025-03-03 14:22:26,540 INFO L78 Accepts]: Start accepts. Automaton has 7203 states and 12442 transitions. Word has length 159 [2025-03-03 14:22:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:26,541 INFO L471 AbstractCegarLoop]: Abstraction has 7203 states and 12442 transitions. [2025-03-03 14:22:26,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7203 states and 12442 transitions. [2025-03-03 14:22:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:22:26,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:26,565 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:26,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:26,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:26,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1610763257, now seen corresponding path program 1 times [2025-03-03 14:22:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746148451] [2025-03-03 14:22:26,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:26,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:22:26,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:22:26,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:26,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746148451] [2025-03-03 14:22:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746148451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:26,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369312703] [2025-03-03 14:22:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:26,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:26,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,626 INFO L87 Difference]: Start difference. First operand 7203 states and 12442 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:26,927 INFO L93 Difference]: Finished difference Result 18199 states and 31644 transitions. [2025-03-03 14:22:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:26,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-03-03 14:22:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:26,984 INFO L225 Difference]: With dead ends: 18199 [2025-03-03 14:22:26,984 INFO L226 Difference]: Without dead ends: 12118 [2025-03-03 14:22:27,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:27,011 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 121 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:27,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12118 states. [2025-03-03 14:22:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12118 to 12110. [2025-03-03 14:22:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12110 states, 10016 states have (on average 1.6589456869009584) internal successors, (16616), 10020 states have internal predecessors, (16616), 2066 states have call successors, (2066), 25 states have call predecessors, (2066), 27 states have return successors, (2261), 2064 states have call predecessors, (2261), 2065 states have call successors, (2261) [2025-03-03 14:22:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12110 states to 12110 states and 20943 transitions. [2025-03-03 14:22:27,435 INFO L78 Accepts]: Start accepts. Automaton has 12110 states and 20943 transitions. Word has length 141 [2025-03-03 14:22:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:27,435 INFO L471 AbstractCegarLoop]: Abstraction has 12110 states and 20943 transitions. [2025-03-03 14:22:27,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12110 states and 20943 transitions. [2025-03-03 14:22:27,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 14:22:27,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:27,541 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:27,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:22:27,542 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:27,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1270425205, now seen corresponding path program 1 times [2025-03-03 14:22:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716221] [2025-03-03 14:22:27,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:27,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:22:27,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:22:27,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:27,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:27,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716221] [2025-03-03 14:22:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:27,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:27,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215568884] [2025-03-03 14:22:27,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:27,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:27,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:27,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:27,590 INFO L87 Difference]: Start difference. First operand 12110 states and 20943 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:27,989 INFO L93 Difference]: Finished difference Result 28955 states and 50021 transitions. [2025-03-03 14:22:27,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:27,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2025-03-03 14:22:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:28,069 INFO L225 Difference]: With dead ends: 28955 [2025-03-03 14:22:28,070 INFO L226 Difference]: Without dead ends: 18934 [2025-03-03 14:22:28,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:28,098 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 119 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:28,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1088 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18934 states. [2025-03-03 14:22:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18934 to 18926. [2025-03-03 14:22:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18926 states, 15629 states have (on average 1.634717512316847) internal successors, (25549), 15633 states have internal predecessors, (25549), 3269 states have call successors, (3269), 25 states have call predecessors, (3269), 27 states have return successors, (3608), 3267 states have call predecessors, (3608), 3268 states have call successors, (3608) [2025-03-03 14:22:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18926 states to 18926 states and 32426 transitions. [2025-03-03 14:22:28,928 INFO L78 Accepts]: Start accepts. Automaton has 18926 states and 32426 transitions. Word has length 161 [2025-03-03 14:22:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:28,929 INFO L471 AbstractCegarLoop]: Abstraction has 18926 states and 32426 transitions. [2025-03-03 14:22:28,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 18926 states and 32426 transitions. [2025-03-03 14:22:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 14:22:28,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:28,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:28,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:22:28,969 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:28,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash 265280919, now seen corresponding path program 1 times [2025-03-03 14:22:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:28,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775017478] [2025-03-03 14:22:28,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:28,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:28,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:22:28,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:22:28,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:28,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:29,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775017478] [2025-03-03 14:22:29,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775017478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:29,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:29,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735001727] [2025-03-03 14:22:29,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:29,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:29,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:29,041 INFO L87 Difference]: Start difference. First operand 18926 states and 32426 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:29,825 INFO L93 Difference]: Finished difference Result 49992 states and 86004 transitions. [2025-03-03 14:22:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:29,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2025-03-03 14:22:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:29,954 INFO L225 Difference]: With dead ends: 49992 [2025-03-03 14:22:29,954 INFO L226 Difference]: Without dead ends: 33789 [2025-03-03 14:22:30,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:30,001 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 117 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:30,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2025-03-03 14:22:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 33781. [2025-03-03 14:22:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33781 states, 28034 states have (on average 1.631911250624242) internal successors, (45749), 28038 states have internal predecessors, (45749), 5719 states have call successors, (5719), 25 states have call predecessors, (5719), 27 states have return successors, (6332), 5717 states have call predecessors, (6332), 5718 states have call successors, (6332) [2025-03-03 14:22:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33781 states to 33781 states and 57800 transitions. [2025-03-03 14:22:31,132 INFO L78 Accepts]: Start accepts. Automaton has 33781 states and 57800 transitions. Word has length 162 [2025-03-03 14:22:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:31,132 INFO L471 AbstractCegarLoop]: Abstraction has 33781 states and 57800 transitions. [2025-03-03 14:22:31,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 33781 states and 57800 transitions. [2025-03-03 14:22:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:22:31,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:31,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:31,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:22:31,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:31,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1369883411, now seen corresponding path program 1 times [2025-03-03 14:22:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896808024] [2025-03-03 14:22:31,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:31,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:22:31,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:22:31,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:31,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:31,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896808024] [2025-03-03 14:22:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896808024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:31,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:31,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731788040] [2025-03-03 14:22:31,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:31,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:31,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:31,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:31,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,227 INFO L87 Difference]: Start difference. First operand 33781 states and 57800 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:32,810 INFO L93 Difference]: Finished difference Result 92084 states and 158091 transitions. [2025-03-03 14:22:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:32,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2025-03-03 14:22:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:33,050 INFO L225 Difference]: With dead ends: 92084 [2025-03-03 14:22:33,051 INFO L226 Difference]: Without dead ends: 61933 [2025-03-03 14:22:33,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:33,130 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 115 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:33,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61933 states. [2025-03-03 14:22:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61933 to 61925. [2025-03-03 14:22:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61925 states, 51665 states have (on average 1.6280073550759702) internal successors, (84111), 51669 states have internal predecessors, (84111), 10232 states have call successors, (10232), 25 states have call predecessors, (10232), 27 states have return successors, (11377), 10230 states have call predecessors, (11377), 10231 states have call successors, (11377) [2025-03-03 14:22:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61925 states to 61925 states and 105720 transitions. [2025-03-03 14:22:35,400 INFO L78 Accepts]: Start accepts. Automaton has 61925 states and 105720 transitions. Word has length 144 [2025-03-03 14:22:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:35,401 INFO L471 AbstractCegarLoop]: Abstraction has 61925 states and 105720 transitions. [2025-03-03 14:22:35,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 61925 states and 105720 transitions. [2025-03-03 14:22:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:22:35,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:35,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:35,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:22:35,458 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:35,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash -120707099, now seen corresponding path program 1 times [2025-03-03 14:22:35,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:35,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241490484] [2025-03-03 14:22:35,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:35,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:22:35,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:22:35,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:35,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:35,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:35,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241490484] [2025-03-03 14:22:35,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241490484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:35,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:35,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:35,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97309851] [2025-03-03 14:22:35,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:35,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:35,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:35,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:35,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:35,511 INFO L87 Difference]: Start difference. First operand 61925 states and 105720 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:38,117 INFO L93 Difference]: Finished difference Result 115950 states and 198389 transitions. [2025-03-03 14:22:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:38,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 145 [2025-03-03 14:22:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:38,655 INFO L225 Difference]: With dead ends: 115950 [2025-03-03 14:22:38,655 INFO L226 Difference]: Without dead ends: 115773 [2025-03-03 14:22:38,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:38,727 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 110 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:38,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115773 states. [2025-03-03 14:22:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115773 to 115765. [2025-03-03 14:22:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115765 states, 97137 states have (on average 1.6229243233783213) internal successors, (157646), 97141 states have internal predecessors, (157646), 18600 states have call successors, (18600), 25 states have call predecessors, (18600), 27 states have return successors, (20791), 18598 states have call predecessors, (20791), 18599 states have call successors, (20791) [2025-03-03 14:22:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115765 states to 115765 states and 197037 transitions. [2025-03-03 14:22:43,086 INFO L78 Accepts]: Start accepts. Automaton has 115765 states and 197037 transitions. Word has length 145 [2025-03-03 14:22:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:43,086 INFO L471 AbstractCegarLoop]: Abstraction has 115765 states and 197037 transitions. [2025-03-03 14:22:43,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 115765 states and 197037 transitions. [2025-03-03 14:22:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 14:22:43,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:43,169 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:22:43,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:22:43,170 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:43,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash -739868279, now seen corresponding path program 1 times [2025-03-03 14:22:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534075527] [2025-03-03 14:22:43,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:43,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:43,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 14:22:43,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 14:22:43,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:43,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:43,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:43,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534075527] [2025-03-03 14:22:43,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534075527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:43,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:43,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:22:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845486640] [2025-03-03 14:22:43,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:43,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:22:43,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:43,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:22:43,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:43,300 INFO L87 Difference]: Start difference. First operand 115765 states and 197037 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:47,518 INFO L93 Difference]: Finished difference Result 222624 states and 380531 transitions. [2025-03-03 14:22:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:22:47,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 165 [2025-03-03 14:22:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:48,411 INFO L225 Difference]: With dead ends: 222624 [2025-03-03 14:22:48,411 INFO L226 Difference]: Without dead ends: 222455 [2025-03-03 14:22:48,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:48,507 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 507 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2882 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:48,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2882 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:22:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222455 states. [2025-03-03 14:22:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222455 to 222447. [2025-03-03 14:22:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222447 states, 186694 states have (on average 1.6264421995350682) internal successors, (303647), 186644 states have internal predecessors, (303647), 35702 states have call successors, (35702), 47 states have call predecessors, (35702), 50 states have return successors, (38985), 35755 states have call predecessors, (38985), 35700 states have call successors, (38985) [2025-03-03 14:22:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222447 states to 222447 states and 378334 transitions. [2025-03-03 14:22:55,951 INFO L78 Accepts]: Start accepts. Automaton has 222447 states and 378334 transitions. Word has length 165 [2025-03-03 14:22:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:55,952 INFO L471 AbstractCegarLoop]: Abstraction has 222447 states and 378334 transitions. [2025-03-03 14:22:55,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 222447 states and 378334 transitions. [2025-03-03 14:22:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:22:56,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:56,076 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:56,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:22:56,076 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1546373740, now seen corresponding path program 1 times [2025-03-03 14:22:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867754286] [2025-03-03 14:22:56,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:22:56,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:22:56,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:56,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:56,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867754286] [2025-03-03 14:22:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867754286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:56,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:56,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:56,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120478725] [2025-03-03 14:22:56,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:56,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:56,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:56,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:56,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:56,204 INFO L87 Difference]: Start difference. First operand 222447 states and 378334 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15)