./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_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-?-e2fb8be-m [2025-03-08 05:32:08,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:32:08,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:32:08,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:32:08,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:32:08,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:32:08,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:32:08,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:32:08,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:32:08,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:32:08,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:32:08,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:32:08,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:32:08,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:08,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:32:08,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:32:08,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:32:08,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:32:08,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:32:08,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:32:08,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:32:08,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:32:08,202 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-08 05:32:08,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:32:08,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:32:08,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:32:08,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:32:08,421 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:32:08,422 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-08 05:32:09,501 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba075c98f/1d71a4bed64747be9a11a12e899c0aec/FLAGbe2b054b4 [2025-03-08 05:32:09,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:32:09,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product23.cil.c [2025-03-08 05:32:09,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba075c98f/1d71a4bed64747be9a11a12e899c0aec/FLAGbe2b054b4 [2025-03-08 05:32:10,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba075c98f/1d71a4bed64747be9a11a12e899c0aec [2025-03-08 05:32:10,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:32:10,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:32:10,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:10,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:32:10,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:32:10,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc90e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10, skipping insertion in model container [2025-03-08 05:32:10,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:32:10,370 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-08 05:32:10,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:10,443 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:32:10,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-08 05:32:10,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [380] [2025-03-08 05:32:10,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [415] [2025-03-08 05:32:10,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1483] [2025-03-08 05:32:10,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1823] [2025-03-08 05:32:10,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1858] [2025-03-08 05:32:10,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1875] [2025-03-08 05:32:10,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2277] [2025-03-08 05:32:10,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2286] [2025-03-08 05:32:10,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2652] [2025-03-08 05:32:10,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2749] [2025-03-08 05:32:10,515 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-08 05:32:10,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:10,549 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:32:10,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10 WrapperNode [2025-03-08 05:32:10,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:10,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:10,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:32:10,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:32:10,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,601 INFO L138 Inliner]: procedures = 130, calls = 201, calls flagged for inlining = 58, calls inlined = 52, statements flattened = 948 [2025-03-08 05:32:10,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:10,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:32:10,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:32:10,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:32:10,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,642 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:32:10,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:32:10,681 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:32:10,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:32:10,681 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:32:10,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (1/1) ... [2025-03-08 05:32:10,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:10,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:10,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:32:10,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:32:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:32:10,729 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:32:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:32:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:32:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:32:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:32:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:32:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:32:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:32:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:32:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:32:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:32:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:32:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:32:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:32:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:32:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:32:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:32:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:32:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:32:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:32:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:32:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:32:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:32:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:32:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:32:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:32:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:32:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:32:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:32:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-08 05:32:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:32:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:32:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:32:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:32:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:32:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:32:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:32:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:32:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:32:10,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:32:10,872 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:32:10,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:32:10,973 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1025-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~10#1; [2025-03-08 05:32:10,983 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2184: #res := ~retValue_acc~34; [2025-03-08 05:32:10,994 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2258: #res := ~retValue_acc~36; [2025-03-08 05:32:11,027 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1117: #res#1 := ~retValue_acc~12#1; [2025-03-08 05:32:11,027 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~11#1; [2025-03-08 05:32:11,057 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1341: #res := ~retValue_acc~15; [2025-03-08 05:32:11,103 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746-1: createEmail_#res#1 := createEmail_~retValue_acc~42#1; [2025-03-08 05:32:11,114 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L569: #res := ~retValue_acc~4; [2025-03-08 05:32:11,157 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2221: #res := ~retValue_acc~35; [2025-03-08 05:32:11,183 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1995: #res := ~retValue_acc~29; [2025-03-08 05:32:11,239 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L895: #res := ~retValue_acc~8; [2025-03-08 05:32:11,322 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1460-1: getClientId_#res#1 := getClientId_~retValue_acc~17#1; [2025-03-08 05:32:11,322 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L978-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~9#1; [2025-03-08 05:32:11,323 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1719-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~22#1; [2025-03-08 05:32:11,563 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855-1: valid_product_#res#1 := valid_product_~retValue_acc~24#1; [2025-03-08 05:32:11,564 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1180-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~13#1; [2025-03-08 05:32:11,564 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1676-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~19#1; [2025-03-08 05:32:11,564 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1694-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~21#1; [2025-03-08 05:32:11,564 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~14#1; [2025-03-08 05:32:11,564 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1685-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~20#1; [2025-03-08 05:32:11,569 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958: #res := ~retValue_acc~28; [2025-03-08 05:32:11,570 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722: #res := ~retValue_acc~40; [2025-03-08 05:32:11,682 INFO L? ?]: Removed 506 outVars from TransFormulas that were not future-live. [2025-03-08 05:32:11,682 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:32:11,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:32:11,717 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:32:11,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:11 BoogieIcfgContainer [2025-03-08 05:32:11,717 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:32:11,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:32:11,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:32:11,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:32:11,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:10" (1/3) ... [2025-03-08 05:32:11,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d39cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:11, skipping insertion in model container [2025-03-08 05:32:11,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:10" (2/3) ... [2025-03-08 05:32:11,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d39cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:11, skipping insertion in model container [2025-03-08 05:32:11,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:11" (3/3) ... [2025-03-08 05:32:11,723 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product23.cil.c [2025-03-08 05:32:11,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:32:11,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product23.cil.c that has 24 procedures, 374 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:32:11,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:32:11,793 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;@4f599712, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:32:11,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:32:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 296 states have (on average 1.5743243243243243) internal successors, (466), 299 states have internal predecessors, (466), 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-08 05:32:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:32:11,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:11,816 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-08 05:32:11,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:11,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash -711526055, now seen corresponding path program 1 times [2025-03-08 05:32:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519910294] [2025-03-08 05:32:11,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:11,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:32:11,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:32:11,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:11,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:12,347 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-08 05:32:12,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519910294] [2025-03-08 05:32:12,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519910294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:12,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466177880] [2025-03-08 05:32:12,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:12,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:12,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:12,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:12,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:32:12,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:32:12,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:32:12,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:12,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:12,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:32:12,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:12,666 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-08 05:32:12,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466177880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:12,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:12,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867331951] [2025-03-08 05:32:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:12,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:12,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:12,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:12,693 INFO L87 Difference]: Start difference. First operand has 374 states, 296 states have (on average 1.5743243243243243) internal successors, (466), 299 states have internal predecessors, (466), 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 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-08 05:32:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:12,767 INFO L93 Difference]: Finished difference Result 558 states and 840 transitions. [2025-03-08 05:32:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:12,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-08 05:32:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:12,778 INFO L225 Difference]: With dead ends: 558 [2025-03-08 05:32:12,778 INFO L226 Difference]: Without dead ends: 368 [2025-03-08 05:32:12,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:12,785 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:12,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1133 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-08 05:32:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-08 05:32:12,864 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-08 05:32:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 562 transitions. [2025-03-08 05:32:12,875 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 562 transitions. Word has length 117 [2025-03-08 05:32:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:12,877 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 562 transitions. [2025-03-08 05:32:12,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-08 05:32:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 562 transitions. [2025-03-08 05:32:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:32:12,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:12,883 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:12,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:13,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:32:13,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2037761087, now seen corresponding path program 1 times [2025-03-08 05:32:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287798068] [2025-03-08 05:32:13,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:32:13,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:32:13,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:13,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287798068] [2025-03-08 05:32:13,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287798068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:13,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558999307] [2025-03-08 05:32:13,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:13,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:13,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:13,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:32:13,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:32:13,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:32:13,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:13,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:32:13,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:13,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558999307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:13,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:13,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:13,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159220325] [2025-03-08 05:32:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:13,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:13,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:13,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:13,649 INFO L87 Difference]: Start difference. First operand 368 states and 562 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-08 05:32:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:13,692 INFO L93 Difference]: Finished difference Result 783 states and 1215 transitions. [2025-03-08 05:32:13,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:13,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 124 [2025-03-08 05:32:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:13,698 INFO L225 Difference]: With dead ends: 783 [2025-03-08 05:32:13,698 INFO L226 Difference]: Without dead ends: 441 [2025-03-08 05:32:13,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:13,703 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 134 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:13,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1089 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-08 05:32:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 433. [2025-03-08 05:32:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 342 states have (on average 1.590643274853801) internal successors, (544), 344 states have internal predecessors, (544), 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-08 05:32:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 677 transitions. [2025-03-08 05:32:13,737 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 677 transitions. Word has length 124 [2025-03-08 05:32:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,737 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 677 transitions. [2025-03-08 05:32:13,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-08 05:32:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 677 transitions. [2025-03-08 05:32:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:32:13,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,743 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:32:13,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:32:13,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1046609423, now seen corresponding path program 1 times [2025-03-08 05:32:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860994357] [2025-03-08 05:32:13,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:32:13,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:32:13,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:32:14,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:14,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860994357] [2025-03-08 05:32:14,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860994357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:14,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713965563] [2025-03-08 05:32:14,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:14,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:14,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:14,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:14,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:32:14,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:32:14,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:32:14,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:14,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:14,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:32:14,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:32:14,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713965563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:32:14,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38440100] [2025-03-08 05:32:14,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:14,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:14,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:14,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:14,490 INFO L87 Difference]: Start difference. First operand 433 states and 677 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), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:32:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:14,547 INFO L93 Difference]: Finished difference Result 857 states and 1344 transitions. [2025-03-08 05:32:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:14,549 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), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-03-08 05:32:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:14,552 INFO L225 Difference]: With dead ends: 857 [2025-03-08 05:32:14,552 INFO L226 Difference]: Without dead ends: 435 [2025-03-08 05:32:14,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:14,558 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 2 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2201 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:14,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2201 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-08 05:32:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2025-03-08 05:32:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 343 states have (on average 1.5889212827988337) internal successors, (545), 346 states have internal predecessors, (545), 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-08 05:32:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 680 transitions. [2025-03-08 05:32:14,575 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 680 transitions. Word has length 144 [2025-03-08 05:32:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:14,576 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 680 transitions. [2025-03-08 05:32:14,576 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), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:32:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 680 transitions. [2025-03-08 05:32:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:32:14,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:14,578 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-03-08 05:32:14,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:14,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:14,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:14,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash 791163476, now seen corresponding path program 1 times [2025-03-08 05:32:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:14,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503820923] [2025-03-08 05:32:14,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:14,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:14,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:32:14,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:32:14,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:14,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:32:14,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:14,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503820923] [2025-03-08 05:32:14,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503820923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:14,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540298474] [2025-03-08 05:32:14,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:14,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:14,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:14,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:14,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:32:15,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:32:15,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:32:15,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:15,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:15,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:32:15,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:32:15,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:15,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540298474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:15,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:15,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:32:15,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292668833] [2025-03-08 05:32:15,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:15,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:15,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:15,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:15,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:15,232 INFO L87 Difference]: Start difference. First operand 435 states and 680 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-08 05:32:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:15,304 INFO L93 Difference]: Finished difference Result 859 states and 1349 transitions. [2025-03-08 05:32:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 126 [2025-03-08 05:32:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:15,308 INFO L225 Difference]: With dead ends: 859 [2025-03-08 05:32:15,308 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 05:32:15,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:15,312 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 2 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:15,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2187 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 05:32:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-03-08 05:32:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 344 states have (on average 1.5872093023255813) internal successors, (546), 348 states have internal predecessors, (546), 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-08 05:32:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 686 transitions. [2025-03-08 05:32:15,326 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 686 transitions. Word has length 126 [2025-03-08 05:32:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:15,326 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 686 transitions. [2025-03-08 05:32:15,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-08 05:32:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 686 transitions. [2025-03-08 05:32:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:32:15,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:15,342 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] [2025-03-08 05:32:15,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:15,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:15,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:15,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1233517668, now seen corresponding path program 1 times [2025-03-08 05:32:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:15,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762745922] [2025-03-08 05:32:15,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:15,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:15,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:32:15,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:32:15,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:15,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762745922] [2025-03-08 05:32:15,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762745922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:15,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:15,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:15,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756813532] [2025-03-08 05:32:15,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:15,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:15,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:15,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:15,670 INFO L87 Difference]: Start difference. First operand 437 states and 686 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:32:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:15,704 INFO L93 Difference]: Finished difference Result 851 states and 1340 transitions. [2025-03-08 05:32:15,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:15,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-03-08 05:32:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:15,707 INFO L225 Difference]: With dead ends: 851 [2025-03-08 05:32:15,707 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 05:32:15,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:15,709 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:15,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2205 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 05:32:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-03-08 05:32:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 344 states have (on average 1.5872093023255813) internal successors, (546), 348 states have internal predecessors, (546), 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-08 05:32:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 685 transitions. [2025-03-08 05:32:15,727 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 685 transitions. Word has length 127 [2025-03-08 05:32:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:15,728 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 685 transitions. [2025-03-08 05:32:15,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:32:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 685 transitions. [2025-03-08 05:32:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 05:32:15,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:15,730 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] [2025-03-08 05:32:15,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:32:15,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:15,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash -538365985, now seen corresponding path program 1 times [2025-03-08 05:32:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:15,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392290427] [2025-03-08 05:32:15,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:15,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:32:15,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:32:15,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:15,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:32:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392290427] [2025-03-08 05:32:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392290427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060811435] [2025-03-08 05:32:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:15,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:15,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:15,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:15,885 INFO L87 Difference]: Start difference. First operand 437 states and 685 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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-08 05:32:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:15,920 INFO L93 Difference]: Finished difference Result 853 states and 1343 transitions. [2025-03-08 05:32:15,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:15,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-08 05:32:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:15,924 INFO L225 Difference]: With dead ends: 853 [2025-03-08 05:32:15,924 INFO L226 Difference]: Without dead ends: 439 [2025-03-08 05:32:15,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:15,925 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:15,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2208 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-08 05:32:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-03-08 05:32:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 345 states have (on average 1.5855072463768116) internal successors, (547), 350 states have internal predecessors, (547), 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-08 05:32:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 688 transitions. [2025-03-08 05:32:15,944 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 688 transitions. Word has length 147 [2025-03-08 05:32:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:15,945 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 688 transitions. [2025-03-08 05:32:15,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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-08 05:32:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 688 transitions. [2025-03-08 05:32:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:32:15,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:15,947 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] [2025-03-08 05:32:15,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:32:15,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:15,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash 568309735, now seen corresponding path program 1 times [2025-03-08 05:32:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:15,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824852198] [2025-03-08 05:32:15,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:15,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:32:15,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:32:15,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:15,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:32:16,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:16,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824852198] [2025-03-08 05:32:16,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824852198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:16,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:16,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816678192] [2025-03-08 05:32:16,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:16,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:16,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:16,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:16,080 INFO L87 Difference]: Start difference. First operand 439 states and 688 transitions. Second operand has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:16,208 INFO L93 Difference]: Finished difference Result 855 states and 1342 transitions. [2025-03-08 05:32:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:32:16,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2025-03-08 05:32:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:16,214 INFO L225 Difference]: With dead ends: 855 [2025-03-08 05:32:16,214 INFO L226 Difference]: Without dead ends: 441 [2025-03-08 05:32:16,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:16,217 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 7 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3786 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:16,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3786 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-08 05:32:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-03-08 05:32:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 347 states have (on average 1.5821325648414986) internal successors, (549), 351 states have internal predecessors, (549), 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-08 05:32:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 689 transitions. [2025-03-08 05:32:16,244 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 689 transitions. Word has length 129 [2025-03-08 05:32:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:16,245 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 689 transitions. [2025-03-08 05:32:16,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 689 transitions. [2025-03-08 05:32:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:32:16,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:16,248 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] [2025-03-08 05:32:16,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:32:16,248 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:16,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash -117393577, now seen corresponding path program 2 times [2025-03-08 05:32:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:16,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90074080] [2025-03-08 05:32:16,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:16,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:16,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-03-08 05:32:16,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 130 statements. [2025-03-08 05:32:16,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:32:16,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:32:16,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:16,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90074080] [2025-03-08 05:32:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90074080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:16,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:16,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58013844] [2025-03-08 05:32:16,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:16,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:16,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:16,358 INFO L87 Difference]: Start difference. First operand 441 states and 689 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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) [2025-03-08 05:32:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:16,393 INFO L93 Difference]: Finished difference Result 610 states and 933 transitions. [2025-03-08 05:32:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:16,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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) Word has length 130 [2025-03-08 05:32:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:16,402 INFO L225 Difference]: With dead ends: 610 [2025-03-08 05:32:16,402 INFO L226 Difference]: Without dead ends: 441 [2025-03-08 05:32:16,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:16,404 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:16,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2225 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-08 05:32:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-03-08 05:32:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 347 states have (on average 1.579250720461095) internal successors, (548), 351 states have internal predecessors, (548), 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-08 05:32:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 688 transitions. [2025-03-08 05:32:16,431 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 688 transitions. Word has length 130 [2025-03-08 05:32:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:16,431 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 688 transitions. [2025-03-08 05:32:16,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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) [2025-03-08 05:32:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 688 transitions. [2025-03-08 05:32:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:32:16,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:16,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:16,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:32:16,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:16,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1410072952, now seen corresponding path program 1 times [2025-03-08 05:32:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137862804] [2025-03-08 05:32:16,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:16,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:32:16,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:32:16,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:16,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:32:16,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137862804] [2025-03-08 05:32:16,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137862804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:16,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:16,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:16,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516854922] [2025-03-08 05:32:16,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:16,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:16,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:16,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:16,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:16,619 INFO L87 Difference]: Start difference. First operand 441 states and 688 transitions. Second operand has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 05:32:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:16,739 INFO L93 Difference]: Finished difference Result 858 states and 1347 transitions. [2025-03-08 05:32:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:32:16,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 156 [2025-03-08 05:32:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:16,743 INFO L225 Difference]: With dead ends: 858 [2025-03-08 05:32:16,745 INFO L226 Difference]: Without dead ends: 444 [2025-03-08 05:32:16,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:16,746 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 5 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:16,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3793 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-08 05:32:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-08 05:32:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 349 states have (on average 1.5759312320916905) internal successors, (550), 354 states have internal predecessors, (550), 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-08 05:32:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 695 transitions. [2025-03-08 05:32:16,765 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 695 transitions. Word has length 156 [2025-03-08 05:32:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:16,765 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 695 transitions. [2025-03-08 05:32:16,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 05:32:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 695 transitions. [2025-03-08 05:32:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 05:32:16,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:16,768 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] [2025-03-08 05:32:16,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:32:16,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash 784699099, now seen corresponding path program 1 times [2025-03-08 05:32:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766880232] [2025-03-08 05:32:16,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:16,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:32:16,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:32:16,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:16,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:32:16,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:16,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766880232] [2025-03-08 05:32:16,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766880232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:16,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142375379] [2025-03-08 05:32:16,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:16,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:16,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:16,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:16,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:32:17,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:32:17,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:32:17,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:17,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:17,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:17,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:32:17,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:32:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:32:17,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142375379] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:32:17,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:32:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:32:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032238649] [2025-03-08 05:32:17,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:32:17,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:32:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:17,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:32:17,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:17,314 INFO L87 Difference]: Start difference. First operand 444 states and 695 transitions. Second operand has 11 states, 10 states have (on average 15.7) internal successors, (157), 11 states have internal predecessors, (157), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 05:32:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:17,872 INFO L93 Difference]: Finished difference Result 1290 states and 2112 transitions. [2025-03-08 05:32:17,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:32:17,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.7) internal successors, (157), 11 states have internal predecessors, (157), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) Word has length 157 [2025-03-08 05:32:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:17,877 INFO L225 Difference]: With dead ends: 1290 [2025-03-08 05:32:17,877 INFO L226 Difference]: Without dead ends: 877 [2025-03-08 05:32:17,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:32:17,879 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1430 mSDsluCounter, 3477 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 4037 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:17,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 4037 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:32:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-08 05:32:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 853. [2025-03-08 05:32:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 679 states have (on average 1.630338733431517) internal successors, (1107), 683 states have internal predecessors, (1107), 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-08 05:32:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1420 transitions. [2025-03-08 05:32:17,907 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1420 transitions. Word has length 157 [2025-03-08 05:32:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:17,907 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1420 transitions. [2025-03-08 05:32:17,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.7) internal successors, (157), 11 states have internal predecessors, (157), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 05:32:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1420 transitions. [2025-03-08 05:32:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 05:32:17,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:17,911 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-08 05:32:17,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:18,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:32:18,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:18,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash -536058347, now seen corresponding path program 1 times [2025-03-08 05:32:18,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:18,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50278665] [2025-03-08 05:32:18,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:18,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:18,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 05:32:18,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 05:32:18,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:18,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:18,186 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-08 05:32:18,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50278665] [2025-03-08 05:32:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50278665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:18,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:18,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071740796] [2025-03-08 05:32:18,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:18,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:18,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:18,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,188 INFO L87 Difference]: Start difference. First operand 853 states and 1420 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:18,226 INFO L93 Difference]: Finished difference Result 2013 states and 3410 transitions. [2025-03-08 05:32:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:18,226 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2025-03-08 05:32:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:18,233 INFO L225 Difference]: With dead ends: 2013 [2025-03-08 05:32:18,233 INFO L226 Difference]: Without dead ends: 1239 [2025-03-08 05:32:18,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,235 INFO L435 NwaCegarLoop]: 581 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, 1131 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:18,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1131 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-03-08 05:32:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1231. [2025-03-08 05:32:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 978 states have (on average 1.6513292433537832) internal successors, (1615), 982 states have internal predecessors, (1615), 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-08 05:32:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2096 transitions. [2025-03-08 05:32:18,281 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2096 transitions. Word has length 161 [2025-03-08 05:32:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:18,281 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 2096 transitions. [2025-03-08 05:32:18,282 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2096 transitions. [2025-03-08 05:32:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 05:32:18,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:18,287 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-08 05:32:18,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:32:18,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:18,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash 401644485, now seen corresponding path program 1 times [2025-03-08 05:32:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683522472] [2025-03-08 05:32:18,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:18,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 05:32:18,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 05:32:18,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:18,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:18,366 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-08 05:32:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683522472] [2025-03-08 05:32:18,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683522472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:18,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:18,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:18,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088090275] [2025-03-08 05:32:18,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:18,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:18,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:18,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,367 INFO L87 Difference]: Start difference. First operand 1231 states and 2096 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:18,435 INFO L93 Difference]: Finished difference Result 2959 states and 5075 transitions. [2025-03-08 05:32:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:18,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2025-03-08 05:32:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:18,445 INFO L225 Difference]: With dead ends: 2959 [2025-03-08 05:32:18,446 INFO L226 Difference]: Without dead ends: 1856 [2025-03-08 05:32:18,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,451 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 129 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:18,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2025-03-08 05:32:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1848. [2025-03-08 05:32:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1476 states have (on average 1.6619241192411924) internal successors, (2453), 1480 states have internal predecessors, (2453), 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-08 05:32:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 3172 transitions. [2025-03-08 05:32:18,545 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 3172 transitions. Word has length 162 [2025-03-08 05:32:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:18,545 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 3172 transitions. [2025-03-08 05:32:18,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 3172 transitions. [2025-03-08 05:32:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 05:32:18,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:18,555 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] [2025-03-08 05:32:18,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:32:18,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:18,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:18,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1594442678, now seen corresponding path program 1 times [2025-03-08 05:32:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:18,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342039680] [2025-03-08 05:32:18,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:18,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 05:32:18,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 05:32:18,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:18,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:18,609 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-08 05:32:18,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:18,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342039680] [2025-03-08 05:32:18,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342039680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:18,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:18,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:18,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097698834] [2025-03-08 05:32:18,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:18,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:18,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:18,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:18,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,614 INFO L87 Difference]: Start difference. First operand 1848 states and 3172 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:18,691 INFO L93 Difference]: Finished difference Result 4393 states and 7606 transitions. [2025-03-08 05:32:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:18,691 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2025-03-08 05:32:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:18,707 INFO L225 Difference]: With dead ends: 4393 [2025-03-08 05:32:18,707 INFO L226 Difference]: Without dead ends: 2801 [2025-03-08 05:32:18,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,714 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 127 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:18,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1107 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2025-03-08 05:32:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 2793. [2025-03-08 05:32:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2793 states, 2259 states have (on average 1.6706507304116867) internal successors, (3774), 2263 states have internal predecessors, (3774), 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-08 05:32:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 4833 transitions. [2025-03-08 05:32:18,873 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 4833 transitions. Word has length 163 [2025-03-08 05:32:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:18,874 INFO L471 AbstractCegarLoop]: Abstraction has 2793 states and 4833 transitions. [2025-03-08 05:32:18,874 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 4833 transitions. [2025-03-08 05:32:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 05:32:18,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:18,888 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-08 05:32:18,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:32:18,888 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:18,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash 451149331, now seen corresponding path program 1 times [2025-03-08 05:32:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:18,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007775909] [2025-03-08 05:32:18,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:18,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:18,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 05:32:18,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 05:32:18,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:18,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:18,937 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-08 05:32:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:18,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007775909] [2025-03-08 05:32:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007775909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:18,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:18,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831992889] [2025-03-08 05:32:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:18,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:18,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:18,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,938 INFO L87 Difference]: Start difference. First operand 2793 states and 4833 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:32:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:19,056 INFO L93 Difference]: Finished difference Result 6655 states and 11607 transitions. [2025-03-08 05:32:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:19,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-03-08 05:32:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:19,081 INFO L225 Difference]: With dead ends: 6655 [2025-03-08 05:32:19,082 INFO L226 Difference]: Without dead ends: 4326 [2025-03-08 05:32:19,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:19,092 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 125 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:19,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1107 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4326 states. [2025-03-08 05:32:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4326 to 4318. [2025-03-08 05:32:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4318 states, 3539 states have (on average 1.677027408872563) internal successors, (5935), 3543 states have internal predecessors, (5935), 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-08 05:32:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4318 states to 4318 states and 7510 transitions. [2025-03-08 05:32:19,298 INFO L78 Accepts]: Start accepts. Automaton has 4318 states and 7510 transitions. Word has length 145 [2025-03-08 05:32:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:19,299 INFO L471 AbstractCegarLoop]: Abstraction has 4318 states and 7510 transitions. [2025-03-08 05:32:19,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:32:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4318 states and 7510 transitions. [2025-03-08 05:32:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 05:32:19,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:19,321 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-08 05:32:19,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:32:19,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:19,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash -178322377, now seen corresponding path program 1 times [2025-03-08 05:32:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175239330] [2025-03-08 05:32:19,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:19,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:32:19,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:32:19,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:19,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:19,380 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-08 05:32:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175239330] [2025-03-08 05:32:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175239330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856752808] [2025-03-08 05:32:19,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:19,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:19,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:19,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:19,382 INFO L87 Difference]: Start difference. First operand 4318 states and 7510 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:19,584 INFO L93 Difference]: Finished difference Result 10693 states and 18703 transitions. [2025-03-08 05:32:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:19,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 165 [2025-03-08 05:32:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:19,618 INFO L225 Difference]: With dead ends: 10693 [2025-03-08 05:32:19,619 INFO L226 Difference]: Without dead ends: 7075 [2025-03-08 05:32:19,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:19,628 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 123 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 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-08 05:32:19,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2025-03-08 05:32:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 7067. [2025-03-08 05:32:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7067 states, 5795 states have (on average 1.6738567730802416) internal successors, (9700), 5799 states have internal predecessors, (9700), 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-08 05:32:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 12305 transitions. [2025-03-08 05:32:19,925 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 12305 transitions. Word has length 165 [2025-03-08 05:32:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:19,926 INFO L471 AbstractCegarLoop]: Abstraction has 7067 states and 12305 transitions. [2025-03-08 05:32:19,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 12305 transitions. [2025-03-08 05:32:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 05:32:19,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:19,955 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, 1] [2025-03-08 05:32:19,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:32:19,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:19,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1673211395, now seen corresponding path program 1 times [2025-03-08 05:32:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:19,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932053309] [2025-03-08 05:32:19,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:19,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:32:19,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:32:19,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:19,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:20,025 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-08 05:32:20,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932053309] [2025-03-08 05:32:20,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932053309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:20,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:20,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144195506] [2025-03-08 05:32:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:20,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:20,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:20,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:20,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:20,027 INFO L87 Difference]: Start difference. First operand 7067 states and 12305 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:20,372 INFO L93 Difference]: Finished difference Result 17875 states and 31318 transitions. [2025-03-08 05:32:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:20,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 166 [2025-03-08 05:32:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:20,441 INFO L225 Difference]: With dead ends: 17875 [2025-03-08 05:32:20,441 INFO L226 Difference]: Without dead ends: 11888 [2025-03-08 05:32:20,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:20,473 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 121 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:20,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11888 states. [2025-03-08 05:32:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11888 to 11880. [2025-03-08 05:32:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11880 states, 9786 states have (on average 1.6743306764765993) internal successors, (16385), 9790 states have internal predecessors, (16385), 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-08 05:32:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11880 states to 11880 states and 20712 transitions. [2025-03-08 05:32:20,994 INFO L78 Accepts]: Start accepts. Automaton has 11880 states and 20712 transitions. Word has length 166 [2025-03-08 05:32:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:20,994 INFO L471 AbstractCegarLoop]: Abstraction has 11880 states and 20712 transitions. [2025-03-08 05:32:20,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 11880 states and 20712 transitions. [2025-03-08 05:32:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:32:21,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:21,033 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, 1, 1] [2025-03-08 05:32:21,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:32:21,033 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1415645464, now seen corresponding path program 1 times [2025-03-08 05:32:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485620905] [2025-03-08 05:32:21,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:21,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:32:21,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:32:21,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:21,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:21,091 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-08 05:32:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:21,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485620905] [2025-03-08 05:32:21,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485620905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:21,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:21,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882630992] [2025-03-08 05:32:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:21,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:21,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:21,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:21,093 INFO L87 Difference]: Start difference. First operand 11880 states and 20712 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:21,531 INFO L93 Difference]: Finished difference Result 28393 states and 49457 transitions. [2025-03-08 05:32:21,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:21,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 167 [2025-03-08 05:32:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:21,606 INFO L225 Difference]: With dead ends: 28393 [2025-03-08 05:32:21,606 INFO L226 Difference]: Without dead ends: 18538 [2025-03-08 05:32:21,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:21,643 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 119 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:21,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1082 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18538 states. [2025-03-08 05:32:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18538 to 18530. [2025-03-08 05:32:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18530 states, 15233 states have (on average 1.6511521039847699) internal successors, (25152), 15237 states have internal predecessors, (25152), 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-08 05:32:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18530 states to 18530 states and 32029 transitions. [2025-03-08 05:32:22,327 INFO L78 Accepts]: Start accepts. Automaton has 18530 states and 32029 transitions. Word has length 167 [2025-03-08 05:32:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:22,328 INFO L471 AbstractCegarLoop]: Abstraction has 18530 states and 32029 transitions. [2025-03-08 05:32:22,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 18530 states and 32029 transitions. [2025-03-08 05:32:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 05:32:22,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:22,371 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, 1, 1, 1] [2025-03-08 05:32:22,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:32:22,372 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:22,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1229192510, now seen corresponding path program 1 times [2025-03-08 05:32:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:22,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522400788] [2025-03-08 05:32:22,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:22,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:22,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:32:22,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:32:22,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:22,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:22,519 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-08 05:32:22,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:22,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522400788] [2025-03-08 05:32:22,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522400788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:22,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:22,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:22,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164023585] [2025-03-08 05:32:22,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:22,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:22,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:22,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:22,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:22,521 INFO L87 Difference]: Start difference. First operand 18530 states and 32029 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:23,460 INFO L93 Difference]: Finished difference Result 48990 states and 85000 transitions. [2025-03-08 05:32:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:23,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2025-03-08 05:32:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:23,652 INFO L225 Difference]: With dead ends: 48990 [2025-03-08 05:32:23,652 INFO L226 Difference]: Without dead ends: 33090 [2025-03-08 05:32:23,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:23,736 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 117 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:23,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1110 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33090 states. [2025-03-08 05:32:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33090 to 33082. [2025-03-08 05:32:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33082 states, 27335 states have (on average 1.6480336564843607) internal successors, (45049), 27339 states have internal predecessors, (45049), 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-08 05:32:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33082 states to 33082 states and 57100 transitions. [2025-03-08 05:32:25,081 INFO L78 Accepts]: Start accepts. Automaton has 33082 states and 57100 transitions. Word has length 168 [2025-03-08 05:32:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:25,082 INFO L471 AbstractCegarLoop]: Abstraction has 33082 states and 57100 transitions. [2025-03-08 05:32:25,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 33082 states and 57100 transitions. [2025-03-08 05:32:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 05:32:25,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:25,141 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, 1, 1, 1, 1] [2025-03-08 05:32:25,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:32:25,142 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -909838882, now seen corresponding path program 1 times [2025-03-08 05:32:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126302701] [2025-03-08 05:32:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:25,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 05:32:25,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 05:32:25,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:25,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:25,192 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-08 05:32:25,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:25,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126302701] [2025-03-08 05:32:25,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126302701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:25,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:25,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:25,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317631976] [2025-03-08 05:32:25,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:25,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:25,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:25,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:25,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:25,194 INFO L87 Difference]: Start difference. First operand 33082 states and 57100 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:32:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:26,574 INFO L93 Difference]: Finished difference Result 90247 states and 156252 transitions. [2025-03-08 05:32:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 150 [2025-03-08 05:32:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:26,877 INFO L225 Difference]: With dead ends: 90247 [2025-03-08 05:32:26,878 INFO L226 Difference]: Without dead ends: 60665 [2025-03-08 05:32:26,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:26,979 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 115 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 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-08 05:32:26,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60665 states. [2025-03-08 05:32:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60665 to 60657. [2025-03-08 05:32:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60657 states, 50397 states have (on average 1.643788320733377) internal successors, (82842), 50401 states have internal predecessors, (82842), 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-08 05:32:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60657 states to 60657 states and 104451 transitions. [2025-03-08 05:32:29,416 INFO L78 Accepts]: Start accepts. Automaton has 60657 states and 104451 transitions. Word has length 150 [2025-03-08 05:32:29,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:29,417 INFO L471 AbstractCegarLoop]: Abstraction has 60657 states and 104451 transitions. [2025-03-08 05:32:29,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:32:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 60657 states and 104451 transitions. [2025-03-08 05:32:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 05:32:29,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:29,492 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, 1, 1, 1, 1, 1] [2025-03-08 05:32:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:32:29,492 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1976212193, now seen corresponding path program 1 times [2025-03-08 05:32:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304138521] [2025-03-08 05:32:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:29,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:32:29,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:32:29,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:29,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:29,552 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-08 05:32:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304138521] [2025-03-08 05:32:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304138521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717857738] [2025-03-08 05:32:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:29,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:29,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:29,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:29,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:29,554 INFO L87 Difference]: Start difference. First operand 60657 states and 104451 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:32,023 INFO L93 Difference]: Finished difference Result 113594 states and 196031 transitions. [2025-03-08 05:32:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:32,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 170 [2025-03-08 05:32:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:32,498 INFO L225 Difference]: With dead ends: 113594 [2025-03-08 05:32:32,498 INFO L226 Difference]: Without dead ends: 113417 [2025-03-08 05:32:32,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:32,555 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 110 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:32,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113417 states. [2025-03-08 05:32:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113417 to 113409. [2025-03-08 05:32:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113409 states, 94781 states have (on average 1.6383979911585655) internal successors, (155289), 94785 states have internal predecessors, (155289), 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-08 05:32:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113409 states to 113409 states and 194680 transitions. [2025-03-08 05:32:36,636 INFO L78 Accepts]: Start accepts. Automaton has 113409 states and 194680 transitions. Word has length 170 [2025-03-08 05:32:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:36,637 INFO L471 AbstractCegarLoop]: Abstraction has 113409 states and 194680 transitions. [2025-03-08 05:32:36,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:32:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 113409 states and 194680 transitions. [2025-03-08 05:32:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 05:32:36,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:36,752 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, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:36,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:32:36,752 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:36,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1497292419, now seen corresponding path program 1 times [2025-03-08 05:32:36,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:36,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744527488] [2025-03-08 05:32:36,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:36,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 05:32:36,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 05:32:36,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:36,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:37,352 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-08 05:32:37,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:37,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744527488] [2025-03-08 05:32:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744527488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:32:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748462154] [2025-03-08 05:32:37,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:37,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:32:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:37,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:32:37,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:37,353 INFO L87 Difference]: Start difference. First operand 113409 states and 194680 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:32:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:39,844 INFO L93 Difference]: Finished difference Result 113753 states and 195173 transitions. [2025-03-08 05:32:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:32:39,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2025-03-08 05:32:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:40,440 INFO L225 Difference]: With dead ends: 113753 [2025-03-08 05:32:40,441 INFO L226 Difference]: Without dead ends: 113584 [2025-03-08 05:32:40,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-08 05:32:40,498 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 488 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:40,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 2385 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:32:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113584 states. [2025-03-08 05:32:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113584 to 113580. [2025-03-08 05:32:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113580 states, 94915 states have (on average 1.6381604593583732) internal successors, (155486), 94920 states have internal predecessors, (155486), 18622 states have call successors, (18622), 38 states have call predecessors, (18622), 42 states have return successors, (20817), 18621 states have call predecessors, (20817), 18619 states have call successors, (20817)