./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_product35.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66ba4360d8cd17925c78e04f17940e3bee0e828bd2ae8cc06c9e6a2549687bf9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:32:36,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:32:36,476 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:36,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:32:36,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:32:36,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:32:36,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:32:36,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:32:36,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:32:36,505 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:32:36,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:32:36,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:32:36,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:32:36,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:32:36,506 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:32:36,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:32:36,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:32:36,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:32:36,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:32:36,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:32:36,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:32:36,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:32:36,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:32:36,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:32:36,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:32:36,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:32:36,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:32:36,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:32:36,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:32:36,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:32:36,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:32:36,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:32:36,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:36,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:32:36,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:32:36,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:32:36,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:32:36,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:32:36,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:32:36,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:32:36,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:32:36,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:32:36,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:32:36,510 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66ba4360d8cd17925c78e04f17940e3bee0e828bd2ae8cc06c9e6a2549687bf9 [2025-03-08 05:32:36,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:32:36,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:32:36,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:32:36,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:32:36,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:32:36,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product35.cil.c [2025-03-08 05:32:37,909 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11b08d55/ff1e2615ff7444bbbffe646df17ca82f/FLAGc152fa1f9 [2025-03-08 05:32:38,234 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:32:38,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product35.cil.c [2025-03-08 05:32:38,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11b08d55/ff1e2615ff7444bbbffe646df17ca82f/FLAGc152fa1f9 [2025-03-08 05:32:38,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11b08d55/ff1e2615ff7444bbbffe646df17ca82f [2025-03-08 05:32:38,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:32:38,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:32:38,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:38,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:32:38,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:32:38,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ec0836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38, skipping insertion in model container [2025-03-08 05:32:38,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:32:38,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product35.cil.c[40704,40717] [2025-03-08 05:32:38,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:38,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:32:38,970 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-03-08 05:32:38,971 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [208] [2025-03-08 05:32:38,971 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [225] [2025-03-08 05:32:38,971 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1305] [2025-03-08 05:32:38,974 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1671] [2025-03-08 05:32:38,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1680] [2025-03-08 05:32:38,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1718] [2025-03-08 05:32:38,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2120] [2025-03-08 05:32:38,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2560] [2025-03-08 05:32:38,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2591] [2025-03-08 05:32:38,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2901] [2025-03-08 05:32:39,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product35.cil.c[40704,40717] [2025-03-08 05:32:39,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:39,094 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:32:39,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:39 WrapperNode [2025-03-08 05:32:39,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:39,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:39,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:32:39,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:32:39,100 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:39" (1/1) ... [2025-03-08 05:32:39,116 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:39" (1/1) ... [2025-03-08 05:32:39,153 INFO L138 Inliner]: procedures = 137, calls = 228, calls flagged for inlining = 65, calls inlined = 62, statements flattened = 1142 [2025-03-08 05:32:39,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:39,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:32:39,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:32:39,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:32:39,166 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:39" (1/1) ... [2025-03-08 05:32:39,166 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:39" (1/1) ... [2025-03-08 05:32:39,171 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:39" (1/1) ... [2025-03-08 05:32:39,195 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:39,195 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:39" (1/1) ... [2025-03-08 05:32:39,195 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:39" (1/1) ... [2025-03-08 05:32:39,210 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:39" (1/1) ... [2025-03-08 05:32:39,213 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:39" (1/1) ... [2025-03-08 05:32:39,217 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:39" (1/1) ... [2025-03-08 05:32:39,220 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:39" (1/1) ... [2025-03-08 05:32:39,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:32:39,230 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:32:39,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:32:39,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:32:39,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:39" (1/1) ... [2025-03-08 05:32:39,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:39,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:39,265 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:39,271 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:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:32:39,288 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:32:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:32:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:32:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:32:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:32:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:32:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:32:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:32:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:32:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:32:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:32:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:32:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:32:39,475 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:32:39,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:32:39,569 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2027: #res := ~retValue_acc~35; [2025-03-08 05:32:39,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2101: #res := ~retValue_acc~37; [2025-03-08 05:32:39,618 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: #res := ~retValue_acc~42; [2025-03-08 05:32:39,661 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L894-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~15#1; [2025-03-08 05:32:39,661 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L939: #res#1 := ~retValue_acc~16#1; [2025-03-08 05:32:39,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1163: #res := ~retValue_acc~19; [2025-03-08 05:32:39,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L847: #res := ~retValue_acc~14; [2025-03-08 05:32:39,725 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L205-1: createEmail_#res#1 := createEmail_~retValue_acc~3#1; [2025-03-08 05:32:39,733 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: #res := ~retValue_acc~8; [2025-03-08 05:32:39,742 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1953: #res := ~retValue_acc~33; [2025-03-08 05:32:39,783 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1990: #res := ~retValue_acc~34; [2025-03-08 05:32:39,788 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2064: #res := ~retValue_acc~36; [2025-03-08 05:32:39,810 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838: #res := ~retValue_acc~30; [2025-03-08 05:32:39,850 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: #res := ~retValue_acc~12; [2025-03-08 05:32:40,005 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1282-1: getClientId_#res#1 := getClientId_~retValue_acc~21#1; [2025-03-08 05:32:40,005 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~20#1; [2025-03-08 05:32:40,005 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1764-1: getEmailId_#res#1 := getEmailId_~retValue_acc~28#1; [2025-03-08 05:32:40,006 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L800-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~13#1; [2025-03-08 05:32:40,231 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1109-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~18#1; [2025-03-08 05:32:40,231 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-03-08 05:32:40,232 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2419-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-03-08 05:32:40,232 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~17#1; [2025-03-08 05:32:40,232 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1715-1: valid_product_#res#1 := valid_product_~retValue_acc~26#1; [2025-03-08 05:32:40,232 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-03-08 05:32:40,239 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1801: #res := ~retValue_acc~29; [2025-03-08 05:32:40,251 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L161-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~0#1; [2025-03-08 05:32:40,251 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: #res#1 := ~retValue_acc~1#1; [2025-03-08 05:32:40,400 INFO L? ?]: Removed 606 outVars from TransFormulas that were not future-live. [2025-03-08 05:32:40,401 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:32:40,422 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:32:40,422 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:32:40,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:40 BoogieIcfgContainer [2025-03-08 05:32:40,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:32:40,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:32:40,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:32:40,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:32:40,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:38" (1/3) ... [2025-03-08 05:32:40,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516fe7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:40, skipping insertion in model container [2025-03-08 05:32:40,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:39" (2/3) ... [2025-03-08 05:32:40,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516fe7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:40, skipping insertion in model container [2025-03-08 05:32:40,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:40" (3/3) ... [2025-03-08 05:32:40,429 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product35.cil.c [2025-03-08 05:32:40,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:32:40,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product35.cil.c that has 31 procedures, 470 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:32:40,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:32:40,521 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;@1f7b32d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:32:40,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:32:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 361 states have (on average 1.5318559556786704) internal successors, (553), 366 states have internal predecessors, (553), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-08 05:32:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 05:32:40,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:40,545 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:40,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:40,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:40,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1092600964, now seen corresponding path program 1 times [2025-03-08 05:32:40,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:40,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687397996] [2025-03-08 05:32:40,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:40,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:32:40,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:32:40,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:40,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 05:32:41,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687397996] [2025-03-08 05:32:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687397996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18413369] [2025-03-08 05:32:41,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:41,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:41,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:41,260 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:41,261 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:41,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:32:41,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:32:41,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:41,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:41,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:32:41,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 05:32:41,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18413369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:41,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:41,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:41,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449570239] [2025-03-08 05:32:41,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:41,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:41,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:41,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:41,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:41,706 INFO L87 Difference]: Start difference. First operand has 470 states, 361 states have (on average 1.5318559556786704) internal successors, (553), 366 states have internal predecessors, (553), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:41,785 INFO L93 Difference]: Finished difference Result 745 states and 1102 transitions. [2025-03-08 05:32:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:41,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 170 [2025-03-08 05:32:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:41,802 INFO L225 Difference]: With dead ends: 745 [2025-03-08 05:32:41,802 INFO L226 Difference]: Without dead ends: 464 [2025-03-08 05:32:41,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 170 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:41,809 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 0 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1403 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:41,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1403 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:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-08 05:32:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-03-08 05:32:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 356 states have (on average 1.5280898876404494) internal successors, (544), 360 states have internal predecessors, (544), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 05:32:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 697 transitions. [2025-03-08 05:32:41,873 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 697 transitions. Word has length 170 [2025-03-08 05:32:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:41,874 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 697 transitions. [2025-03-08 05:32:41,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 697 transitions. [2025-03-08 05:32:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:32:41,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:41,881 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:41,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:32:42,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:42,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:42,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:42,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1301920004, now seen corresponding path program 1 times [2025-03-08 05:32:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:42,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887820230] [2025-03-08 05:32:42,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:42,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:42,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:32:42,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:32:42,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:42,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:32:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:42,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887820230] [2025-03-08 05:32:42,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887820230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:42,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112668834] [2025-03-08 05:32:42,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:42,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:42,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:42,420 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:42,422 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:42,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:32:42,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:32:42,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:42,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:42,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:42,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:32:42,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:42,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112668834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:42,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:42,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:42,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893811376] [2025-03-08 05:32:42,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:42,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:42,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:42,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:42,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:42,796 INFO L87 Difference]: Start difference. First operand 464 states and 697 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:42,870 INFO L93 Difference]: Finished difference Result 980 states and 1493 transitions. [2025-03-08 05:32:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:42,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2025-03-08 05:32:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:42,876 INFO L225 Difference]: With dead ends: 980 [2025-03-08 05:32:42,876 INFO L226 Difference]: Without dead ends: 542 [2025-03-08 05:32:42,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:42,879 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 142 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:42,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1356 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:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-08 05:32:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 534. [2025-03-08 05:32:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 412 states have (on average 1.5509708737864079) internal successors, (639), 416 states have internal predecessors, (639), 91 states have call successors, (91), 30 states have call predecessors, (91), 30 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-08 05:32:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 820 transitions. [2025-03-08 05:32:42,909 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 820 transitions. Word has length 158 [2025-03-08 05:32:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:42,910 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 820 transitions. [2025-03-08 05:32:42,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 820 transitions. [2025-03-08 05:32:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 05:32:42,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:42,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:42,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:43,115 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:43,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:43,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1302912253, now seen corresponding path program 1 times [2025-03-08 05:32:43,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:43,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357216874] [2025-03-08 05:32:43,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:43,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:43,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 05:32:43,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 05:32:43,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:43,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:32:43,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:43,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357216874] [2025-03-08 05:32:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357216874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:43,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856549668] [2025-03-08 05:32:43,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:43,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:43,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:43,323 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:43,326 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:43,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 05:32:43,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 05:32:43,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:43,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:43,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:32:43,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:32:43,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:43,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856549668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:43,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:43,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:32:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080117082] [2025-03-08 05:32:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:43,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:43,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:43,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:43,679 INFO L87 Difference]: Start difference. First operand 534 states and 820 transitions. Second operand has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:32:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:43,737 INFO L93 Difference]: Finished difference Result 1059 states and 1630 transitions. [2025-03-08 05:32:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:43,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178 [2025-03-08 05:32:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:43,741 INFO L225 Difference]: With dead ends: 1059 [2025-03-08 05:32:43,741 INFO L226 Difference]: Without dead ends: 536 [2025-03-08 05:32:43,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 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:43,743 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 2 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2741 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:43,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2741 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:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-08 05:32:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-08 05:32:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 413 states have (on average 1.549636803874092) internal successors, (640), 418 states have internal predecessors, (640), 91 states have call successors, (91), 30 states have call predecessors, (91), 31 states have return successors, (92), 89 states have call predecessors, (92), 90 states have call successors, (92) [2025-03-08 05:32:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 823 transitions. [2025-03-08 05:32:43,767 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 823 transitions. Word has length 178 [2025-03-08 05:32:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:43,768 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 823 transitions. [2025-03-08 05:32:43,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:32:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 823 transitions. [2025-03-08 05:32:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 05:32:43,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:43,774 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,782 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:43,974 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:43,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1210010722, now seen corresponding path program 1 times [2025-03-08 05:32:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152356845] [2025-03-08 05:32:43,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:44,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:32:44,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:32:44,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:44,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 05:32:44,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:44,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152356845] [2025-03-08 05:32:44,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152356845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:44,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773466683] [2025-03-08 05:32:44,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:44,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:44,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:44,190 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:44,195 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:44,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:32:44,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:32:44,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:44,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:44,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:32:44,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:32:44,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773466683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:44,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:44,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:32:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067134615] [2025-03-08 05:32:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:44,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:44,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:44,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:44,528 INFO L87 Difference]: Start difference. First operand 536 states and 823 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:32:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:44,586 INFO L93 Difference]: Finished difference Result 1061 states and 1635 transitions. [2025-03-08 05:32:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:44,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 179 [2025-03-08 05:32:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:44,590 INFO L225 Difference]: With dead ends: 1061 [2025-03-08 05:32:44,590 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:32:44,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 177 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:44,593 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 2 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2727 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:44,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2727 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:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:32:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-03-08 05:32:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 420 states have internal predecessors, (641), 91 states have call successors, (91), 30 states have call predecessors, (91), 32 states have return successors, (97), 89 states have call predecessors, (97), 90 states have call successors, (97) [2025-03-08 05:32:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 829 transitions. [2025-03-08 05:32:44,620 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 829 transitions. Word has length 179 [2025-03-08 05:32:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:44,620 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 829 transitions. [2025-03-08 05:32:44,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:32:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 829 transitions. [2025-03-08 05:32:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 05:32:44,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:44,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:44,633 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:44,828 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:44,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:44,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1652287410, now seen corresponding path program 1 times [2025-03-08 05:32:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303622777] [2025-03-08 05:32:44,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:44,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 05:32:44,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 05:32:44,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:44,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:32:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303622777] [2025-03-08 05:32:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303622777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343844153] [2025-03-08 05:32:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:44,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:44,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:44,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:44,992 INFO L87 Difference]: Start difference. First operand 538 states and 829 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:45,039 INFO L93 Difference]: Finished difference Result 1053 states and 1626 transitions. [2025-03-08 05:32:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 161 [2025-03-08 05:32:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:45,046 INFO L225 Difference]: With dead ends: 1053 [2025-03-08 05:32:45,046 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:32:45,048 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:45,049 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2745 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:45,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2745 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:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:32:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-03-08 05:32:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 420 states have internal predecessors, (641), 91 states have call successors, (91), 30 states have call predecessors, (91), 32 states have return successors, (96), 89 states have call predecessors, (96), 90 states have call successors, (96) [2025-03-08 05:32:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 828 transitions. [2025-03-08 05:32:45,079 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 828 transitions. Word has length 161 [2025-03-08 05:32:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:45,079 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 828 transitions. [2025-03-08 05:32:45,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 828 transitions. [2025-03-08 05:32:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 05:32:45,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:45,083 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:45,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:32:45,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:45,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1738808143, now seen corresponding path program 2 times [2025-03-08 05:32:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:45,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157258498] [2025-03-08 05:32:45,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:45,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:45,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 162 statements into 2 equivalence classes. [2025-03-08 05:32:45,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 162 statements. [2025-03-08 05:32:45,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:32:45,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:32:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157258498] [2025-03-08 05:32:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157258498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766711570] [2025-03-08 05:32:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:45,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:45,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:45,247 INFO L87 Difference]: Start difference. First operand 538 states and 828 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:45,768 INFO L93 Difference]: Finished difference Result 1417 states and 2160 transitions. [2025-03-08 05:32:45,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:32:45,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-03-08 05:32:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:45,774 INFO L225 Difference]: With dead ends: 1417 [2025-03-08 05:32:45,774 INFO L226 Difference]: Without dead ends: 1157 [2025-03-08 05:32:45,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:32:45,776 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 798 mSDsluCounter, 3956 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 4667 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:45,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 4667 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:32:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2025-03-08 05:32:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1057. [2025-03-08 05:32:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 817 states have (on average 1.5556915544675642) internal successors, (1271), 826 states have internal predecessors, (1271), 176 states have call successors, (176), 60 states have call predecessors, (176), 63 states have return successors, (189), 174 states have call predecessors, (189), 174 states have call successors, (189) [2025-03-08 05:32:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1636 transitions. [2025-03-08 05:32:45,843 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1636 transitions. Word has length 162 [2025-03-08 05:32:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:45,843 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1636 transitions. [2025-03-08 05:32:45,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1636 transitions. [2025-03-08 05:32:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:32:45,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:45,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:32:45,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:45,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2073011455, now seen corresponding path program 1 times [2025-03-08 05:32:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362045292] [2025-03-08 05:32:45,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:45,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:32:45,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:32:45,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:45,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:32:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362045292] [2025-03-08 05:32:46,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362045292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093392675] [2025-03-08 05:32:46,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:46,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:46,055 INFO L87 Difference]: Start difference. First operand 1057 states and 1636 transitions. Second operand has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:32:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:46,123 INFO L93 Difference]: Finished difference Result 2093 states and 3245 transitions. [2025-03-08 05:32:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 182 [2025-03-08 05:32:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:46,132 INFO L225 Difference]: With dead ends: 2093 [2025-03-08 05:32:46,132 INFO L226 Difference]: Without dead ends: 1059 [2025-03-08 05:32:46,136 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:46,137 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 1 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2748 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:46,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2748 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:46,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-03-08 05:32:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2025-03-08 05:32:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 818 states have (on average 1.5550122249388754) internal successors, (1272), 828 states have internal predecessors, (1272), 176 states have call successors, (176), 60 states have call predecessors, (176), 64 states have return successors, (191), 174 states have call predecessors, (191), 174 states have call successors, (191) [2025-03-08 05:32:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1639 transitions. [2025-03-08 05:32:46,188 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1639 transitions. Word has length 182 [2025-03-08 05:32:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:46,188 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1639 transitions. [2025-03-08 05:32:46,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:32:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1639 transitions. [2025-03-08 05:32:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 05:32:46,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,193 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:46,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:32:46,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,193 INFO L85 PathProgramCache]: Analyzing trace with hash -161918118, now seen corresponding path program 1 times [2025-03-08 05:32:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020105578] [2025-03-08 05:32:46,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:32:46,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:32:46,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:46,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020105578] [2025-03-08 05:32:46,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020105578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860127406] [2025-03-08 05:32:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:46,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:46,354 INFO L87 Difference]: Start difference. First operand 1059 states and 1639 transitions. Second operand has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:32:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:46,496 INFO L93 Difference]: Finished difference Result 1573 states and 2433 transitions. [2025-03-08 05:32:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:32:46,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 164 [2025-03-08 05:32:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:46,501 INFO L225 Difference]: With dead ends: 1573 [2025-03-08 05:32:46,501 INFO L226 Difference]: Without dead ends: 542 [2025-03-08 05:32:46,504 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:46,505 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 7 mSDsluCounter, 4051 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4731 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:46,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4731 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:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-08 05:32:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-08 05:32:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 417 states have (on average 1.5443645083932853) internal successors, (644), 423 states have internal predecessors, (644), 91 states have call successors, (91), 31 states have call predecessors, (91), 33 states have return successors, (97), 89 states have call predecessors, (97), 90 states have call successors, (97) [2025-03-08 05:32:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 832 transitions. [2025-03-08 05:32:46,527 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 832 transitions. Word has length 164 [2025-03-08 05:32:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:46,528 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 832 transitions. [2025-03-08 05:32:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:32:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 832 transitions. [2025-03-08 05:32:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 05:32:46,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:46,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:32:46,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -66523992, now seen corresponding path program 1 times [2025-03-08 05:32:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018046250] [2025-03-08 05:32:46,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:32:46,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:32:46,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:46,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018046250] [2025-03-08 05:32:46,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018046250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:46,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588934988] [2025-03-08 05:32:46,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:46,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:46,675 INFO L87 Difference]: Start difference. First operand 542 states and 832 transitions. Second operand has 8 states, 7 states have (on average 14.857142857142858) internal successors, (104), 8 states have internal predecessors, (104), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:32:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:46,795 INFO L93 Difference]: Finished difference Result 1060 states and 1635 transitions. [2025-03-08 05:32:46,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:32:46,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.857142857142858) internal successors, (104), 8 states have internal predecessors, (104), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 164 [2025-03-08 05:32:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:46,800 INFO L225 Difference]: With dead ends: 1060 [2025-03-08 05:32:46,800 INFO L226 Difference]: Without dead ends: 545 [2025-03-08 05:32:46,803 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:46,805 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 5 mSDsluCounter, 4063 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4745 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:46,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4745 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:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-08 05:32:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-08 05:32:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 419 states have (on average 1.541766109785203) internal successors, (646), 426 states have internal predecessors, (646), 91 states have call successors, (91), 31 states have call predecessors, (91), 34 states have return successors, (102), 89 states have call predecessors, (102), 90 states have call successors, (102) [2025-03-08 05:32:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 839 transitions. [2025-03-08 05:32:46,824 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 839 transitions. Word has length 164 [2025-03-08 05:32:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:46,824 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 839 transitions. [2025-03-08 05:32:46,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.857142857142858) internal successors, (104), 8 states have internal predecessors, (104), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:32:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 839 transitions. [2025-03-08 05:32:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 05:32:46,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:46,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:32:46,828 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1268005588, now seen corresponding path program 1 times [2025-03-08 05:32:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161582393] [2025-03-08 05:32:46,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:32:46,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:32:46,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:32:46,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161582393] [2025-03-08 05:32:46,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161582393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:46,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901140678] [2025-03-08 05:32:46,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:46,985 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:46,987 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:47,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:32:47,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:32:47,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:47,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:47,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:47,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:47,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:32:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:47,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901140678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:32:47,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:32:47,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:32:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546005214] [2025-03-08 05:32:47,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:32:47,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:32:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:47,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:32:47,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:47,444 INFO L87 Difference]: Start difference. First operand 545 states and 839 transitions. Second operand has 11 states, 10 states have (on average 16.0) internal successors, (160), 11 states have internal predecessors, (160), 4 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-08 05:32:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:48,024 INFO L93 Difference]: Finished difference Result 1517 states and 2440 transitions. [2025-03-08 05:32:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:32:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.0) internal successors, (160), 11 states have internal predecessors, (160), 4 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) Word has length 165 [2025-03-08 05:32:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:48,030 INFO L225 Difference]: With dead ends: 1517 [2025-03-08 05:32:48,030 INFO L226 Difference]: Without dead ends: 1003 [2025-03-08 05:32:48,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 327 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:48,033 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 1603 mSDsluCounter, 4199 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 4885 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:48,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 4885 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:32:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-03-08 05:32:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 979. [2025-03-08 05:32:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 774 states have (on average 1.6059431524547803) internal successors, (1243), 780 states have internal predecessors, (1243), 170 states have call successors, (170), 32 states have call predecessors, (170), 34 states have return successors, (191), 168 states have call predecessors, (191), 169 states have call successors, (191) [2025-03-08 05:32:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1604 transitions. [2025-03-08 05:32:48,067 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1604 transitions. Word has length 165 [2025-03-08 05:32:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:48,068 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1604 transitions. [2025-03-08 05:32:48,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.0) internal successors, (160), 11 states have internal predecessors, (160), 4 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-08 05:32:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1604 transitions. [2025-03-08 05:32:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 05:32:48,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:48,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:32:48,273 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:48,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:48,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1141651805, now seen corresponding path program 1 times [2025-03-08 05:32:48,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:48,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246077264] [2025-03-08 05:32:48,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:48,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:48,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 05:32:48,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 05:32:48,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:48,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246077264] [2025-03-08 05:32:48,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246077264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:48,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:48,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350723176] [2025-03-08 05:32:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:48,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:48,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:48,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:48,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:48,347 INFO L87 Difference]: Start difference. First operand 979 states and 1604 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, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:48,399 INFO L93 Difference]: Finished difference Result 2290 states and 3818 transitions. [2025-03-08 05:32:48,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:48,399 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, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 188 [2025-03-08 05:32:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:48,406 INFO L225 Difference]: With dead ends: 2290 [2025-03-08 05:32:48,407 INFO L226 Difference]: Without dead ends: 1390 [2025-03-08 05:32:48,410 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:48,410 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 139 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1388 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:48,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1388 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:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-08 05:32:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1382. [2025-03-08 05:32:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1098 states have (on average 1.6311475409836065) internal successors, (1791), 1104 states have internal predecessors, (1791), 249 states have call successors, (249), 32 states have call predecessors, (249), 34 states have return successors, (280), 247 states have call predecessors, (280), 248 states have call successors, (280) [2025-03-08 05:32:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2320 transitions. [2025-03-08 05:32:48,495 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2320 transitions. Word has length 188 [2025-03-08 05:32:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:48,495 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 2320 transitions. [2025-03-08 05:32:48,495 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, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2320 transitions. [2025-03-08 05:32:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 05:32:48,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:48,501 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:48,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:32:48,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:48,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash -906564149, now seen corresponding path program 1 times [2025-03-08 05:32:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:48,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030903584] [2025-03-08 05:32:48,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:48,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:32:48,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:32:48,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:48,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:48,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:48,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030903584] [2025-03-08 05:32:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030903584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:48,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:48,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:48,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954154685] [2025-03-08 05:32:48,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:48,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:48,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:48,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:48,554 INFO L87 Difference]: Start difference. First operand 1382 states and 2320 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:48,604 INFO L93 Difference]: Finished difference Result 3301 states and 5587 transitions. [2025-03-08 05:32:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:48,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 170 [2025-03-08 05:32:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:48,614 INFO L225 Difference]: With dead ends: 3301 [2025-03-08 05:32:48,614 INFO L226 Difference]: Without dead ends: 2047 [2025-03-08 05:32:48,619 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:48,619 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 137 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1386 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:48,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1386 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:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-03-08 05:32:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2039. [2025-03-08 05:32:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 1636 states have (on average 1.6460880195599021) internal successors, (2693), 1642 states have internal predecessors, (2693), 368 states have call successors, (368), 32 states have call predecessors, (368), 34 states have return successors, (399), 366 states have call predecessors, (399), 367 states have call successors, (399) [2025-03-08 05:32:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 3460 transitions. [2025-03-08 05:32:48,686 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 3460 transitions. Word has length 170 [2025-03-08 05:32:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:48,687 INFO L471 AbstractCegarLoop]: Abstraction has 2039 states and 3460 transitions. [2025-03-08 05:32:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 3460 transitions. [2025-03-08 05:32:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 05:32:48,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:48,696 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:32:48,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1910619522, now seen corresponding path program 1 times [2025-03-08 05:32:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:48,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228861030] [2025-03-08 05:32:48,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:48,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 05:32:48,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 05:32:48,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:48,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228861030] [2025-03-08 05:32:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228861030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853214922] [2025-03-08 05:32:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:48,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:48,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:48,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:48,750 INFO L87 Difference]: Start difference. First operand 2039 states and 3460 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:48,833 INFO L93 Difference]: Finished difference Result 4840 states and 8286 transitions. [2025-03-08 05:32:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:48,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-03-08 05:32:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:48,869 INFO L225 Difference]: With dead ends: 4840 [2025-03-08 05:32:48,869 INFO L226 Difference]: Without dead ends: 3057 [2025-03-08 05:32:48,874 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:48,875 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 135 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1379 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:48,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1379 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:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2025-03-08 05:32:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 3049. [2025-03-08 05:32:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3049 states, 2484 states have (on average 1.6578099838969405) internal successors, (4118), 2490 states have internal predecessors, (4118), 530 states have call successors, (530), 32 states have call predecessors, (530), 34 states have return successors, (577), 528 states have call predecessors, (577), 529 states have call successors, (577) [2025-03-08 05:32:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 5225 transitions. [2025-03-08 05:32:49,025 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 5225 transitions. Word has length 190 [2025-03-08 05:32:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:49,026 INFO L471 AbstractCegarLoop]: Abstraction has 3049 states and 5225 transitions. [2025-03-08 05:32:49,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 5225 transitions. [2025-03-08 05:32:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 05:32:49,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:49,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:32:49,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:49,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash -136943599, now seen corresponding path program 1 times [2025-03-08 05:32:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38837819] [2025-03-08 05:32:49,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:49,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 05:32:49,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 05:32:49,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:49,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:49,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:49,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38837819] [2025-03-08 05:32:49,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38837819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:49,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:49,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:49,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65600061] [2025-03-08 05:32:49,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:49,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:49,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:49,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:49,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:49,109 INFO L87 Difference]: Start difference. First operand 3049 states and 5225 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:49,212 INFO L93 Difference]: Finished difference Result 7277 states and 12567 transitions. [2025-03-08 05:32:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-03-08 05:32:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:49,237 INFO L225 Difference]: With dead ends: 7277 [2025-03-08 05:32:49,238 INFO L226 Difference]: Without dead ends: 4692 [2025-03-08 05:32:49,249 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:49,250 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 133 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1379 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:49,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1379 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:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2025-03-08 05:32:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 4684. [2025-03-08 05:32:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4684 states, 3874 states have (on average 1.6662364481156426) internal successors, (6455), 3880 states have internal predecessors, (6455), 775 states have call successors, (775), 32 states have call predecessors, (775), 34 states have return successors, (848), 773 states have call predecessors, (848), 774 states have call successors, (848) [2025-03-08 05:32:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 8078 transitions. [2025-03-08 05:32:49,449 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 8078 transitions. Word has length 191 [2025-03-08 05:32:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:49,449 INFO L471 AbstractCegarLoop]: Abstraction has 4684 states and 8078 transitions. [2025-03-08 05:32:49,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 8078 transitions. [2025-03-08 05:32:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 05:32:49,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:49,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:49,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:32:49,470 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:49,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash 588378426, now seen corresponding path program 1 times [2025-03-08 05:32:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:49,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897124210] [2025-03-08 05:32:49,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:49,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 05:32:49,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 05:32:49,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:49,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:49,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897124210] [2025-03-08 05:32:49,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897124210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:49,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:49,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:49,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714724560] [2025-03-08 05:32:49,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:49,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:49,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:49,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:49,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:49,528 INFO L87 Difference]: Start difference. First operand 4684 states and 8078 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:49,665 INFO L93 Difference]: Finished difference Result 11345 states and 19711 transitions. [2025-03-08 05:32:49,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:49,665 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 173 [2025-03-08 05:32:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:49,716 INFO L225 Difference]: With dead ends: 11345 [2025-03-08 05:32:49,716 INFO L226 Difference]: Without dead ends: 7441 [2025-03-08 05:32:49,734 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:49,734 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 131 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1386 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:49,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1386 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:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7441 states. [2025-03-08 05:32:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7441 to 7433. [2025-03-08 05:32:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 6130 states have (on average 1.66721044045677) internal successors, (10220), 6136 states have internal predecessors, (10220), 1268 states have call successors, (1268), 32 states have call predecessors, (1268), 34 states have return successors, (1385), 1266 states have call predecessors, (1385), 1267 states have call successors, (1385) [2025-03-08 05:32:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 12873 transitions. [2025-03-08 05:32:50,102 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 12873 transitions. Word has length 173 [2025-03-08 05:32:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:50,102 INFO L471 AbstractCegarLoop]: Abstraction has 7433 states and 12873 transitions. [2025-03-08 05:32:50,102 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 12873 transitions. [2025-03-08 05:32:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 05:32:50,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:50,134 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:32:50,135 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:50,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash 999991506, now seen corresponding path program 1 times [2025-03-08 05:32:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:50,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329057985] [2025-03-08 05:32:50,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:50,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 05:32:50,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 05:32:50,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:50,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:50,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:50,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329057985] [2025-03-08 05:32:50,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329057985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:50,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:50,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:50,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70761370] [2025-03-08 05:32:50,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:50,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:50,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:50,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:50,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:50,192 INFO L87 Difference]: Start difference. First operand 7433 states and 12873 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:50,474 INFO L93 Difference]: Finished difference Result 18722 states and 32638 transitions. [2025-03-08 05:32:50,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:50,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2025-03-08 05:32:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:50,529 INFO L225 Difference]: With dead ends: 18722 [2025-03-08 05:32:50,530 INFO L226 Difference]: Without dead ends: 12449 [2025-03-08 05:32:50,558 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:50,559 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 129 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1382 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:50,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1382 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:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2025-03-08 05:32:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 12441. [2025-03-08 05:32:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12441 states, 10316 states have (on average 1.668960837533928) internal successors, (17217), 10322 states have internal predecessors, (17217), 2090 states have call successors, (2090), 32 states have call predecessors, (2090), 34 states have return successors, (2285), 2088 states have call predecessors, (2285), 2089 states have call successors, (2285) [2025-03-08 05:32:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12441 states to 12441 states and 21592 transitions. [2025-03-08 05:32:51,206 INFO L78 Accepts]: Start accepts. Automaton has 12441 states and 21592 transitions. Word has length 193 [2025-03-08 05:32:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:51,206 INFO L471 AbstractCegarLoop]: Abstraction has 12441 states and 21592 transitions. [2025-03-08 05:32:51,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 12441 states and 21592 transitions. [2025-03-08 05:32:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 05:32:51,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:51,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:32:51,263 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:51,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash -923850848, now seen corresponding path program 1 times [2025-03-08 05:32:51,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:51,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998684702] [2025-03-08 05:32:51,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:51,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:51,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 05:32:51,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 05:32:51,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:51,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:51,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998684702] [2025-03-08 05:32:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998684702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615112737] [2025-03-08 05:32:51,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:51,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:51,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:51,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:51,334 INFO L87 Difference]: Start difference. First operand 12441 states and 21592 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:51,731 INFO L93 Difference]: Finished difference Result 29765 states and 51617 transitions. [2025-03-08 05:32:51,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:51,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 194 [2025-03-08 05:32:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:51,805 INFO L225 Difference]: With dead ends: 29765 [2025-03-08 05:32:51,806 INFO L226 Difference]: Without dead ends: 19459 [2025-03-08 05:32:51,836 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:51,837 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 127 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1354 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:51,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1354 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:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19459 states. [2025-03-08 05:32:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19459 to 19451. [2025-03-08 05:32:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19451 states, 16123 states have (on average 1.647336103702785) internal successors, (26560), 16129 states have internal predecessors, (26560), 3293 states have call successors, (3293), 32 states have call predecessors, (3293), 34 states have return successors, (3632), 3291 states have call predecessors, (3632), 3292 states have call successors, (3632) [2025-03-08 05:32:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19451 states to 19451 states and 33485 transitions. [2025-03-08 05:32:52,493 INFO L78 Accepts]: Start accepts. Automaton has 19451 states and 33485 transitions. Word has length 194 [2025-03-08 05:32:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:52,493 INFO L471 AbstractCegarLoop]: Abstraction has 19451 states and 33485 transitions. [2025-03-08 05:32:52,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 19451 states and 33485 transitions. [2025-03-08 05:32:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 05:32:52,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:52,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:52,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:32:52,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:52,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1612607208, now seen corresponding path program 1 times [2025-03-08 05:32:52,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:52,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388550285] [2025-03-08 05:32:52,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:52,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:52,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 05:32:52,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 05:32:52,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:52,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:52,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:52,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388550285] [2025-03-08 05:32:52,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388550285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:52,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189525656] [2025-03-08 05:32:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:52,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:52,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:52,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:52,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:52,597 INFO L87 Difference]: Start difference. First operand 19451 states and 33485 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:53,352 INFO L93 Difference]: Finished difference Result 51372 states and 88776 transitions. [2025-03-08 05:32:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 176 [2025-03-08 05:32:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:53,496 INFO L225 Difference]: With dead ends: 51372 [2025-03-08 05:32:53,497 INFO L226 Difference]: Without dead ends: 34696 [2025-03-08 05:32:53,544 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:53,545 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 125 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1382 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:53,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1382 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:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34696 states. [2025-03-08 05:32:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34696 to 34688. [2025-03-08 05:32:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34688 states, 28910 states have (on average 1.644863369076444) internal successors, (47553), 28916 states have internal predecessors, (47553), 5743 states have call successors, (5743), 32 states have call predecessors, (5743), 34 states have return successors, (6356), 5741 states have call predecessors, (6356), 5742 states have call successors, (6356) [2025-03-08 05:32:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34688 states to 34688 states and 59652 transitions. [2025-03-08 05:32:55,043 INFO L78 Accepts]: Start accepts. Automaton has 34688 states and 59652 transitions. Word has length 176 [2025-03-08 05:32:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:55,043 INFO L471 AbstractCegarLoop]: Abstraction has 34688 states and 59652 transitions. [2025-03-08 05:32:55,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 34688 states and 59652 transitions. [2025-03-08 05:32:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 05:32:55,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:55,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:32:55,121 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:55,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1703657249, now seen corresponding path program 1 times [2025-03-08 05:32:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:55,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142919077] [2025-03-08 05:32:55,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:55,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 05:32:55,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 05:32:55,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:55,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142919077] [2025-03-08 05:32:55,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142919077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:55,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:55,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:55,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803565070] [2025-03-08 05:32:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:55,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:55,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:55,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:55,174 INFO L87 Difference]: Start difference. First operand 34688 states and 59652 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:56,261 INFO L93 Difference]: Finished difference Result 94604 states and 163188 transitions. [2025-03-08 05:32:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:56,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 196 [2025-03-08 05:32:56,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:56,680 INFO L225 Difference]: With dead ends: 94604 [2025-03-08 05:32:56,680 INFO L226 Difference]: Without dead ends: 63601 [2025-03-08 05:32:56,742 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:56,743 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 123 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1394 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:56,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1394 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:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63601 states. [2025-03-08 05:32:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63601 to 63593. [2025-03-08 05:32:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63593 states, 53302 states have (on average 1.6411016472177404) internal successors, (87474), 53308 states have internal predecessors, (87474), 10256 states have call successors, (10256), 32 states have call predecessors, (10256), 34 states have return successors, (11401), 10254 states have call predecessors, (11401), 10255 states have call successors, (11401) [2025-03-08 05:32:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63593 states to 63593 states and 109131 transitions. [2025-03-08 05:32:59,023 INFO L78 Accepts]: Start accepts. Automaton has 63593 states and 109131 transitions. Word has length 196 [2025-03-08 05:32:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:59,024 INFO L471 AbstractCegarLoop]: Abstraction has 63593 states and 109131 transitions. [2025-03-08 05:32:59,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 63593 states and 109131 transitions. [2025-03-08 05:32:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 05:32:59,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:59,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:59,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:32:59,174 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:59,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash -61322329, now seen corresponding path program 1 times [2025-03-08 05:32:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101388502] [2025-03-08 05:32:59,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:59,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 05:32:59,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 05:32:59,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:59,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:59,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:59,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101388502] [2025-03-08 05:32:59,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101388502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:59,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:59,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529162703] [2025-03-08 05:32:59,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:59,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:59,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:59,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:59,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:59,475 INFO L87 Difference]: Start difference. First operand 63593 states and 109131 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:33:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:01,460 INFO L93 Difference]: Finished difference Result 119236 states and 205023 transitions. [2025-03-08 05:33:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:01,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 178 [2025-03-08 05:33:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:01,917 INFO L225 Difference]: With dead ends: 119236 [2025-03-08 05:33:01,917 INFO L226 Difference]: Without dead ends: 118968 [2025-03-08 05:33:01,965 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:33:01,966 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 118 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1396 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:33:01,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1396 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118968 states. [2025-03-08 05:33:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118968 to 118960. [2025-03-08 05:33:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118960 states, 100301 states have (on average 1.636125262958495) internal successors, (164105), 100307 states have internal predecessors, (164105), 18624 states have call successors, (18624), 32 states have call predecessors, (18624), 34 states have return successors, (20815), 18622 states have call predecessors, (20815), 18623 states have call successors, (20815) [2025-03-08 05:33:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118960 states to 118960 states and 203544 transitions. [2025-03-08 05:33:06,336 INFO L78 Accepts]: Start accepts. Automaton has 118960 states and 203544 transitions. Word has length 178 [2025-03-08 05:33:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:06,336 INFO L471 AbstractCegarLoop]: Abstraction has 118960 states and 203544 transitions. [2025-03-08 05:33:06,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:33:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 118960 states and 203544 transitions. [2025-03-08 05:33:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 05:33:06,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:06,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:06,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:33:06,491 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:06,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:06,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2095093763, now seen corresponding path program 1 times [2025-03-08 05:33:06,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:06,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162468658] [2025-03-08 05:33:06,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:06,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:06,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:33:06,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:33:06,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:06,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:33:06,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162468658] [2025-03-08 05:33:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162468658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566550999] [2025-03-08 05:33:06,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:06,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:06,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:33:06,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:33:07,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:33:07,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:33:07,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:07,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:07,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:33:07,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:33:07,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:33:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:33:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566550999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:33:07,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:33:07,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-03-08 05:33:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417878735] [2025-03-08 05:33:07,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:33:07,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:33:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:07,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:33:07,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:33:07,763 INFO L87 Difference]: Start difference. First operand 118960 states and 203544 transitions. Second operand has 28 states, 26 states have (on average 10.384615384615385) internal successors, (270), 24 states have internal predecessors, (270), 9 states have call successors, (58), 8 states have call predecessors, (58), 12 states have return successors, (51), 11 states have call predecessors, (51), 9 states have call successors, (51)