./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product17.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_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 922981a69371fe79bea26dd37077d7dd588a5af1cfad53b27080b4988960097d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:30:37,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:30:37,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:30:37,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:30:37,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:30:37,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:30:37,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:30:37,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:30:37,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:30:37,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:30:37,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:30:37,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:30:37,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:30:37,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:30:37,214 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:30:37,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:30:37,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:30:37,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:30:37,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:30:37,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:30:37,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:30:37,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:30:37,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:30:37,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:30:37,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:30:37,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:30:37,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:30:37,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:30:37,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:30:37,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:30:37,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:30:37,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:30:37,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:30:37,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:30:37,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:30:37,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:30:37,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:30:37,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:30:37,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:30:37,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:30:37,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:30:37,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:30:37,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 922981a69371fe79bea26dd37077d7dd588a5af1cfad53b27080b4988960097d [2024-10-12 19:30:37,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:30:37,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:30:37,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:30:37,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:30:37,522 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:30:37,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product17.cil.c [2024-10-12 19:30:38,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:30:39,135 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:30:39,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product17.cil.c [2024-10-12 19:30:39,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031a583c2/cd9a6f08cb8240d19da434d5c19c6e96/FLAG1cd1153b0 [2024-10-12 19:30:39,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031a583c2/cd9a6f08cb8240d19da434d5c19c6e96 [2024-10-12 19:30:39,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:30:39,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:30:39,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:30:39,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:30:39,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:30:39,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:39,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b9ccae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39, skipping insertion in model container [2024-10-12 19:30:39,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:39,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:30:39,638 WARN L248 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_spec4_product17.cil.c[45969,45982] [2024-10-12 19:30:39,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:30:39,727 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:30:39,736 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [48] [2024-10-12 19:30:39,737 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [90] [2024-10-12 19:30:39,737 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1169] [2024-10-12 19:30:39,737 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1467] [2024-10-12 19:30:39,738 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1774] [2024-10-12 19:30:39,738 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1809] [2024-10-12 19:30:39,738 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2212] [2024-10-12 19:30:39,738 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2229] [2024-10-12 19:30:39,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2238] [2024-10-12 19:30:39,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2335] [2024-10-12 19:30:39,740 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2551] [2024-10-12 19:30:39,800 WARN L248 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_spec4_product17.cil.c[45969,45982] [2024-10-12 19:30:39,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:30:39,854 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:30:39,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39 WrapperNode [2024-10-12 19:30:39,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:30:39,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:30:39,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:30:39,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:30:39,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:39,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:39,989 INFO L138 Inliner]: procedures = 127, calls = 192, calls flagged for inlining = 53, calls inlined = 46, statements flattened = 907 [2024-10-12 19:30:39,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:30:39,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:30:39,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:30:39,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:30:40,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,031 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]. [2024-10-12 19:30:40,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:30:40,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:30:40,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:30:40,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:30:40,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (1/1) ... [2024-10-12 19:30:40,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:30:40,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:30:40,120 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) [2024-10-12 19:30:40,130 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 [2024-10-12 19:30:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-12 19:30:40,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-12 19:30:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-12 19:30:40,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-12 19:30:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-12 19:30:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-12 19:30:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2024-10-12 19:30:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2024-10-12 19:30:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-12 19:30:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-12 19:30:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-12 19:30:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-12 19:30:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-12 19:30:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-12 19:30:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-12 19:30:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-12 19:30:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-12 19:30:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-12 19:30:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-12 19:30:40,202 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-12 19:30:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-12 19:30:40,202 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-12 19:30:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-12 19:30:40,202 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-12 19:30:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:30:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-12 19:30:40,206 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-12 19:30:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-12 19:30:40,206 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-12 19:30:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-12 19:30:40,207 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-12 19:30:40,207 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-12 19:30:40,207 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-12 19:30:40,207 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-12 19:30:40,207 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-12 19:30:40,207 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:30:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-12 19:30:40,208 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-12 19:30:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-12 19:30:40,208 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-12 19:30:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:30:40,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:30:40,364 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:30:40,365 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:30:40,963 INFO L? ?]: Removed 467 outVars from TransFormulas that were not future-live. [2024-10-12 19:30:40,964 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:30:41,037 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:30:41,040 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:30:41,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:30:41 BoogieIcfgContainer [2024-10-12 19:30:41,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:30:41,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:30:41,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:30:41,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:30:41,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:30:39" (1/3) ... [2024-10-12 19:30:41,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309741a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:30:41, skipping insertion in model container [2024-10-12 19:30:41,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:30:39" (2/3) ... [2024-10-12 19:30:41,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309741a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:30:41, skipping insertion in model container [2024-10-12 19:30:41,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:30:41" (3/3) ... [2024-10-12 19:30:41,047 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec4_product17.cil.c [2024-10-12 19:30:41,059 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:30:41,060 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:30:41,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:30:41,122 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;@1c1adbc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:30:41,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:30:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 329 states, 255 states have (on average 1.6352941176470588) internal successors, (417), 258 states have internal predecessors, (417), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-12 19:30:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 19:30:41,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:41,145 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-12 19:30:41,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:41,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:41,150 INFO L85 PathProgramCache]: Analyzing trace with hash 265308267, now seen corresponding path program 1 times [2024-10-12 19:30:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412769770] [2024-10-12 19:30:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:30:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:30:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:30:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:30:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:30:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:30:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:30:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:30:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:30:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:30:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:30:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412769770] [2024-10-12 19:30:41,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412769770] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:30:41,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326640654] [2024-10-12 19:30:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:41,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:30:41,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:30:41,840 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) [2024-10-12 19:30:41,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:30:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 19:30:42,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:30:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:30:42,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:30:42,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326640654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:42,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:30:42,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-12 19:30:42,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115393197] [2024-10-12 19:30:42,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:42,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:30:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:30:42,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:30:42,151 INFO L87 Difference]: Start difference. First operand has 329 states, 255 states have (on average 1.6352941176470588) internal successors, (417), 258 states have internal predecessors, (417), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:42,205 INFO L93 Difference]: Finished difference Result 478 states and 740 transitions. [2024-10-12 19:30:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:30:42,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2024-10-12 19:30:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:42,223 INFO L225 Difference]: With dead ends: 478 [2024-10-12 19:30:42,223 INFO L226 Difference]: Without dead ends: 326 [2024-10-12 19:30:42,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:30:42,229 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:42,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 501 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:30:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-12 19:30:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-10-12 19:30:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 253 states have (on average 1.6205533596837944) internal successors, (410), 255 states have internal predecessors, (410), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-12 19:30:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 509 transitions. [2024-10-12 19:30:42,292 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 509 transitions. Word has length 95 [2024-10-12 19:30:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:42,297 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 509 transitions. [2024-10-12 19:30:42,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 509 transitions. [2024-10-12 19:30:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 19:30:42,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:42,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-12 19:30:42,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:30:42,506 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 [2024-10-12 19:30:42,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:42,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash -183183737, now seen corresponding path program 1 times [2024-10-12 19:30:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:42,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53068036] [2024-10-12 19:30:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:30:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:30:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:30:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:30:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:30:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:30:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:30:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:30:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:30:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:30:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:30:42,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:42,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53068036] [2024-10-12 19:30:42,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53068036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:30:42,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229942462] [2024-10-12 19:30:42,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:42,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:30:42,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:30:42,729 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) [2024-10-12 19:30:42,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:30:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:42,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:30:42,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:30:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:30:42,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:30:42,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229942462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:42,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:30:42,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-12 19:30:42,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181514240] [2024-10-12 19:30:42,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:42,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:30:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:42,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:30:42,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:30:42,964 INFO L87 Difference]: Start difference. First operand 326 states and 509 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:43,032 INFO L93 Difference]: Finished difference Result 474 states and 724 transitions. [2024-10-12 19:30:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:30:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-10-12 19:30:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:43,035 INFO L225 Difference]: With dead ends: 474 [2024-10-12 19:30:43,035 INFO L226 Difference]: Without dead ends: 328 [2024-10-12 19:30:43,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:30:43,037 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:43,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 995 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:30:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-12 19:30:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-10-12 19:30:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 255 states have (on average 1.615686274509804) internal successors, (412), 257 states have internal predecessors, (412), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-12 19:30:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 511 transitions. [2024-10-12 19:30:43,058 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 511 transitions. Word has length 96 [2024-10-12 19:30:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:43,059 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 511 transitions. [2024-10-12 19:30:43,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 511 transitions. [2024-10-12 19:30:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 19:30:43,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:43,061 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-12 19:30:43,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:30:43,264 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 [2024-10-12 19:30:43,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:43,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1651387457, now seen corresponding path program 1 times [2024-10-12 19:30:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:43,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902774146] [2024-10-12 19:30:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:43,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:30:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:30:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:30:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:30:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:30:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:30:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:30:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:30:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:30:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:30:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:30:43,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902774146] [2024-10-12 19:30:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902774146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:30:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103266491] [2024-10-12 19:30:43,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:43,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:30:43,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:30:43,489 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) [2024-10-12 19:30:43,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:30:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:43,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:30:43,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:30:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:30:43,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:30:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103266491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:43,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:30:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-12 19:30:43,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406507073] [2024-10-12 19:30:43,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:43,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:30:43,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:43,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:30:43,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:30:43,717 INFO L87 Difference]: Start difference. First operand 328 states and 511 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:43,770 INFO L93 Difference]: Finished difference Result 700 states and 1107 transitions. [2024-10-12 19:30:43,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:30:43,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2024-10-12 19:30:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:43,774 INFO L225 Difference]: With dead ends: 700 [2024-10-12 19:30:43,774 INFO L226 Difference]: Without dead ends: 394 [2024-10-12 19:30:43,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:30:43,777 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 122 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:43,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 964 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:30:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-12 19:30:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 389. [2024-10-12 19:30:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 302 states have (on average 1.6291390728476822) internal successors, (492), 304 states have internal predecessors, (492), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-12 19:30:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 619 transitions. [2024-10-12 19:30:43,836 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 619 transitions. Word has length 101 [2024-10-12 19:30:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 619 transitions. [2024-10-12 19:30:43,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 619 transitions. [2024-10-12 19:30:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 19:30:43,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:43,841 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-12 19:30:43,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:30:44,045 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 [2024-10-12 19:30:44,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:44,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash -740303029, now seen corresponding path program 1 times [2024-10-12 19:30:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:44,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053329893] [2024-10-12 19:30:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:30:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:30:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:30:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:30:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:30:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:30:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:30:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:30:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:30:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:30:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:30:44,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053329893] [2024-10-12 19:30:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053329893] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:30:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961519146] [2024-10-12 19:30:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:44,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:30:44,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:30:44,201 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) [2024-10-12 19:30:44,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 19:30:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:30:44,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:30:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 19:30:44,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:30:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961519146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:30:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-12 19:30:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053141525] [2024-10-12 19:30:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:44,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:30:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:44,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:30:44,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:30:44,465 INFO L87 Difference]: Start difference. First operand 389 states and 619 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-12 19:30:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:44,538 INFO L93 Difference]: Finished difference Result 773 states and 1232 transitions. [2024-10-12 19:30:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:30:44,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 102 [2024-10-12 19:30:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:44,542 INFO L225 Difference]: With dead ends: 773 [2024-10-12 19:30:44,542 INFO L226 Difference]: Without dead ends: 391 [2024-10-12 19:30:44,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:30:44,545 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 2 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:44,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1949 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:30:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-12 19:30:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-10-12 19:30:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 303 states have (on average 1.627062706270627) internal successors, (493), 306 states have internal predecessors, (493), 64 states have call successors, (64), 22 states have call predecessors, (64), 23 states have return successors, (65), 62 states have call predecessors, (65), 63 states have call successors, (65) [2024-10-12 19:30:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 622 transitions. [2024-10-12 19:30:44,564 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 622 transitions. Word has length 102 [2024-10-12 19:30:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:44,564 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 622 transitions. [2024-10-12 19:30:44,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-12 19:30:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 622 transitions. [2024-10-12 19:30:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:30:44,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:44,570 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-10-12 19:30:44,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 19:30:44,770 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 [2024-10-12 19:30:44,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:44,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1409315105, now seen corresponding path program 1 times [2024-10-12 19:30:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:44,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003089000] [2024-10-12 19:30:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:44,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:30:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:30:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:30:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:30:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:30:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:30:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:30:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:30:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:30:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 19:30:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:44,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003089000] [2024-10-12 19:30:44,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003089000] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:30:44,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043502621] [2024-10-12 19:30:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:44,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:30:44,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:30:44,968 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) [2024-10-12 19:30:44,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 19:30:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:30:45,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:30:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 19:30:45,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:30:45,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043502621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:45,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:30:45,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-12 19:30:45,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5686959] [2024-10-12 19:30:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:45,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:30:45,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:30:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:30:45,212 INFO L87 Difference]: Start difference. First operand 391 states and 622 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-12 19:30:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:45,278 INFO L93 Difference]: Finished difference Result 775 states and 1237 transitions. [2024-10-12 19:30:45,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:30:45,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 103 [2024-10-12 19:30:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:45,280 INFO L225 Difference]: With dead ends: 775 [2024-10-12 19:30:45,281 INFO L226 Difference]: Without dead ends: 393 [2024-10-12 19:30:45,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:30:45,282 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 2 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:45,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1935 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:30:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-12 19:30:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-10-12 19:30:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 304 states have (on average 1.625) internal successors, (494), 308 states have internal predecessors, (494), 64 states have call successors, (64), 22 states have call predecessors, (64), 24 states have return successors, (70), 62 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-12 19:30:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 628 transitions. [2024-10-12 19:30:45,292 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 628 transitions. Word has length 103 [2024-10-12 19:30:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:45,292 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 628 transitions. [2024-10-12 19:30:45,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-12 19:30:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 628 transitions. [2024-10-12 19:30:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 19:30:45,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:45,294 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:30:45,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 19:30:45,494 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 [2024-10-12 19:30:45,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:45,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1094396458, now seen corresponding path program 1 times [2024-10-12 19:30:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98116055] [2024-10-12 19:30:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:30:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:30:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:30:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:30:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:30:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:30:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:30:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:30:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:30:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98116055] [2024-10-12 19:30:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98116055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:30:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997037544] [2024-10-12 19:30:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:45,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:30:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:30:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:30:45,632 INFO L87 Difference]: Start difference. First operand 393 states and 628 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-12 19:30:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:47,350 INFO L93 Difference]: Finished difference Result 851 states and 1383 transitions. [2024-10-12 19:30:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:30:47,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2024-10-12 19:30:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:47,353 INFO L225 Difference]: With dead ends: 851 [2024-10-12 19:30:47,354 INFO L226 Difference]: Without dead ends: 477 [2024-10-12 19:30:47,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:30:47,355 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1105 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 2504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:47,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 1150 Invalid, 2504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 19:30:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-12 19:30:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 393. [2024-10-12 19:30:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 304 states have (on average 1.625) internal successors, (494), 308 states have internal predecessors, (494), 64 states have call successors, (64), 22 states have call predecessors, (64), 24 states have return successors, (69), 62 states have call predecessors, (69), 63 states have call successors, (69) [2024-10-12 19:30:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 627 transitions. [2024-10-12 19:30:47,377 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 627 transitions. Word has length 104 [2024-10-12 19:30:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:47,378 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 627 transitions. [2024-10-12 19:30:47,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-12 19:30:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 627 transitions. [2024-10-12 19:30:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 19:30:47,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:47,379 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:30:47,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:30:47,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:47,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1558455328, now seen corresponding path program 2 times [2024-10-12 19:30:47,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:47,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377809153] [2024-10-12 19:30:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:30:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:30:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:30:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:30:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:30:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:30:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:30:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:30:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:30:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377809153] [2024-10-12 19:30:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377809153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:47,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:30:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564041940] [2024-10-12 19:30:47,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:47,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:30:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:30:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:30:47,514 INFO L87 Difference]: Start difference. First operand 393 states and 627 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-12 19:30:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:49,013 INFO L93 Difference]: Finished difference Result 853 states and 1386 transitions. [2024-10-12 19:30:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:30:49,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-12 19:30:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:49,019 INFO L225 Difference]: With dead ends: 853 [2024-10-12 19:30:49,019 INFO L226 Difference]: Without dead ends: 479 [2024-10-12 19:30:49,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:30:49,023 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1101 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:49,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1151 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:30:49,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-12 19:30:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 395. [2024-10-12 19:30:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 305 states have (on average 1.6229508196721312) internal successors, (495), 310 states have internal predecessors, (495), 64 states have call successors, (64), 22 states have call predecessors, (64), 25 states have return successors, (71), 62 states have call predecessors, (71), 63 states have call successors, (71) [2024-10-12 19:30:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 630 transitions. [2024-10-12 19:30:49,055 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 630 transitions. Word has length 105 [2024-10-12 19:30:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:49,055 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 630 transitions. [2024-10-12 19:30:49,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-12 19:30:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 630 transitions. [2024-10-12 19:30:49,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 19:30:49,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:49,057 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:30:49,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:30:49,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:49,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:49,058 INFO L85 PathProgramCache]: Analyzing trace with hash 25575045, now seen corresponding path program 1 times [2024-10-12 19:30:49,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:49,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163281231] [2024-10-12 19:30:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:49,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:30:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:30:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:30:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:30:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:30:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:30:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:30:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 19:30:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163281231] [2024-10-12 19:30:49,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163281231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:49,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:49,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 19:30:49,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615319576] [2024-10-12 19:30:49,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:49,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:30:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:49,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:30:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:30:49,247 INFO L87 Difference]: Start difference. First operand 395 states and 630 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:30:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:51,184 INFO L93 Difference]: Finished difference Result 851 states and 1381 transitions. [2024-10-12 19:30:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:30:51,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 106 [2024-10-12 19:30:51,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:51,188 INFO L225 Difference]: With dead ends: 851 [2024-10-12 19:30:51,188 INFO L226 Difference]: Without dead ends: 479 [2024-10-12 19:30:51,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:30:51,192 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1107 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 3976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:51,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 1597 Invalid, 3976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 19:30:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-12 19:30:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 395. [2024-10-12 19:30:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 305 states have (on average 1.6229508196721312) internal successors, (495), 310 states have internal predecessors, (495), 64 states have call successors, (64), 22 states have call predecessors, (64), 25 states have return successors, (70), 62 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-12 19:30:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 629 transitions. [2024-10-12 19:30:51,216 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 629 transitions. Word has length 106 [2024-10-12 19:30:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:51,216 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 629 transitions. [2024-10-12 19:30:51,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:30:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 629 transitions. [2024-10-12 19:30:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 19:30:51,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:51,218 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:30:51,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:30:51,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1148657288, now seen corresponding path program 2 times [2024-10-12 19:30:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:51,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12114769] [2024-10-12 19:30:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:51,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:30:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:30:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:30:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:30:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:30:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:30:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:30:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 19:30:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12114769] [2024-10-12 19:30:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12114769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 19:30:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727387790] [2024-10-12 19:30:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:51,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:30:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:51,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:30:51,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:30:51,430 INFO L87 Difference]: Start difference. First operand 395 states and 629 transitions. Second operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:30:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:53,329 INFO L93 Difference]: Finished difference Result 853 states and 1387 transitions. [2024-10-12 19:30:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:30:53,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 107 [2024-10-12 19:30:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:53,332 INFO L225 Difference]: With dead ends: 853 [2024-10-12 19:30:53,332 INFO L226 Difference]: Without dead ends: 481 [2024-10-12 19:30:53,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:30:53,334 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1103 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 3681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:53,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 1599 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 3681 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 19:30:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-12 19:30:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 397. [2024-10-12 19:30:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 306 states have (on average 1.6209150326797386) internal successors, (496), 312 states have internal predecessors, (496), 64 states have call successors, (64), 22 states have call predecessors, (64), 26 states have return successors, (75), 62 states have call predecessors, (75), 63 states have call successors, (75) [2024-10-12 19:30:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 635 transitions. [2024-10-12 19:30:53,365 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 635 transitions. Word has length 107 [2024-10-12 19:30:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:53,365 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 635 transitions. [2024-10-12 19:30:53,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:30:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 635 transitions. [2024-10-12 19:30:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 19:30:53,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:53,367 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:30:53,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:30:53,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:53,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1841835200, now seen corresponding path program 1 times [2024-10-12 19:30:53,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:53,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101650015] [2024-10-12 19:30:53,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:53,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:30:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:30:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:30:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:30:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:30:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:30:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:30:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:30:53,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101650015] [2024-10-12 19:30:53,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101650015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:30:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532016783] [2024-10-12 19:30:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:53,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:30:53,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:30:53,547 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) [2024-10-12 19:30:53,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 19:30:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:53,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:30:53,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:30:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:30:53,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:30:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:30:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532016783] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:30:53,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:30:53,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-12 19:30:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043990571] [2024-10-12 19:30:53,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:30:53,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:30:53,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:53,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:30:53,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:30:53,870 INFO L87 Difference]: Start difference. First operand 397 states and 635 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-12 19:30:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:55,224 INFO L93 Difference]: Finished difference Result 1027 states and 1743 transitions. [2024-10-12 19:30:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:30:55,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 108 [2024-10-12 19:30:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:55,228 INFO L225 Difference]: With dead ends: 1027 [2024-10-12 19:30:55,228 INFO L226 Difference]: Without dead ends: 881 [2024-10-12 19:30:55,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:30:55,229 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1571 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1907 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 1907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:55,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 1536 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 1907 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:30:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-10-12 19:30:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 782. [2024-10-12 19:30:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 612 states have (on average 1.6683006535947713) internal successors, (1021), 618 states have internal predecessors, (1021), 143 states have call successors, (143), 22 states have call predecessors, (143), 26 states have return successors, (164), 141 states have call predecessors, (164), 142 states have call successors, (164) [2024-10-12 19:30:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1328 transitions. [2024-10-12 19:30:55,255 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1328 transitions. Word has length 108 [2024-10-12 19:30:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:55,255 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1328 transitions. [2024-10-12 19:30:55,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-12 19:30:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1328 transitions. [2024-10-12 19:30:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 19:30:55,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:55,258 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:30:55,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 19:30:55,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:30:55,461 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:55,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -647573469, now seen corresponding path program 1 times [2024-10-12 19:30:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:55,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326108373] [2024-10-12 19:30:55,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:30:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:30:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:30:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:30:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:30:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:30:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:30:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:30:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326108373] [2024-10-12 19:30:55,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326108373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:55,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:55,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516115591] [2024-10-12 19:30:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:55,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:55,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:55,540 INFO L87 Difference]: Start difference. First operand 782 states and 1328 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:56,601 INFO L93 Difference]: Finished difference Result 1975 states and 3438 transitions. [2024-10-12 19:30:56,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:56,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-10-12 19:30:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:56,607 INFO L225 Difference]: With dead ends: 1975 [2024-10-12 19:30:56,607 INFO L226 Difference]: Without dead ends: 1253 [2024-10-12 19:30:56,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:56,610 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1221 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:56,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 858 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:30:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-10-12 19:30:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1164. [2024-10-12 19:30:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 915 states have (on average 1.6754098360655738) internal successors, (1533), 921 states have internal predecessors, (1533), 222 states have call successors, (222), 22 states have call predecessors, (222), 26 states have return successors, (253), 220 states have call predecessors, (253), 221 states have call successors, (253) [2024-10-12 19:30:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 2008 transitions. [2024-10-12 19:30:56,647 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 2008 transitions. Word has length 114 [2024-10-12 19:30:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:56,647 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 2008 transitions. [2024-10-12 19:30:56,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 2008 transitions. [2024-10-12 19:30:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 19:30:56,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:56,651 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:30:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:30:56,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash 589213548, now seen corresponding path program 1 times [2024-10-12 19:30:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276081674] [2024-10-12 19:30:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:30:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:30:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:30:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:30:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:30:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:30:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:30:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:30:56,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276081674] [2024-10-12 19:30:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276081674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:56,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911694385] [2024-10-12 19:30:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:56,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:56,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:56,763 INFO L87 Difference]: Start difference. First operand 1164 states and 2008 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:57,853 INFO L93 Difference]: Finished difference Result 2906 states and 5094 transitions. [2024-10-12 19:30:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:57,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-12 19:30:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:57,864 INFO L225 Difference]: With dead ends: 2906 [2024-10-12 19:30:57,864 INFO L226 Difference]: Without dead ends: 1852 [2024-10-12 19:30:57,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:57,869 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1218 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:57,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 852 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:30:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2024-10-12 19:30:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1763. [2024-10-12 19:30:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1395 states have (on average 1.6795698924731184) internal successors, (2343), 1401 states have internal predecessors, (2343), 341 states have call successors, (341), 22 states have call predecessors, (341), 26 states have return successors, (372), 339 states have call predecessors, (372), 340 states have call successors, (372) [2024-10-12 19:30:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 3056 transitions. [2024-10-12 19:30:57,929 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 3056 transitions. Word has length 115 [2024-10-12 19:30:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:57,930 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 3056 transitions. [2024-10-12 19:30:57,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 3056 transitions. [2024-10-12 19:30:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 19:30:57,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:57,938 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:30:57,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:30:57,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:57,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash -327358431, now seen corresponding path program 1 times [2024-10-12 19:30:57,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:57,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167347271] [2024-10-12 19:30:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:57,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:57,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:57,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:30:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:30:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:30:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:30:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:30:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:30:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:30:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:30:58,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:58,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167347271] [2024-10-12 19:30:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167347271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:58,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:58,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:58,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178023559] [2024-10-12 19:30:58,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:58,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:58,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:58,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:58,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:58,034 INFO L87 Difference]: Start difference. First operand 1763 states and 3056 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:59,064 INFO L93 Difference]: Finished difference Result 4302 states and 7599 transitions. [2024-10-12 19:30:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:59,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-12 19:30:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:59,078 INFO L225 Difference]: With dead ends: 4302 [2024-10-12 19:30:59,078 INFO L226 Difference]: Without dead ends: 2769 [2024-10-12 19:30:59,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:59,084 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1216 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:59,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 843 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:30:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2024-10-12 19:30:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2680. [2024-10-12 19:30:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2150 states have (on average 1.6837209302325582) internal successors, (3620), 2156 states have internal predecessors, (3620), 503 states have call successors, (503), 22 states have call predecessors, (503), 26 states have return successors, (550), 501 states have call predecessors, (550), 502 states have call successors, (550) [2024-10-12 19:30:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 4673 transitions. [2024-10-12 19:30:59,172 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 4673 transitions. Word has length 116 [2024-10-12 19:30:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:59,172 INFO L471 AbstractCegarLoop]: Abstraction has 2680 states and 4673 transitions. [2024-10-12 19:30:59,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:30:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 4673 transitions. [2024-10-12 19:30:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 19:30:59,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:59,186 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:30:59,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:30:59,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:59,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2079728693, now seen corresponding path program 1 times [2024-10-12 19:30:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:59,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213460685] [2024-10-12 19:30:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:59,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:30:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:30:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:30:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:30:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:30:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:30:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:30:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:30:59,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213460685] [2024-10-12 19:30:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213460685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:59,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:59,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:59,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291190293] [2024-10-12 19:30:59,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:59,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:59,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:59,313 INFO L87 Difference]: Start difference. First operand 2680 states and 4673 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:00,778 INFO L93 Difference]: Finished difference Result 6502 states and 11559 transitions. [2024-10-12 19:31:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:31:00,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-12 19:31:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:00,799 INFO L225 Difference]: With dead ends: 6502 [2024-10-12 19:31:00,799 INFO L226 Difference]: Without dead ends: 4249 [2024-10-12 19:31:00,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:31:00,808 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1216 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:00,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 842 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:31:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4249 states. [2024-10-12 19:31:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4249 to 4160. [2024-10-12 19:31:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4160 states, 3385 states have (on average 1.68685376661743) internal successors, (5710), 3391 states have internal predecessors, (5710), 748 states have call successors, (748), 22 states have call predecessors, (748), 26 states have return successors, (821), 746 states have call predecessors, (821), 747 states have call successors, (821) [2024-10-12 19:31:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 7279 transitions. [2024-10-12 19:31:00,932 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 7279 transitions. Word has length 117 [2024-10-12 19:31:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:00,933 INFO L471 AbstractCegarLoop]: Abstraction has 4160 states and 7279 transitions. [2024-10-12 19:31:00,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 7279 transitions. [2024-10-12 19:31:00,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 19:31:00,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:00,944 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:31:00,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:31:00,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:00,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1198752827, now seen corresponding path program 1 times [2024-10-12 19:31:00,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:00,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389708389] [2024-10-12 19:31:00,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:00,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:00,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:31:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:31:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:31:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:31:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:31:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:31:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 19:31:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:01,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:01,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389708389] [2024-10-12 19:31:01,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389708389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:01,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:01,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:31:01,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749744943] [2024-10-12 19:31:01,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:01,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:31:01,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:31:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:31:01,088 INFO L87 Difference]: Start difference. First operand 4160 states and 7279 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:02,235 INFO L93 Difference]: Finished difference Result 10431 states and 18584 transitions. [2024-10-12 19:31:02,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:31:02,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-12 19:31:02,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:02,267 INFO L225 Difference]: With dead ends: 10431 [2024-10-12 19:31:02,268 INFO L226 Difference]: Without dead ends: 6921 [2024-10-12 19:31:02,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:31:02,281 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1211 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:02,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 891 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:31:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6921 states. [2024-10-12 19:31:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6921 to 6832. [2024-10-12 19:31:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6832 states, 5564 states have (on average 1.6811646297627607) internal successors, (9354), 5570 states have internal predecessors, (9354), 1241 states have call successors, (1241), 22 states have call predecessors, (1241), 26 states have return successors, (1358), 1239 states have call predecessors, (1358), 1240 states have call successors, (1358) [2024-10-12 19:31:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 11953 transitions. [2024-10-12 19:31:02,630 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 11953 transitions. Word has length 118 [2024-10-12 19:31:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:02,630 INFO L471 AbstractCegarLoop]: Abstraction has 6832 states and 11953 transitions. [2024-10-12 19:31:02,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 11953 transitions. [2024-10-12 19:31:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 19:31:02,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:02,645 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:31:02,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:31:02,645 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash -371367897, now seen corresponding path program 1 times [2024-10-12 19:31:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:02,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970451866] [2024-10-12 19:31:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:02,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:31:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:31:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:31:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:31:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:31:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 19:31:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:31:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970451866] [2024-10-12 19:31:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970451866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:02,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:02,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:31:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667200540] [2024-10-12 19:31:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:02,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:31:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:31:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:31:02,736 INFO L87 Difference]: Start difference. First operand 6832 states and 11953 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:04,001 INFO L93 Difference]: Finished difference Result 17410 states and 30995 transitions. [2024-10-12 19:31:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:31:04,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-12 19:31:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:04,043 INFO L225 Difference]: With dead ends: 17410 [2024-10-12 19:31:04,043 INFO L226 Difference]: Without dead ends: 11594 [2024-10-12 19:31:04,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:31:04,062 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1212 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:04,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 857 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:31:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11594 states. [2024-10-12 19:31:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11594 to 11505. [2024-10-12 19:31:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11505 states, 9415 states have (on average 1.6804036112586298) internal successors, (15821), 9421 states have internal predecessors, (15821), 2063 states have call successors, (2063), 22 states have call predecessors, (2063), 26 states have return successors, (2258), 2061 states have call predecessors, (2258), 2062 states have call successors, (2258) [2024-10-12 19:31:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11505 states to 11505 states and 20142 transitions. [2024-10-12 19:31:04,541 INFO L78 Accepts]: Start accepts. Automaton has 11505 states and 20142 transitions. Word has length 119 [2024-10-12 19:31:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:04,544 INFO L471 AbstractCegarLoop]: Abstraction has 11505 states and 20142 transitions. [2024-10-12 19:31:04,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 11505 states and 20142 transitions. [2024-10-12 19:31:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 19:31:04,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:04,567 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:31:04,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:31:04,568 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:04,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1568232931, now seen corresponding path program 1 times [2024-10-12 19:31:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:04,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495051391] [2024-10-12 19:31:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:31:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:31:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:31:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:31:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:31:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:31:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:31:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495051391] [2024-10-12 19:31:04,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495051391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:04,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:04,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:31:04,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301515082] [2024-10-12 19:31:04,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:04,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:31:04,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:04,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:31:04,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:31:04,688 INFO L87 Difference]: Start difference. First operand 11505 states and 20142 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:06,150 INFO L93 Difference]: Finished difference Result 27536 states and 48813 transitions. [2024-10-12 19:31:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:31:06,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-12 19:31:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:06,209 INFO L225 Difference]: With dead ends: 27536 [2024-10-12 19:31:06,209 INFO L226 Difference]: Without dead ends: 17978 [2024-10-12 19:31:06,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:31:06,239 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1210 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:06,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 823 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:31:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17978 states. [2024-10-12 19:31:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17978 to 17889. [2024-10-12 19:31:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17889 states, 14596 states have (on average 1.6564812277336256) internal successors, (24178), 14602 states have internal predecessors, (24178), 3266 states have call successors, (3266), 22 states have call predecessors, (3266), 26 states have return successors, (3605), 3264 states have call predecessors, (3605), 3265 states have call successors, (3605) [2024-10-12 19:31:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17889 states to 17889 states and 31049 transitions. [2024-10-12 19:31:06,841 INFO L78 Accepts]: Start accepts. Automaton has 17889 states and 31049 transitions. Word has length 120 [2024-10-12 19:31:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:06,841 INFO L471 AbstractCegarLoop]: Abstraction has 17889 states and 31049 transitions. [2024-10-12 19:31:06,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 17889 states and 31049 transitions. [2024-10-12 19:31:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:31:06,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:06,862 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:31:06,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:31:06,862 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:06,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1019812634, now seen corresponding path program 1 times [2024-10-12 19:31:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755937498] [2024-10-12 19:31:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:31:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:31:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:31:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:31:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:31:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:31:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:31:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755937498] [2024-10-12 19:31:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755937498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:06,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:31:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756420827] [2024-10-12 19:31:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:06,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:31:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:06,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:31:06,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:31:06,959 INFO L87 Difference]: Start difference. First operand 17889 states and 31049 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:09,012 INFO L93 Difference]: Finished difference Result 47361 states and 83720 transitions. [2024-10-12 19:31:09,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:31:09,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-12 19:31:09,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:09,124 INFO L225 Difference]: With dead ends: 47361 [2024-10-12 19:31:09,124 INFO L226 Difference]: Without dead ends: 32011 [2024-10-12 19:31:09,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:31:09,168 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1206 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:09,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 844 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:31:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32011 states. [2024-10-12 19:31:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32011 to 31922. [2024-10-12 19:31:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31922 states, 26179 states have (on average 1.6533099048855953) internal successors, (43282), 26185 states have internal predecessors, (43282), 5716 states have call successors, (5716), 22 states have call predecessors, (5716), 26 states have return successors, (6329), 5714 states have call predecessors, (6329), 5715 states have call successors, (6329) [2024-10-12 19:31:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31922 states to 31922 states and 55327 transitions. [2024-10-12 19:31:10,332 INFO L78 Accepts]: Start accepts. Automaton has 31922 states and 55327 transitions. Word has length 121 [2024-10-12 19:31:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:10,333 INFO L471 AbstractCegarLoop]: Abstraction has 31922 states and 55327 transitions. [2024-10-12 19:31:10,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 31922 states and 55327 transitions. [2024-10-12 19:31:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 19:31:10,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:10,352 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:31:10,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:31:10,352 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:10,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1374062569, now seen corresponding path program 1 times [2024-10-12 19:31:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296513827] [2024-10-12 19:31:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:31:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:31:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:31:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:31:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:31:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:31:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:31:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:10,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296513827] [2024-10-12 19:31:10,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296513827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:10,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:10,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:31:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491710918] [2024-10-12 19:31:10,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:10,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:31:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:10,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:31:10,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:31:10,456 INFO L87 Difference]: Start difference. First operand 31922 states and 55327 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:13,147 INFO L93 Difference]: Finished difference Result 87083 states and 153179 transitions. [2024-10-12 19:31:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:31:13,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-12 19:31:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:13,567 INFO L225 Difference]: With dead ends: 87083 [2024-10-12 19:31:13,567 INFO L226 Difference]: Without dead ends: 58559 [2024-10-12 19:31:13,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:31:13,618 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1207 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:13,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 859 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 19:31:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58559 states. [2024-10-12 19:31:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58559 to 58470. [2024-10-12 19:31:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58470 states, 48214 states have (on average 1.6492305139586012) internal successors, (79516), 48220 states have internal predecessors, (79516), 10229 states have call successors, (10229), 22 states have call predecessors, (10229), 26 states have return successors, (11374), 10227 states have call predecessors, (11374), 10228 states have call successors, (11374) [2024-10-12 19:31:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58470 states to 58470 states and 101119 transitions. [2024-10-12 19:31:15,959 INFO L78 Accepts]: Start accepts. Automaton has 58470 states and 101119 transitions. Word has length 122 [2024-10-12 19:31:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:15,961 INFO L471 AbstractCegarLoop]: Abstraction has 58470 states and 101119 transitions. [2024-10-12 19:31:15,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 58470 states and 101119 transitions. [2024-10-12 19:31:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 19:31:15,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:15,986 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:31:15,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:31:15,986 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1551725850, now seen corresponding path program 1 times [2024-10-12 19:31:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:15,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612330719] [2024-10-12 19:31:15,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:15,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:31:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:31:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:31:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:31:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:31:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:31:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:31:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:16,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:16,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612330719] [2024-10-12 19:31:16,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612330719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:16,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:16,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:31:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762244774] [2024-10-12 19:31:16,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:16,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:31:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:31:16,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:31:16,068 INFO L87 Difference]: Start difference. First operand 58470 states and 101119 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:19,231 INFO L93 Difference]: Finished difference Result 109407 states and 192990 transitions. [2024-10-12 19:31:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:31:19,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-12 19:31:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:19,700 INFO L225 Difference]: With dead ends: 109407 [2024-10-12 19:31:19,701 INFO L226 Difference]: Without dead ends: 109261 [2024-10-12 19:31:19,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:31:19,745 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1203 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:19,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 855 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:31:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109261 states. [2024-10-12 19:31:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109261 to 109172. [2024-10-12 19:31:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109172 states, 90548 states have (on average 1.644067235057649) internal successors, (148867), 90554 states have internal predecessors, (148867), 18597 states have call successors, (18597), 22 states have call predecessors, (18597), 26 states have return successors, (20788), 18595 states have call predecessors, (20788), 18596 states have call successors, (20788) [2024-10-12 19:31:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109172 states to 109172 states and 188252 transitions. [2024-10-12 19:31:23,677 INFO L78 Accepts]: Start accepts. Automaton has 109172 states and 188252 transitions. Word has length 123 [2024-10-12 19:31:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:23,678 INFO L471 AbstractCegarLoop]: Abstraction has 109172 states and 188252 transitions. [2024-10-12 19:31:23,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 109172 states and 188252 transitions. [2024-10-12 19:31:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 19:31:23,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:23,711 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:31:23,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:31:23,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:23,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1493812566, now seen corresponding path program 1 times [2024-10-12 19:31:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084896328] [2024-10-12 19:31:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:31:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:31:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:31:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:31:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:31:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:31:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 19:31:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:23,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:23,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084896328] [2024-10-12 19:31:23,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084896328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:23,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:23,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:31:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159236104] [2024-10-12 19:31:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:23,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:31:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:31:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:23,869 INFO L87 Difference]: Start difference. First operand 109172 states and 188252 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:28,476 INFO L93 Difference]: Finished difference Result 109613 states and 192237 transitions. [2024-10-12 19:31:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 19:31:28,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-10-12 19:31:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:28,921 INFO L225 Difference]: With dead ends: 109613 [2024-10-12 19:31:28,922 INFO L226 Difference]: Without dead ends: 109474 [2024-10-12 19:31:28,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2024-10-12 19:31:28,965 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1830 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 3251 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 3251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:28,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 1141 Invalid, 3746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 3251 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 19:31:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109474 states. [2024-10-12 19:31:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109474 to 109313. [2024-10-12 19:31:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109313 states, 90656 states have (on average 1.6439397282033181) internal successors, (149033), 90663 states have internal predecessors, (149033), 18616 states have call successors, (18616), 34 states have call predecessors, (18616), 40 states have return successors, (20810), 18615 states have call predecessors, (20810), 18614 states have call successors, (20810) [2024-10-12 19:31:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109313 states to 109313 states and 188459 transitions. [2024-10-12 19:31:32,929 INFO L78 Accepts]: Start accepts. Automaton has 109313 states and 188459 transitions. Word has length 124 [2024-10-12 19:31:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:32,930 INFO L471 AbstractCegarLoop]: Abstraction has 109313 states and 188459 transitions. [2024-10-12 19:31:32,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 109313 states and 188459 transitions. [2024-10-12 19:31:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 19:31:32,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:32,964 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:31:32,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 19:31:32,965 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:32,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:32,965 INFO L85 PathProgramCache]: Analyzing trace with hash 299875084, now seen corresponding path program 1 times [2024-10-12 19:31:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809735603] [2024-10-12 19:31:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:31:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:31:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:31:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:31:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:31:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:31:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:31:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809735603] [2024-10-12 19:31:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809735603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-12 19:31:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198156707] [2024-10-12 19:31:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:33,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 19:31:33,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:33,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 19:31:33,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:31:33,243 INFO L87 Difference]: Start difference. First operand 109313 states and 188459 transitions. Second operand has 16 states, 14 states have (on average 5.714285714285714) internal successors, (80), 10 states have internal predecessors, (80), 8 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-12 19:31:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:38,546 INFO L93 Difference]: Finished difference Result 110008 states and 192889 transitions. [2024-10-12 19:31:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-12 19:31:38,547 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.714285714285714) internal successors, (80), 10 states have internal predecessors, (80), 8 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 125 [2024-10-12 19:31:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:39,103 INFO L225 Difference]: With dead ends: 110008 [2024-10-12 19:31:39,103 INFO L226 Difference]: Without dead ends: 109712 [2024-10-12 19:31:39,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=375, Invalid=1881, Unknown=0, NotChecked=0, Total=2256 [2024-10-12 19:31:39,143 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1551 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 5603 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 6133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 5603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:39,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 2230 Invalid, 6133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 5603 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 19:31:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109712 states. [2024-10-12 19:31:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109712 to 109450. [2024-10-12 19:31:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109450 states, 90755 states have (on average 1.6437992397113106) internal successors, (149183), 90767 states have internal predecessors, (149183), 18650 states have call successors, (18650), 37 states have call predecessors, (18650), 44 states have return successors, (20847), 18645 states have call predecessors, (20847), 18644 states have call successors, (20847) [2024-10-12 19:31:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109450 states to 109450 states and 188680 transitions. [2024-10-12 19:31:42,772 INFO L78 Accepts]: Start accepts. Automaton has 109450 states and 188680 transitions. Word has length 125 [2024-10-12 19:31:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:42,773 INFO L471 AbstractCegarLoop]: Abstraction has 109450 states and 188680 transitions. [2024-10-12 19:31:42,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.714285714285714) internal successors, (80), 10 states have internal predecessors, (80), 8 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-12 19:31:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 109450 states and 188680 transitions. [2024-10-12 19:31:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 19:31:42,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:42,813 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-12 19:31:42,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 19:31:42,814 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:42,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2107497012, now seen corresponding path program 1 times [2024-10-12 19:31:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:42,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837468254] [2024-10-12 19:31:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:31:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:31:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:31:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:31:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:31:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:31:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 19:31:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:43,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:43,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837468254] [2024-10-12 19:31:43,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837468254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:43,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:43,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 19:31:43,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305069848] [2024-10-12 19:31:43,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:43,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:31:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:43,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:31:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:31:43,635 INFO L87 Difference]: Start difference. First operand 109450 states and 188680 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:48,184 INFO L93 Difference]: Finished difference Result 110652 states and 193924 transitions. [2024-10-12 19:31:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 19:31:48,184 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2024-10-12 19:31:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:48,589 INFO L225 Difference]: With dead ends: 110652 [2024-10-12 19:31:48,589 INFO L226 Difference]: Without dead ends: 110402 [2024-10-12 19:31:48,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2024-10-12 19:31:48,628 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1620 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 4357 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 4829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 4357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:48,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 1618 Invalid, 4829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 4357 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 19:31:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110402 states. [2024-10-12 19:31:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110402 to 109885. [2024-10-12 19:31:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109885 states, 91084 states have (on average 1.6433292345527206) internal successors, (149681), 91100 states have internal predecessors, (149681), 18721 states have call successors, (18721), 63 states have call predecessors, (18721), 79 states have return successors, (20936), 18721 states have call predecessors, (20936), 18709 states have call successors, (20936) [2024-10-12 19:31:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109885 states to 109885 states and 189338 transitions. [2024-10-12 19:31:52,807 INFO L78 Accepts]: Start accepts. Automaton has 109885 states and 189338 transitions. Word has length 128 [2024-10-12 19:31:52,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:52,808 INFO L471 AbstractCegarLoop]: Abstraction has 109885 states and 189338 transitions. [2024-10-12 19:31:52,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:31:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 109885 states and 189338 transitions. [2024-10-12 19:31:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 19:31:52,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:52,842 INFO L215 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] [2024-10-12 19:31:52,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 19:31:52,843 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:52,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash 761323511, now seen corresponding path program 1 times [2024-10-12 19:31:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:52,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994325063] [2024-10-12 19:31:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:31:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:31:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:31:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:31:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:31:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:31:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 19:31:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 19:31:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994325063] [2024-10-12 19:31:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994325063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:53,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-12 19:31:53,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898500248] [2024-10-12 19:31:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:53,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 19:31:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:53,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 19:31:53,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:31:53,163 INFO L87 Difference]: Start difference. First operand 109885 states and 189338 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 10 states have internal predecessors, (87), 6 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13)