./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product17.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product17.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 4d912bb29f92146b3af89aaec6570a3971933bc9b9284807c8f8b532bfb963bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:02,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:02,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:02,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:02,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:02,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:02,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:02,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:02,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:02,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:02,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:02,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:02,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:02,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:02,627 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:02,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:02,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:02,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:02,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:02,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:02,630 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:02,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:02,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:02,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:02,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:02,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:02,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:02,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:02,630 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 -> 4d912bb29f92146b3af89aaec6570a3971933bc9b9284807c8f8b532bfb963bf [2025-03-03 14:22:02,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:02,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:02,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:02,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:02,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:02,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product17.cil.c [2025-03-03 14:22:03,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eace5cdcc/6cace01832c543998d96e19b33304369/FLAG772b49126 [2025-03-03 14:22:04,255 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:04,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product17.cil.c [2025-03-03 14:22:04,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eace5cdcc/6cace01832c543998d96e19b33304369/FLAG772b49126 [2025-03-03 14:22:04,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eace5cdcc/6cace01832c543998d96e19b33304369 [2025-03-03 14:22:04,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:04,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:04,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:04,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:04,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:04,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:04" (1/1) ... [2025-03-03 14:22:04,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fa448f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:04, skipping insertion in model container [2025-03-03 14:22:04,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:04" (1/1) ... [2025-03-03 14:22:04,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:04,839 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_product17.cil.c[18815,18828] [2025-03-03 14:22:04,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:04,975 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:04,981 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-03-03 14:22:04,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [382] [2025-03-03 14:22:04,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [682] [2025-03-03 14:22:04,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [715] [2025-03-03 14:22:04,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [750] [2025-03-03 14:22:04,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [966] [2025-03-03 14:22:04,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [975] [2025-03-03 14:22:04,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [992] [2025-03-03 14:22:04,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1358] [2025-03-03 14:22:04,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2422] [2025-03-03 14:22:04,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2520] [2025-03-03 14:22:05,011 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_product17.cil.c[18815,18828] [2025-03-03 14:22:05,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:05,095 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:05,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05 WrapperNode [2025-03-03 14:22:05,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:05,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:05,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:05,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:05,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,174 INFO L138 Inliner]: procedures = 127, calls = 193, calls flagged for inlining = 52, calls inlined = 46, statements flattened = 886 [2025-03-03 14:22:05,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:05,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:05,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:05,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:05,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,210 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:22:05,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:05,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:05,240 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:05,240 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:05,241 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (1/1) ... [2025-03-03 14:22:05,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:05,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:05,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:22:05,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:22:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:22:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:22:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:22:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:22:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2025-03-03 14:22:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2025-03-03 14:22:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:05,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:22:05,291 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:22:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:05,292 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:22:05,292 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:22:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:05,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:05,445 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:05,447 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:05,544 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~21#1; [2025-03-03 14:22:05,555 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2828: #res := ~retValue_acc~40; [2025-03-03 14:22:05,567 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2902: #res := ~retValue_acc~42; [2025-03-03 14:22:05,599 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2011-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~22#1; [2025-03-03 14:22:05,599 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: #res#1 := ~retValue_acc~23#1; [2025-03-03 14:22:05,641 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2280: #res := ~retValue_acc~26; [2025-03-03 14:22:05,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517-1: createEmail_#res#1 := createEmail_~retValue_acc~31#1; [2025-03-03 14:22:05,667 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: #res := ~retValue_acc~15; [2025-03-03 14:22:05,791 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L293-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~4#1; [2025-03-03 14:22:05,792 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-1: getClientId_#res#1 := getClientId_~retValue_acc~28#1; [2025-03-03 14:22:05,797 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2865: #res := ~retValue_acc~41; [2025-03-03 14:22:05,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2639: #res := ~retValue_acc~35; [2025-03-03 14:22:05,876 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1834: #res := ~retValue_acc~19; [2025-03-03 14:22:06,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L250-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~1#1; [2025-03-03 14:22:06,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L259-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~2#1; [2025-03-03 14:22:06,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L268-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~3#1; [2025-03-03 14:22:06,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2025-03-03 14:22:06,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2226-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~25#1; [2025-03-03 14:22:06,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2119-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~24#1; [2025-03-03 14:22:06,090 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2602: #res := ~retValue_acc~34; [2025-03-03 14:22:06,092 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2493: #res := ~retValue_acc~29; [2025-03-03 14:22:06,201 INFO L? ?]: Removed 472 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:06,201 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:06,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:06,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:06,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:06 BoogieIcfgContainer [2025-03-03 14:22:06,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:06,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:06,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:06,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:06,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:04" (1/3) ... [2025-03-03 14:22:06,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c41878f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:06, skipping insertion in model container [2025-03-03 14:22:06,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:05" (2/3) ... [2025-03-03 14:22:06,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c41878f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:06, skipping insertion in model container [2025-03-03 14:22:06,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:06" (3/3) ... [2025-03-03 14:22:06,222 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product17.cil.c [2025-03-03 14:22:06,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:06,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product17.cil.c that has 24 procedures, 358 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:22:06,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:06,292 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;@746348a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:06,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 282 states have (on average 1.5780141843971631) internal successors, (445), 285 states have internal predecessors, (445), 51 states have call successors, (51), 23 states have call predecessors, (51), 23 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-03 14:22:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:22:06,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:06,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:06,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:06,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:06,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1560712644, now seen corresponding path program 1 times [2025-03-03 14:22:06,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:06,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439530250] [2025-03-03 14:22:06,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:06,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:06,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:22:06,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:22:06,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:06,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:06,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439530250] [2025-03-03 14:22:06,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439530250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789100487] [2025-03-03 14:22:06,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:06,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:06,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:06,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:06,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:22:07,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:22:07,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:22:07,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:07,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:07,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:22:07,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:07,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:07,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789100487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:07,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:07,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:22:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304563021] [2025-03-03 14:22:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:07,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:07,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:07,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:07,195 INFO L87 Difference]: Start difference. First operand has 358 states, 282 states have (on average 1.5780141843971631) internal successors, (445), 285 states have internal predecessors, (445), 51 states have call successors, (51), 23 states have call predecessors, (51), 23 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:07,239 INFO L93 Difference]: Finished difference Result 529 states and 794 transitions. [2025-03-03 14:22:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:07,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-03-03 14:22:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:07,257 INFO L225 Difference]: With dead ends: 529 [2025-03-03 14:22:07,257 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 14:22:07,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:07,262 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:07,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 14:22:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-03 14:22:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 276 states have (on average 1.576086956521739) internal successors, (435), 278 states have internal predecessors, (435), 51 states have call successors, (51), 23 states have call predecessors, (51), 23 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:22:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 536 transitions. [2025-03-03 14:22:07,318 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 536 transitions. Word has length 136 [2025-03-03 14:22:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:07,320 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 536 transitions. [2025-03-03 14:22:07,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 536 transitions. [2025-03-03 14:22:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:22:07,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:07,331 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:07,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:22:07,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:22:07,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 947588768, now seen corresponding path program 1 times [2025-03-03 14:22:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373287167] [2025-03-03 14:22:07,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:07,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:07,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:07,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:07,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:07,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:07,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373287167] [2025-03-03 14:22:07,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373287167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:07,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276983505] [2025-03-03 14:22:07,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:07,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:07,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:07,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:07,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:22:07,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:08,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:08,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:08,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:08,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:08,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:08,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:08,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276983505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:08,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:08,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:08,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627354081] [2025-03-03 14:22:08,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:08,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:08,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:08,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:08,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:08,063 INFO L87 Difference]: Start difference. First operand 351 states and 536 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:08,099 INFO L93 Difference]: Finished difference Result 518 states and 772 transitions. [2025-03-03 14:22:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:08,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2025-03-03 14:22:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:08,104 INFO L225 Difference]: With dead ends: 518 [2025-03-03 14:22:08,105 INFO L226 Difference]: Without dead ends: 353 [2025-03-03 14:22:08,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:08,109 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:08,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1068 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-03 14:22:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-03-03 14:22:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 278 states have (on average 1.5719424460431655) internal successors, (437), 280 states have internal predecessors, (437), 51 states have call successors, (51), 23 states have call predecessors, (51), 23 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:22:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 538 transitions. [2025-03-03 14:22:08,139 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 538 transitions. Word has length 137 [2025-03-03 14:22:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:08,141 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 538 transitions. [2025-03-03 14:22:08,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 538 transitions. [2025-03-03 14:22:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:22:08,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:08,144 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:08,153 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-03 14:22:08,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:22:08,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:08,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1003427985, now seen corresponding path program 1 times [2025-03-03 14:22:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:08,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680789180] [2025-03-03 14:22:08,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:08,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:22:08,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:22:08,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:08,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:22:08,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:08,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680789180] [2025-03-03 14:22:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680789180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:08,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908509776] [2025-03-03 14:22:08,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:08,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:08,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:08,556 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:08,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:22:08,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:22:08,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:22:08,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:08,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:08,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:08,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:08,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908509776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:08,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:08,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:08,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742924302] [2025-03-03 14:22:08,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:08,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:08,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:08,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:08,842 INFO L87 Difference]: Start difference. First operand 353 states and 538 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:08,881 INFO L93 Difference]: Finished difference Result 748 states and 1159 transitions. [2025-03-03 14:22:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:08,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 142 [2025-03-03 14:22:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:08,886 INFO L225 Difference]: With dead ends: 748 [2025-03-03 14:22:08,886 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 14:22:08,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:08,890 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 126 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:08,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1033 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 14:22:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414. [2025-03-03 14:22:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 325 states have (on average 1.5907692307692307) internal successors, (517), 327 states have internal predecessors, (517), 65 states have call successors, (65), 23 states have call predecessors, (65), 23 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 14:22:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 646 transitions. [2025-03-03 14:22:08,919 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 646 transitions. Word has length 142 [2025-03-03 14:22:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:08,919 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 646 transitions. [2025-03-03 14:22:08,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 646 transitions. [2025-03-03 14:22:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:22:08,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:08,925 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:08,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:09,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:09,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:09,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 505484091, now seen corresponding path program 1 times [2025-03-03 14:22:09,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:09,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271503329] [2025-03-03 14:22:09,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:09,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:22:09,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:22:09,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:09,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:22:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271503329] [2025-03-03 14:22:09,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271503329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929413894] [2025-03-03 14:22:09,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:09,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:09,315 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:09,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:22:09,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:22:09,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:22:09,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:09,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:09,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:09,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:22:09,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:09,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929413894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:09,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:09,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:09,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249531999] [2025-03-03 14:22:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:09,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:09,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:09,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:09,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:09,627 INFO L87 Difference]: Start difference. First operand 414 states and 646 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:09,699 INFO L93 Difference]: Finished difference Result 819 states and 1282 transitions. [2025-03-03 14:22:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:09,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2025-03-03 14:22:09,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:09,703 INFO L225 Difference]: With dead ends: 819 [2025-03-03 14:22:09,704 INFO L226 Difference]: Without dead ends: 416 [2025-03-03 14:22:09,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:09,706 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 2 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:09,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2101 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-03 14:22:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-03-03 14:22:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 326 states have (on average 1.5889570552147239) internal successors, (518), 329 states have internal predecessors, (518), 65 states have call successors, (65), 23 states have call predecessors, (65), 24 states have return successors, (66), 63 states have call predecessors, (66), 64 states have call successors, (66) [2025-03-03 14:22:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 649 transitions. [2025-03-03 14:22:09,744 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 649 transitions. Word has length 143 [2025-03-03 14:22:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:09,745 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 649 transitions. [2025-03-03 14:22:09,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 649 transitions. [2025-03-03 14:22:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:22:09,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:09,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:09,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:22:09,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:09,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:09,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2084400414, now seen corresponding path program 1 times [2025-03-03 14:22:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:09,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880052383] [2025-03-03 14:22:09,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:09,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:22:09,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:22:09,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:09,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880052383] [2025-03-03 14:22:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880052383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798145967] [2025-03-03 14:22:10,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:10,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:10,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:10,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:22:10,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:22:10,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:22:10,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:10,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:10,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:10,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:22:10,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:10,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798145967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:10,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:10,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:22:10,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769504223] [2025-03-03 14:22:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:10,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:10,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:10,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:10,369 INFO L87 Difference]: Start difference. First operand 416 states and 649 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:10,423 INFO L93 Difference]: Finished difference Result 821 states and 1287 transitions. [2025-03-03 14:22:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:10,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-03 14:22:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:10,427 INFO L225 Difference]: With dead ends: 821 [2025-03-03 14:22:10,428 INFO L226 Difference]: Without dead ends: 418 [2025-03-03 14:22:10,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:10,432 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:10,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2087 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-03 14:22:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-03 14:22:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 327 states have (on average 1.5871559633027523) internal successors, (519), 331 states have internal predecessors, (519), 65 states have call successors, (65), 23 states have call predecessors, (65), 25 states have return successors, (71), 63 states have call predecessors, (71), 64 states have call successors, (71) [2025-03-03 14:22:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 655 transitions. [2025-03-03 14:22:10,449 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 655 transitions. Word has length 125 [2025-03-03 14:22:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:10,449 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 655 transitions. [2025-03-03 14:22:10,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 655 transitions. [2025-03-03 14:22:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:22:10,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:10,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:10,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:10,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:10,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1888411777, now seen corresponding path program 1 times [2025-03-03 14:22:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:10,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935350252] [2025-03-03 14:22:10,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:10,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:22:10,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:22:10,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:10,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:10,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:10,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935350252] [2025-03-03 14:22:10,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935350252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:10,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:10,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107561766] [2025-03-03 14:22:10,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:10,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:10,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:10,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:10,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:10,760 INFO L87 Difference]: Start difference. First operand 418 states and 655 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:10,800 INFO L93 Difference]: Finished difference Result 813 states and 1278 transitions. [2025-03-03 14:22:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-03-03 14:22:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:10,803 INFO L225 Difference]: With dead ends: 813 [2025-03-03 14:22:10,803 INFO L226 Difference]: Without dead ends: 418 [2025-03-03 14:22:10,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:10,806 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 2 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:10,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2105 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-03 14:22:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-03 14:22:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 327 states have (on average 1.5871559633027523) internal successors, (519), 331 states have internal predecessors, (519), 65 states have call successors, (65), 23 states have call predecessors, (65), 25 states have return successors, (70), 63 states have call predecessors, (70), 64 states have call successors, (70) [2025-03-03 14:22:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 654 transitions. [2025-03-03 14:22:10,842 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 654 transitions. Word has length 126 [2025-03-03 14:22:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:10,842 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 654 transitions. [2025-03-03 14:22:10,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 654 transitions. [2025-03-03 14:22:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:22:10,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:10,845 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:10,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:10,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:10,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash 510906555, now seen corresponding path program 2 times [2025-03-03 14:22:10,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:10,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915465504] [2025-03-03 14:22:10,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:10,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 127 statements into 2 equivalence classes. [2025-03-03 14:22:10,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 127 statements. [2025-03-03 14:22:10,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:10,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:22:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:10,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915465504] [2025-03-03 14:22:10,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915465504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:10,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:10,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:10,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845465779] [2025-03-03 14:22:10,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:10,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:10,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:10,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:10,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:10,949 INFO L87 Difference]: Start difference. First operand 418 states and 654 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:10,975 INFO L93 Difference]: Finished difference Result 575 states and 880 transitions. [2025-03-03 14:22:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-03 14:22:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:10,978 INFO L225 Difference]: With dead ends: 575 [2025-03-03 14:22:10,978 INFO L226 Difference]: Without dead ends: 418 [2025-03-03 14:22:10,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:10,982 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:10,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2125 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-03 14:22:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-03 14:22:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 327 states have (on average 1.584097859327217) internal successors, (518), 331 states have internal predecessors, (518), 65 states have call successors, (65), 23 states have call predecessors, (65), 25 states have return successors, (70), 63 states have call predecessors, (70), 64 states have call successors, (70) [2025-03-03 14:22:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 653 transitions. [2025-03-03 14:22:11,005 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 653 transitions. Word has length 127 [2025-03-03 14:22:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:11,005 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 653 transitions. [2025-03-03 14:22:11,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 653 transitions. [2025-03-03 14:22:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:22:11,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:11,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:11,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:22:11,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:11,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1210236323, now seen corresponding path program 1 times [2025-03-03 14:22:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803941190] [2025-03-03 14:22:11,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:11,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:22:11,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:22:11,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:11,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:11,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803941190] [2025-03-03 14:22:11,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803941190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:11,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:11,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:11,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982302518] [2025-03-03 14:22:11,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:11,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:11,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:11,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:11,125 INFO L87 Difference]: Start difference. First operand 418 states and 653 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:22:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:11,166 INFO L93 Difference]: Finished difference Result 815 states and 1279 transitions. [2025-03-03 14:22:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:11,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 134 [2025-03-03 14:22:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:11,169 INFO L225 Difference]: With dead ends: 815 [2025-03-03 14:22:11,169 INFO L226 Difference]: Without dead ends: 420 [2025-03-03 14:22:11,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:11,170 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 1 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:11,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2104 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-03 14:22:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-03 14:22:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 328 states have (on average 1.5823170731707317) internal successors, (519), 333 states have internal predecessors, (519), 65 states have call successors, (65), 23 states have call predecessors, (65), 26 states have return successors, (72), 63 states have call predecessors, (72), 64 states have call successors, (72) [2025-03-03 14:22:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 656 transitions. [2025-03-03 14:22:11,183 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 656 transitions. Word has length 134 [2025-03-03 14:22:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:11,184 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 656 transitions. [2025-03-03 14:22:11,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:22:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 656 transitions. [2025-03-03 14:22:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:22:11,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:11,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:11,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:22:11,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:11,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1060735712, now seen corresponding path program 1 times [2025-03-03 14:22:11,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:11,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142558377] [2025-03-03 14:22:11,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:11,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:22:11,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:22:11,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:11,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142558377] [2025-03-03 14:22:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142558377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748828613] [2025-03-03 14:22:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:11,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:11,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:11,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:11,309 INFO L87 Difference]: Start difference. First operand 420 states and 656 transitions. Second operand has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:22:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:11,434 INFO L93 Difference]: Finished difference Result 817 states and 1278 transitions. [2025-03-03 14:22:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:11,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 135 [2025-03-03 14:22:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:11,437 INFO L225 Difference]: With dead ends: 817 [2025-03-03 14:22:11,437 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 14:22:11,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:11,439 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 7 mSDsluCounter, 3085 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3604 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:11,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3604 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 14:22:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2025-03-03 14:22:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 330 states have (on average 1.5787878787878789) internal successors, (521), 334 states have internal predecessors, (521), 65 states have call successors, (65), 24 states have call predecessors, (65), 26 states have return successors, (71), 63 states have call predecessors, (71), 64 states have call successors, (71) [2025-03-03 14:22:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 657 transitions. [2025-03-03 14:22:11,450 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 657 transitions. Word has length 135 [2025-03-03 14:22:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:11,451 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 657 transitions. [2025-03-03 14:22:11,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:22:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 657 transitions. [2025-03-03 14:22:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 14:22:11,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:11,453 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:11,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:22:11,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:11,454 INFO L85 PathProgramCache]: Analyzing trace with hash 357518418, now seen corresponding path program 1 times [2025-03-03 14:22:11,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:11,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811041899] [2025-03-03 14:22:11,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:11,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:11,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 14:22:11,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:22:11,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:11,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:22:11,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:11,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811041899] [2025-03-03 14:22:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811041899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:11,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:11,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721036862] [2025-03-03 14:22:11,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:11,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:11,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:11,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:11,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:11,580 INFO L87 Difference]: Start difference. First operand 422 states and 657 transitions. Second operand has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:22:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:11,691 INFO L93 Difference]: Finished difference Result 820 states and 1285 transitions. [2025-03-03 14:22:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:11,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-03-03 14:22:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:11,694 INFO L225 Difference]: With dead ends: 820 [2025-03-03 14:22:11,694 INFO L226 Difference]: Without dead ends: 425 [2025-03-03 14:22:11,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:11,696 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 5 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3618 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:11,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3618 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-03 14:22:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-03-03 14:22:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 332 states have (on average 1.5753012048192772) internal successors, (523), 337 states have internal predecessors, (523), 65 states have call successors, (65), 24 states have call predecessors, (65), 27 states have return successors, (76), 63 states have call predecessors, (76), 64 states have call successors, (76) [2025-03-03 14:22:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 664 transitions. [2025-03-03 14:22:11,709 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 664 transitions. Word has length 155 [2025-03-03 14:22:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:11,710 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 664 transitions. [2025-03-03 14:22:11,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:22:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 664 transitions. [2025-03-03 14:22:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:22:11,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:11,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:11,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:22:11,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:11,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash -244883133, now seen corresponding path program 1 times [2025-03-03 14:22:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574234694] [2025-03-03 14:22:11,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:11,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:11,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:11,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:11,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:11,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:11,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574234694] [2025-03-03 14:22:11,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574234694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:11,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49035612] [2025-03-03 14:22:11,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:11,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:11,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:11,799 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:11,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:22:11,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:12,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:12,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:12,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:12,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:12,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:12,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49035612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:12,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:12,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:22:12,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102083125] [2025-03-03 14:22:12,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:12,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:22:12,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:12,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:22:12,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:12,134 INFO L87 Difference]: Start difference. First operand 425 states and 664 transitions. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:22:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:12,285 INFO L93 Difference]: Finished difference Result 1002 states and 1625 transitions. [2025-03-03 14:22:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:22:12,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 137 [2025-03-03 14:22:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:12,291 INFO L225 Difference]: With dead ends: 1002 [2025-03-03 14:22:12,291 INFO L226 Difference]: Without dead ends: 837 [2025-03-03 14:22:12,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:12,293 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 444 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:12,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 2074 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-03-03 14:22:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 813. [2025-03-03 14:22:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 641 states have (on average 1.639625585023401) internal successors, (1051), 646 states have internal predecessors, (1051), 144 states have call successors, (144), 24 states have call predecessors, (144), 27 states have return successors, (165), 142 states have call predecessors, (165), 143 states have call successors, (165) [2025-03-03 14:22:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1360 transitions. [2025-03-03 14:22:12,328 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1360 transitions. Word has length 137 [2025-03-03 14:22:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:12,328 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1360 transitions. [2025-03-03 14:22:12,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:22:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1360 transitions. [2025-03-03 14:22:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:22:12,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:12,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:12,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:12,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:12,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:12,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1312464733, now seen corresponding path program 1 times [2025-03-03 14:22:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:12,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278072131] [2025-03-03 14:22:12,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:12,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:22:12,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:22:12,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:12,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278072131] [2025-03-03 14:22:12,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278072131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:12,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46585724] [2025-03-03 14:22:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:12,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:12,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:12,610 INFO L87 Difference]: Start difference. First operand 813 states and 1360 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:12,655 INFO L93 Difference]: Finished difference Result 1950 states and 3311 transitions. [2025-03-03 14:22:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-03-03 14:22:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:12,666 INFO L225 Difference]: With dead ends: 1950 [2025-03-03 14:22:12,666 INFO L226 Difference]: Without dead ends: 1206 [2025-03-03 14:22:12,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:12,674 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 124 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:12,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1084 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2025-03-03 14:22:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1198. [2025-03-03 14:22:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 947 states have (on average 1.6536430834213305) internal successors, (1566), 952 states have internal predecessors, (1566), 223 states have call successors, (223), 24 states have call predecessors, (223), 27 states have return successors, (254), 221 states have call predecessors, (254), 222 states have call successors, (254) [2025-03-03 14:22:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 2043 transitions. [2025-03-03 14:22:12,724 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 2043 transitions. Word has length 143 [2025-03-03 14:22:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:12,725 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 2043 transitions. [2025-03-03 14:22:12,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 2043 transitions. [2025-03-03 14:22:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:22:12,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:12,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:12,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:22:12,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:12,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1068324265, now seen corresponding path program 1 times [2025-03-03 14:22:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372810902] [2025-03-03 14:22:12,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:12,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:22:12,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:22:12,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:12,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:12,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:12,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372810902] [2025-03-03 14:22:12,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372810902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:12,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:12,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554831116] [2025-03-03 14:22:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:12,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:12,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:12,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:12,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:12,789 INFO L87 Difference]: Start difference. First operand 1198 states and 2043 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:12,837 INFO L93 Difference]: Finished difference Result 2888 states and 4958 transitions. [2025-03-03 14:22:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:12,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2025-03-03 14:22:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:12,849 INFO L225 Difference]: With dead ends: 2888 [2025-03-03 14:22:12,849 INFO L226 Difference]: Without dead ends: 1810 [2025-03-03 14:22:12,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:12,854 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 122 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:12,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1064 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-03-03 14:22:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1802. [2025-03-03 14:22:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1432 states have (on average 1.6627094972067038) internal successors, (2381), 1437 states have internal predecessors, (2381), 342 states have call successors, (342), 24 states have call predecessors, (342), 27 states have return successors, (373), 340 states have call predecessors, (373), 341 states have call successors, (373) [2025-03-03 14:22:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 3096 transitions. [2025-03-03 14:22:12,919 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 3096 transitions. Word has length 163 [2025-03-03 14:22:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:12,919 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 3096 transitions. [2025-03-03 14:22:12,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 3096 transitions. [2025-03-03 14:22:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:22:12,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:12,929 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:12,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:22:12,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:12,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash 525995714, now seen corresponding path program 1 times [2025-03-03 14:22:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552365406] [2025-03-03 14:22:12,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:12,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:22:12,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:22:12,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:12,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:12,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:12,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552365406] [2025-03-03 14:22:12,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552365406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:12,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:12,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:12,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688267062] [2025-03-03 14:22:12,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:12,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:12,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:12,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:12,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:12,981 INFO L87 Difference]: Start difference. First operand 1802 states and 3096 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:13,060 INFO L93 Difference]: Finished difference Result 4295 states and 7440 transitions. [2025-03-03 14:22:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-03-03 14:22:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:13,074 INFO L225 Difference]: With dead ends: 4295 [2025-03-03 14:22:13,074 INFO L226 Difference]: Without dead ends: 2735 [2025-03-03 14:22:13,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:13,080 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 120 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:13,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1059 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2025-03-03 14:22:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2727. [2025-03-03 14:22:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2195 states have (on average 1.6701594533029613) internal successors, (3666), 2200 states have internal predecessors, (3666), 504 states have call successors, (504), 24 states have call predecessors, (504), 27 states have return successors, (551), 502 states have call predecessors, (551), 503 states have call successors, (551) [2025-03-03 14:22:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 4721 transitions. [2025-03-03 14:22:13,178 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 4721 transitions. Word has length 145 [2025-03-03 14:22:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:13,178 INFO L471 AbstractCegarLoop]: Abstraction has 2727 states and 4721 transitions. [2025-03-03 14:22:13,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 4721 transitions. [2025-03-03 14:22:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 14:22:13,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:13,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:13,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:13,191 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:13,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:13,192 INFO L85 PathProgramCache]: Analyzing trace with hash -351140554, now seen corresponding path program 1 times [2025-03-03 14:22:13,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:13,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976052462] [2025-03-03 14:22:13,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:13,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:13,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 14:22:13,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 14:22:13,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:13,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:13,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:13,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976052462] [2025-03-03 14:22:13,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976052462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:13,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:13,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357229671] [2025-03-03 14:22:13,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:13,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:13,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:13,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:13,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:13,240 INFO L87 Difference]: Start difference. First operand 2727 states and 4721 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:13,323 INFO L93 Difference]: Finished difference Result 6513 states and 11361 transitions. [2025-03-03 14:22:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:13,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 165 [2025-03-03 14:22:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:13,345 INFO L225 Difference]: With dead ends: 6513 [2025-03-03 14:22:13,345 INFO L226 Difference]: Without dead ends: 4228 [2025-03-03 14:22:13,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:13,355 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 118 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:13,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1059 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4228 states. [2025-03-03 14:22:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4228 to 4220. [2025-03-03 14:22:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 3443 states have (on average 1.675573627650305) internal successors, (5769), 3448 states have internal predecessors, (5769), 749 states have call successors, (749), 24 states have call predecessors, (749), 27 states have return successors, (822), 747 states have call predecessors, (822), 748 states have call successors, (822) [2025-03-03 14:22:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 7340 transitions. [2025-03-03 14:22:13,543 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 7340 transitions. Word has length 165 [2025-03-03 14:22:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:13,543 INFO L471 AbstractCegarLoop]: Abstraction has 4220 states and 7340 transitions. [2025-03-03 14:22:13,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 7340 transitions. [2025-03-03 14:22:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:22:13,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:13,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:13,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:13,561 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:13,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1159594495, now seen corresponding path program 1 times [2025-03-03 14:22:13,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:13,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817191866] [2025-03-03 14:22:13,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:13,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:13,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:22:13,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:22:13,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:13,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817191866] [2025-03-03 14:22:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817191866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:13,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:13,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048501406] [2025-03-03 14:22:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:13,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:13,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:13,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:13,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:13,607 INFO L87 Difference]: Start difference. First operand 4220 states and 7340 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:13,732 INFO L93 Difference]: Finished difference Result 10473 states and 18317 transitions. [2025-03-03 14:22:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:13,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-03-03 14:22:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:13,769 INFO L225 Difference]: With dead ends: 10473 [2025-03-03 14:22:13,769 INFO L226 Difference]: Without dead ends: 6922 [2025-03-03 14:22:13,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:13,825 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 116 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:13,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1078 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2025-03-03 14:22:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6914. [2025-03-03 14:22:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6914 states, 5644 states have (on average 1.6716867469879517) internal successors, (9435), 5649 states have internal predecessors, (9435), 1242 states have call successors, (1242), 24 states have call predecessors, (1242), 27 states have return successors, (1359), 1240 states have call predecessors, (1359), 1241 states have call successors, (1359) [2025-03-03 14:22:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6914 states to 6914 states and 12036 transitions. [2025-03-03 14:22:14,080 INFO L78 Accepts]: Start accepts. Automaton has 6914 states and 12036 transitions. Word has length 147 [2025-03-03 14:22:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:14,081 INFO L471 AbstractCegarLoop]: Abstraction has 6914 states and 12036 transitions. [2025-03-03 14:22:14,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6914 states and 12036 transitions. [2025-03-03 14:22:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:22:14,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:14,109 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:14,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:22:14,110 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:14,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1934035386, now seen corresponding path program 1 times [2025-03-03 14:22:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:14,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241610767] [2025-03-03 14:22:14,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:14,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:22:14,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:22:14,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:14,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:14,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:14,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241610767] [2025-03-03 14:22:14,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241610767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:14,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:14,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:14,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108652001] [2025-03-03 14:22:14,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:14,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:14,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:14,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:14,163 INFO L87 Difference]: Start difference. First operand 6914 states and 12036 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:14,488 INFO L93 Difference]: Finished difference Result 17508 states and 30673 transitions. [2025-03-03 14:22:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:14,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 148 [2025-03-03 14:22:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:14,551 INFO L225 Difference]: With dead ends: 17508 [2025-03-03 14:22:14,552 INFO L226 Difference]: Without dead ends: 11634 [2025-03-03 14:22:14,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:14,583 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 114 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:14,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1064 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2025-03-03 14:22:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 11626. [2025-03-03 14:22:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11626 states, 9534 states have (on average 1.672015942941053) internal successors, (15941), 9539 states have internal predecessors, (15941), 2064 states have call successors, (2064), 24 states have call predecessors, (2064), 27 states have return successors, (2259), 2062 states have call predecessors, (2259), 2063 states have call successors, (2259) [2025-03-03 14:22:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11626 states to 11626 states and 20264 transitions. [2025-03-03 14:22:15,064 INFO L78 Accepts]: Start accepts. Automaton has 11626 states and 20264 transitions. Word has length 148 [2025-03-03 14:22:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:15,064 INFO L471 AbstractCegarLoop]: Abstraction has 11626 states and 20264 transitions. [2025-03-03 14:22:15,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11626 states and 20264 transitions. [2025-03-03 14:22:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:22:15,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:15,110 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:22:15,111 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -95139845, now seen corresponding path program 1 times [2025-03-03 14:22:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482397752] [2025-03-03 14:22:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:15,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:22:15,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:22:15,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:15,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:15,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:15,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482397752] [2025-03-03 14:22:15,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482397752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:15,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:15,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349870790] [2025-03-03 14:22:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:15,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:15,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:15,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:15,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:15,177 INFO L87 Difference]: Start difference. First operand 11626 states and 20264 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:15,553 INFO L93 Difference]: Finished difference Result 27739 states and 48315 transitions. [2025-03-03 14:22:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:15,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2025-03-03 14:22:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:15,635 INFO L225 Difference]: With dead ends: 27739 [2025-03-03 14:22:15,635 INFO L226 Difference]: Without dead ends: 18090 [2025-03-03 14:22:15,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:15,673 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 112 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:15,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1034 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18090 states. [2025-03-03 14:22:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18090 to 18082. [2025-03-03 14:22:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18082 states, 14787 states have (on average 1.6480692500169067) internal successors, (24370), 14792 states have internal predecessors, (24370), 3267 states have call successors, (3267), 24 states have call predecessors, (3267), 27 states have return successors, (3606), 3265 states have call predecessors, (3606), 3266 states have call successors, (3606) [2025-03-03 14:22:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18082 states to 18082 states and 31243 transitions. [2025-03-03 14:22:16,335 INFO L78 Accepts]: Start accepts. Automaton has 18082 states and 31243 transitions. Word has length 168 [2025-03-03 14:22:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:16,335 INFO L471 AbstractCegarLoop]: Abstraction has 18082 states and 31243 transitions. [2025-03-03 14:22:16,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 18082 states and 31243 transitions. [2025-03-03 14:22:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:22:16,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:16,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:16,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:22:16,379 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:16,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1284132940, now seen corresponding path program 1 times [2025-03-03 14:22:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:16,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834167752] [2025-03-03 14:22:16,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:16,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:22:16,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:22:16,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:16,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:16,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834167752] [2025-03-03 14:22:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834167752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:16,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:16,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513705644] [2025-03-03 14:22:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:16,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:16,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:16,437 INFO L87 Difference]: Start difference. First operand 18082 states and 31243 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:17,307 INFO L93 Difference]: Finished difference Result 47766 states and 82884 transitions. [2025-03-03 14:22:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 169 [2025-03-03 14:22:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:17,479 INFO L225 Difference]: With dead ends: 47766 [2025-03-03 14:22:17,480 INFO L226 Difference]: Without dead ends: 32260 [2025-03-03 14:22:17,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:17,549 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 110 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:17,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1062 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32260 states. [2025-03-03 14:22:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32260 to 32252. [2025-03-03 14:22:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32252 states, 26507 states have (on average 1.6452635152978459) internal successors, (43611), 26512 states have internal predecessors, (43611), 5717 states have call successors, (5717), 24 states have call predecessors, (5717), 27 states have return successors, (6330), 5715 states have call predecessors, (6330), 5716 states have call successors, (6330) [2025-03-03 14:22:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32252 states to 32252 states and 55658 transitions. [2025-03-03 14:22:18,864 INFO L78 Accepts]: Start accepts. Automaton has 32252 states and 55658 transitions. Word has length 169 [2025-03-03 14:22:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:18,865 INFO L471 AbstractCegarLoop]: Abstraction has 32252 states and 55658 transitions. [2025-03-03 14:22:18,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 32252 states and 55658 transitions. [2025-03-03 14:22:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 14:22:18,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:18,920 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:18,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:22:18,921 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:18,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1050473572, now seen corresponding path program 1 times [2025-03-03 14:22:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088670117] [2025-03-03 14:22:18,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:18,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:22:18,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:22:18,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:18,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:18,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:18,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088670117] [2025-03-03 14:22:18,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088670117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:18,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:18,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608235714] [2025-03-03 14:22:18,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:18,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:18,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:18,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:18,981 INFO L87 Difference]: Start difference. First operand 32252 states and 55658 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:19,914 INFO L93 Difference]: Finished difference Result 87883 states and 152206 transitions. [2025-03-03 14:22:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 170 [2025-03-03 14:22:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:20,186 INFO L225 Difference]: With dead ends: 87883 [2025-03-03 14:22:20,186 INFO L226 Difference]: Without dead ends: 59074 [2025-03-03 14:22:20,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:20,274 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 108 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:20,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1063 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59074 states. [2025-03-03 14:22:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59074 to 59066. [2025-03-03 14:22:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59066 states, 48808 states have (on average 1.6413497787247993) internal successors, (80111), 48813 states have internal predecessors, (80111), 10230 states have call successors, (10230), 24 states have call predecessors, (10230), 27 states have return successors, (11375), 10228 states have call predecessors, (11375), 10229 states have call successors, (11375) [2025-03-03 14:22:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59066 states to 59066 states and 101716 transitions. [2025-03-03 14:22:23,084 INFO L78 Accepts]: Start accepts. Automaton has 59066 states and 101716 transitions. Word has length 170 [2025-03-03 14:22:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:23,085 INFO L471 AbstractCegarLoop]: Abstraction has 59066 states and 101716 transitions. [2025-03-03 14:22:23,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 59066 states and 101716 transitions. [2025-03-03 14:22:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 14:22:23,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:23,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:23,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:22:23,149 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:23,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 337892840, now seen corresponding path program 1 times [2025-03-03 14:22:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172995273] [2025-03-03 14:22:23,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:23,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 14:22:23,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 14:22:23,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:23,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172995273] [2025-03-03 14:22:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172995273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:23,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:23,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896721607] [2025-03-03 14:22:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:23,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:23,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:23,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:23,199 INFO L87 Difference]: Start difference. First operand 59066 states and 101716 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:25,085 INFO L93 Difference]: Finished difference Result 110464 states and 190705 transitions. [2025-03-03 14:22:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:25,086 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2025-03-03 14:22:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:25,497 INFO L225 Difference]: With dead ends: 110464 [2025-03-03 14:22:25,498 INFO L226 Difference]: Without dead ends: 110299 [2025-03-03 14:22:25,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-03 14:22:25,546 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 103 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:25,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1076 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110299 states. [2025-03-03 14:22:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110299 to 110291. [2025-03-03 14:22:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110291 states, 91665 states have (on average 1.6362297496318114) internal successors, (149985), 91670 states have internal predecessors, (149985), 18598 states have call successors, (18598), 24 states have call predecessors, (18598), 27 states have return successors, (20789), 18596 states have call predecessors, (20789), 18597 states have call successors, (20789) [2025-03-03 14:22:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110291 states to 110291 states and 189372 transitions. [2025-03-03 14:22:29,334 INFO L78 Accepts]: Start accepts. Automaton has 110291 states and 189372 transitions. Word has length 152 [2025-03-03 14:22:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:29,335 INFO L471 AbstractCegarLoop]: Abstraction has 110291 states and 189372 transitions. [2025-03-03 14:22:29,335 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 110291 states and 189372 transitions. [2025-03-03 14:22:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 14:22:29,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:29,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:29,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:22:29,422 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1406267261, now seen corresponding path program 1 times [2025-03-03 14:22:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260197536] [2025-03-03 14:22:29,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 14:22:29,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 14:22:29,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260197536] [2025-03-03 14:22:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260197536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:29,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:22:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699092827] [2025-03-03 14:22:29,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:22:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:22:29,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:29,536 INFO L87 Difference]: Start difference. First operand 110291 states and 189372 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:33,394 INFO L93 Difference]: Finished difference Result 212256 states and 366010 transitions. [2025-03-03 14:22:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:22:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 172 [2025-03-03 14:22:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:34,228 INFO L225 Difference]: With dead ends: 212256 [2025-03-03 14:22:34,228 INFO L226 Difference]: Without dead ends: 212099 [2025-03-03 14:22:34,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:34,326 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 481 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:34,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2756 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212099 states. [2025-03-03 14:22:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212099 to 212091. [2025-03-03 14:22:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212091 states, 176342 states have (on average 1.6397284821539961) internal successors, (289153), 176293 states have internal predecessors, (289153), 35698 states have call successors, (35698), 46 states have call predecessors, (35698), 50 states have return successors, (38981), 35751 states have call predecessors, (38981), 35696 states have call successors, (38981) [2025-03-03 14:22:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212091 states to 212091 states and 363832 transitions. [2025-03-03 14:22:41,779 INFO L78 Accepts]: Start accepts. Automaton has 212091 states and 363832 transitions. Word has length 172 [2025-03-03 14:22:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:41,779 INFO L471 AbstractCegarLoop]: Abstraction has 212091 states and 363832 transitions. [2025-03-03 14:22:41,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 212091 states and 363832 transitions. [2025-03-03 14:22:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 14:22:42,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:42,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:42,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:22:42,188 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:42,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:42,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1997890158, now seen corresponding path program 1 times [2025-03-03 14:22:42,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:42,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997882114] [2025-03-03 14:22:42,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:42,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 14:22:42,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 14:22:42,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:42,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:42,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997882114] [2025-03-03 14:22:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997882114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:42,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:42,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:22:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242822237] [2025-03-03 14:22:42,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:42,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:22:42,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:42,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:22:42,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:42,414 INFO L87 Difference]: Start difference. First operand 212091 states and 363832 transitions. Second operand has 10 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19)